Kenneth A. Berman

Publication Activity (10 Years)

Years Active: 1978-2012
Publications (10 Years): 0

Top Topics

Ranking Algorithm

Program Synthesis

Top Venues

Publications

Fred S. Annexstein, Kenneth A. Berman
Synthesis ranking with critic resonance. WebSci (2012)
Kenneth A. Berman, Chad Yoshikawa
Why locally-fair maximal flows in client-server networks perform well. J. Comb. Optim. 22 (3) (2011)
Aravind Ranganathan, Kenneth A. Berman
Dynamic state-based routing for load balancing and efficient data gathering in wireless sensor networks. CTS (2010)
Kenneth A. Berman, Chad Yoshikawa
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. COCOON (2009)
Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. ALENEX (2007)
Kenneth A. Berman
Locating Servers for Reliability and Affine Embeddings. SIAM J. Discret. Math. 21 (3) (2007)
Prasanna Ranganathan, Aravind Ranganathan, Kenneth A. Berman, Ali A. Minai
Discovering Adaptive Heuristics for Ad-Hoc Sensor Networks by Mining Evolved Optimal Configurations. IEEE Congress on Evolutionary Computation (2006)
Jerome L. Paul, Michal Kouril, Kenneth A. Berman
A template library to facilitate teaching message passing parallel computing. SIGCSE (2006)
Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. PerCom Workshops (2006)
Svetlana Strunjas-Yoshikawa, Fred S. Annexstein, Kenneth A. Berman
Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet. SOFSEM (2006)
Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic
Broadcasting in unstructured peer-to-peer overlay networks. Theor. Comput. Sci. 355 (1) (2006)
Fred S. Annexstein, Kenneth A. Berman
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. P2PKM (2004)
Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman
The lonely NATed node. ACM SIGOPS European Workshop (2004)
Kenneth A. Berman, Jerome L. Paul
Verifiable broadcasting and gossiping in communication networks. Discret. Appl. Math. 118 (3) (2002)
Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko
Indexing techniques for file sharing in scalable peer-to-peer networks. ICCCN (2002)
Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic
Latency effects on reachability in large-scale peer-to-peer networks. SPAA (2001)
Fred S. Annexstein, Kenneth A. Berman
-Numberings. SIAM J. Discret. Math. 13 (2) (2000)
Noga Alon, Kenneth A. Berman, Daniel J. Kleitman
On a Problem in Shuffling. J. Comb. Theory, Ser. A 91 (1-2) (2000)
Fred S. Annexstein, Kenneth A. Berman
Distributed Models and Algorithms for Survivability in Network Routing. IPDPS (2000)
Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan
A multi-tree routing scheme using acyclic orientations. Theor. Comput. Sci. 240 (2) (2000)
Kenneth A. Berman, Xin Liu
Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem. J. Comb. Theory, Ser. B 74 (1) (1998)
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON (1997)
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO (1997)
Kenneth A. Berman, Yanpei Liu
Generalized Bicycles. Discret. Appl. Math. 78 (1-3) (1997)
Kenneth A. Berman
Vulnerability of scheduled networks and a generalization of Menger's Theorem. Networks 28 (3) (1996)
Kenneth A. Berman, John S. Schlipf, John V. Franco
Computing Well-founded Semantics Faster. LPNMR (1995)
Kenneth A. Berman, John V. Franco, John S. Schlipf
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. Discret. Appl. Math. 60 (1-3) (1995)
Kenneth A. Berman, Jerome L. Paul
. J. Comb. Theory, Ser. B 56 (2) (1992)
Kenneth A. Berman, Mokhtar H. Konsowa
Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains. SIAM J. Discret. Math. 3 (3) (1990)
Kenneth A. Berman
Balanced vertex weightings and arborescences. J. Comb. Theory, Ser. B 42 (3) (1987)
Noga Alon, Kenneth A. Berman
Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. J. Comb. Theory, Ser. A 43 (1) (1986)
Kenneth A. Berman
Parity results on connected f-factors. Discret. Math. 59 (1-2) (1986)
Kenneth A. Berman
A Generalization to Bases Common to r Binary Matroids A the Weighted Matrix-Tree Theorem in the Case when the Weights are Boolean. Eur. J. Comb. 5 (3) (1984)
Kenneth A. Berman
Proof of a conjecture of Häggkvist on cycles and independent edges. Discret. Math. 46 (1) (1983)
Kenneth A. Berman
Three-colourings of planar 4-valent maps. J. Comb. Theory, Ser. B 30 (1) (1981)
Kenneth A. Berman
Matchings and spanning trees in Boolean weighted graphs. J. Comb. Theory, Ser. B 30 (3) (1981)
Kenneth A. Berman
A note on coloured quadrangulations. Discret. Math. 29 (2) (1980)
Kenneth A. Berman
A Proof of Tuite's Trinity Theorem and a New Determinant Formula. SIAM J. Algebraic Discret. Methods 1 (1) (1980)
Kenneth A. Berman
A Graph Theoretical Approach to Handicap Ranking of Tournaments and Paired Comparisons. SIAM J. Algebraic Discret. Methods 1 (3) (1980)
Kenneth A. Berman, H. Shank
Full 4-colorings of 4-regular maps. J. Graph Theory 3 (3) (1979)
Kenneth A. Berman
Spanning arborescences, ingraphs, and outgraphs. J. Graph Theory 3 (2) (1979)
Kenneth A. Berman
Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths. Discret. Math. 22 (1) (1978)
Kenneth A. Berman
Directed faces in planar digraphs and unicoloured faces in edge 2-coloured planar Eulerian maps. Discret. Math. 21 (1) (1978)