default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKenneth A. Berman
- > Home > Persons > Kenneth A. Berman
Publications
- 2012
[c16]Fred S. Annexstein, Kenneth A. Berman:
Synthesis ranking with critic resonance. WebSci 2012: 15-23- 2007
- [c13]Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa:
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. ALENEX 2007 - 2006
- [j25]Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic:
Broadcasting in unstructured peer-to-peer overlay networks. Theor. Comput. Sci. 355(1): 25-36 (2006) - [c11]Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan:
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. PerCom Workshops 2006: 91-95 - [c9]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: 511-520 - 2004
- [c8]Fred S. Annexstein, Kenneth A. Berman:
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. P2PKM 2004 - [c7]Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman:
The lonely NATed node. ACM SIGOPS European Workshop 2004: 36 - 2002
- [c6]Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko:
Indexing techniques for file sharing in scalable peer-to-peer networks. ICCCN 2002: 10-15 - 2001
- [c5]Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic:
Latency effects on reachability in large-scale peer-to-peer networks. SPAA 2001: 84-92 - 2000
- [j22]Fred S. Annexstein, Kenneth A. Berman:
Directional Routing via Generalized st-Numberings. SIAM J. Discret. Math. 13(2): 268-279 (2000) - [j21]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): 487-494 (2000) - [c4]Fred S. Annexstein, Kenneth A. Berman:
Distributed Models and Algorithms for Survivability in Network Routing. IPDPS 2000: 359-364 - 1997
- [c3]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan:
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON 1997: 18-22 - [c2]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan:
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
