K. Berman

发表

Telephone problems with failures

M. Hawrylycz, K. Berman, 1986 .

Vulnerability of scheduled networks and a generalization of Menger's Theorem

K. Berman, 1996, Networks.

Matrix norm inequalities and the relative Dixmier property

K. Berman, Herbert Halpern, V. Kaftal, 1988 .

A $4$-color theorem for surfaces of genus $g$

J. L. Paul, K. Berman, 1989 .

Canonical Genetic Signatures of the Adult Human Brain

Allan R. Jones, John W. Phillips, C. Koch, 2015, Nature Neuroscience.

Cost-Constrained Matchings and Disjoint Paths

K. Berman, 2003 .

Cheng Zhu, Anil G. Jegga, Akash Kushwaha, 2012, BMC Systems Biology.

Synthesis ranking with critic resonance

Fred S. Annexstein, Kenneth A. Berman, K. Berman, 2012, WebSci '12.

Balanced vertex weightings and arborescences

Kenneth A. Berman, K. Berman, 1987, J. Comb. Theory, Ser. B.

Algorithms: Sequential, Parallel, and Distributed

Jerome L. Paul, Kenneth A. Berman, J. L. Paul, 2004 .

Proof of a conjecture of Häggkvist on cycles and independent edges

Kenneth A. Berman, K. Berman, 1983, Discret. Math..

A template library to facilitate teaching message passing parallel computing

Michal Kouril, Kenneth A. Berman, Jerome L. Paul, 2006, SIGCSE '06.

Independent Spanning Trees with Small Stretch Factors

Fred S. Annexstein, K. Berman, Ken Berman, 1996 .

Dynamic Structures for Routing and Load-balancing in Wireless Sensor Networks

K. Berman, 2008 .

Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory

Noga Alon, Kenneth A. Berman, N. Alon, 1986, J. Comb. Theory, Ser. A.

The lonely NATed node

Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman, 2004, EW 11.

MODELING PEER-TO-PEER NETWORK TOPOLOGIES THROUGH "SMALL-WORLD" MODELS AND POWER LAWS

Fred S. Annexstein, Kenneth A. Berman, K. Berman, 2001 .

Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time

John S. Schlipf, Kenneth A. Berman, John Franco, 1995, Discret. Appl. Math..

Canonical Genetic Signatures of the Adult Human Brain

Allan R. Jones, John W. Phillips, C. Koch, 2015, Nature Neuroscience.

Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem

Xin Liu, Kenneth A. Berman, K. Berman, 1998, J. Comb. Theory, Ser. B.

Directional Routing via Generalized st-Numberings

Fred S. Annexstein, Kenneth A. Berman, K. Berman, 2000, SIAM J. Discret. Math..

Parity results on connected f-factors

Kenneth A. Berman, K. Berman, 1986, Discret. Math..

A Generalization to Bases Common to r Binary Matroids A the Weighted Matrix-Tree Theorem in the Case when the Weights are Boolean

Kenneth A. Berman, K. Berman, 1984, Eur. J. Comb..

A note on coloured quadrangulations

Kenneth A. Berman, K. Berman, 1980, Discret. Math..

Discovering Adaptive Heuristics for Ad-Hoc Sensor Networks by Mining Evolved Optimal Configurations

Ali A. Minai, Kenneth A. Berman, Prasanna Ranganathan, 2006, 2006 IEEE International Conference on Evolutionary Computation.

Vulnerability of scheduled networks and a generalization of Menger's Theorem

Kenneth A. Berman, K. Berman, 1996, Networks.