Search the dblp DataBase
Kenneth A. Berman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. [Citation Graph (0, 0)][DBLP]
COCOON, 1997, pp:18-22 [Conf] - Fred S. Annexstein, Kenneth A. Berman
Distributed Models and Algorithms for Survivability in Network Routing. [Citation Graph (0, 0)][DBLP]
IPDPS, 2000, pp:359-364 [Conf] - Kenneth A. Berman, John S. Schlipf, John V. Franco
Computing Well-founded Semantics Faster. [Citation Graph (0, 0)][DBLP]
LPNMR, 1995, pp:113-126 [Conf] - Fred S. Annexstein, Kenneth A. Berman
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. [Citation Graph (0, 0)][DBLP]
P2PKM, 2004, pp:- [Conf] - Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. [Citation Graph (0, 0)][DBLP]
PerCom Workshops, 2006, pp:91-95 [Conf] - Jerome L. Paul, Michal Kouril, Kenneth A. Berman
A template library to facilitate teaching message passing parallel computing. [Citation Graph (0, 0)][DBLP]
SIGCSE, 2006, pp:464-468 [Conf] - Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1997, pp:12-23 [Conf] - Svetlana Strunjas-Yoshikawa, Fred S. Annexstein, Kenneth A. Berman
Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet. [Citation Graph (0, 0)][DBLP]
SOFSEM, 2006, pp:511-520 [Conf] - Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic
Latency effects on reachability in large-scale peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
SPAA, 2001, pp:84-92 [Conf] - Kenneth A. Berman, John V. Franco, John S. Schlipf
Unique Satisfiability of Horn Sets Can Be Solved in Nearly Linear Time. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:77-91 [Journal] - Kenneth A. Berman, Yanpei Liu
Generalized Bicycles. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:27-40 [Journal] - Kenneth A. Berman, Jerome L. Paul
Verifiable broadcasting and gossiping in communication networks. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 2002, v:118, n:3, pp:293-298 [Journal] - Noga Alon, Kenneth A. Berman
Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 1986, v:43, n:1, pp:91-97 [Journal] - Noga Alon, Kenneth A. Berman, Daniel J. Kleitman
On a Problem in Shuffling. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. A, 2000, v:91, n:1-2, pp:5-14 [Journal] - Kenneth A. Berman
Balanced vertex weightings and arborescences. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1987, v:42, n:3, pp:274-301 [Journal] - Kenneth A. Berman, Xin Liu
Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1998, v:74, n:1, pp:20-27 [Journal] - Kenneth A. Berman, Jerome L. Paul
The bounded chromatic number for graphs of genus g. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1992, v:56, n:2, pp:183-196 [Journal] - Kenneth A. Berman
Three-colourings of planar 4-valent maps. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1981, v:30, n:1, pp:82-88 [Journal] - Kenneth A. Berman
Matchings and spanning trees in Boolean weighted graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1981, v:30, n:3, pp:343-350 [Journal] - Kenneth A. Berman
Vulnerability of scheduled networks and a generalization of Menger's Theorem. [Citation Graph (0, 0)][DBLP]
Networks, 1996, v:28, n:3, pp:125-134 [Journal] - Kenneth A. Berman, Mokhtar H. Konsowa
Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 1990, v:3, n:3, pp:311-319 [Journal] - Fred S. Annexstein, Kenneth A. Berman
Directional Routing via Generalized st-Numberings. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2000, v:13, n:2, pp:268-279 [Journal] - Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan
A multi-tree routing scheme using acyclic orientations. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:240, n:2, pp:487-494 [Journal] - Fred S. Annexstein, Kenneth A. Berman, Mijhalo A. Jovanovic
Broadcasting in unstructured peer-to-peer overlay networks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:355, n:1, pp:25-36 [Journal] - Fred S. Annexstein, Ken Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. [Citation Graph (0, 0)][DBLP]
ALENEX, 2007, pp:- [Conf] - Kenneth A. Berman
Parity results on connected f-factors. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1986, v:59, n:1-2, pp:1-8 [Journal] - Kenneth A. Berman
Proof of a conjecture of Häggkvist on cycles and independent edges. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1983, v:46, n:1, pp:9-13 [Journal]
Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. [Citation Graph (, )][DBLP]
The lonely NATed node. [Citation Graph (, )][DBLP]
Search in 0.025secs, Finished in 0.026secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002