Kenneth A. Berman

43 papers A 3B 6Misc 2Journal 27Unranked 5

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