Kenneth A. Berman

According to our database, Kenneth A. Berman authored at least 42 papers between 1978 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2012

Synthesis ranking with critic resonance.

Fred S. Annexstein, Kenneth A. Berman

Proceedings of the Web Science 2012, 2012

2011

Why locally-fair maximal flows in client-server networks perform well.

Kenneth A. Berman, Chad Yoshikawa

J. Comb. Optim., 2011

2010

Dynamic state-based routing for load balancing and efficient data gathering in wireless sensor networks.

Aravind Ranganathan, Kenneth A. Berman

Proceedings of the 2010 International Symposium on Collaborative Technologies and Systems, 2010

2007

Locating Servers for Reliability and Affine Embeddings.

Kenneth A. Berman

SIAM J. Discret. Math., 2007

Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service.

Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

Broadcasting in unstructured peer-to-peer overlay networks.

Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic

Theor. Comput. Sci., 2006

Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet.

Svetlana Strunjas-Yoshikawa, Fred S. Annexstein, Kenneth A. Berman

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

A template library to facilitate teaching message passing parallel computing.

Jerome L. Paul, Michal Kouril, Kenneth A. Berman

Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education, 2006

Dominating Connectivity and Reliability of Heterogeneous Sensor Networks.

Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

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

Prasanna Ranganathan, Aravind Ranganathan, Kenneth A. Berman, Ali A. Minai

Proceedings of the IEEE International Conference on Evolutionary Computation, 2006

2004

The lonely NATed node.

Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman

Proceedings of the 11st ACM SIGOPS European Workshop, 2004

A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities.

Fred S. Annexstein, Kenneth A. Berman

Proceedings of the MobiQuitous'04 Workshop on Peer-to-Peer Knowledge Management (P2PKM 2004), 2004

2002

Verifiable broadcasting and gossiping in communication networks.

Kenneth A. Berman, Jerome L. Paul

Discret. Appl. Math., 2002

Indexing techniques for file sharing in scalable peer-to-peer networks.

Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko

Proceedings of the 11th International Conference on Computer Communications and Networks, 2002

2001

Latency effects on reachability in large-scale peer-to-peer networks.

Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

A multi-tree routing scheme using acyclic orientations.

Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan

Theor. Comput. Sci., 2000

Directional Routing via Generalized <i>st</i>-Numberings.

Fred S. Annexstein, Kenneth A. Berman

SIAM J. Discret. Math., 2000

On a Problem in Shuffling.

Noga Alon, Kenneth A. Berman, Daniel J. Kleitman

J. Comb. Theory A, 2000

Distributed Models and Algorithms for Survivability in Network Routing.

Fred S. Annexstein, Kenneth A. Berman

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1998

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

Kenneth A. Berman, Xin Liu

J. Comb. Theory B, 1998

1997

Generalized Bicycles.

Kenneth A. Berman, Yanpei Liu

Discret. Appl. Math., 1997

On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.

Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan

Proceedings of the SIROCCO'97, 1997

A Multi-Tree Generating Routing Scheme Using Acyclic Orientations.

Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

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

Kenneth A. Berman

Networks, 1996

1995

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

Kenneth A. Berman, John V. Franco, John S. Schlipf

Discret. Appl. Math., 1995

Computing Well-founded Semantics Faster.

Kenneth A. Berman, John S. Schlipf, John V. Franco

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

1992

The bounded chromatic number for graphs of genus <i>g</i>.

Kenneth A. Berman, Jerome L. Paul

J. Comb. Theory B, 1992

1990

Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains.

Kenneth A. Berman, Mokhtar H. Konsowa

SIAM J. Discret. Math., 1990

1987

Balanced vertex weightings and arborescences.

Kenneth A. Berman

J. Comb. Theory B, 1987

1986

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

Noga Alon, Kenneth A. Berman

J. Comb. Theory A, 1986

Parity results on connected f-factors.

Kenneth A. Berman

Discret. Math., 1986

1984

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

Eur. J. Comb., 1984

1983

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

Kenneth A. Berman

Discret. Math., 1983

1981

Matchings and spanning trees in Boolean weighted graphs.

Kenneth A. Berman

J. Comb. Theory B, 1981

Three-colourings of planar 4-valent maps.

Kenneth A. Berman

J. Comb. Theory B, 1981

1980

A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons.

Kenneth A. Berman

SIAM J. Algebraic Discret. Methods, 1980

A Proof of Tuite's Trinity Theorem and a New Determinant Formula.

Kenneth A. Berman

SIAM J. Algebraic Discret. Methods, 1980

A note on coloured quadrangulations.

Kenneth A. Berman

Discret. Math., 1980

1979

Full 4-colorings of 4-regular maps.

Kenneth A. Berman, H. Shank

J. Graph Theory, 1979

Spanning arborescences, ingraphs, and outgraphs.

Kenneth A. Berman

J. Graph Theory, 1979

1978

Directed faces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps.

Kenneth A. Berman

Discret. Math., 1978

Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths.

Kenneth A. Berman

Discret. Math., 1978