Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Fred S. Annexstein
2010 – today
- 2012
[c19]
2000 – 2009
- 2008
- [c18]Fred S. Annexstein, Svetlana Strunjas: Collaborative partitioning with maximum user satisfaction. CIKM 2008: 1445-1446
- 2007
- [c17]Michael T. Helmick, Fred S. Annexstein: Depth-Latency Tradeoffs in Multicast Tree Algorithms. AINA 2007: 555-564
- [c16]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
- [j11]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)
- [c15]Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan: Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. PerCom Workshops 2006: 91-95
- [c14]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
- [c13]Fred S. Annexstein, Kenneth A. Berman: A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. P2PKM 2004
- [c12]Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman: The lonely NATed node. ACM SIGOPS European Workshop 2004: 36
- 2001
- [c11]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
- [j10]Fred S. Annexstein, Kenneth A. Berman: Directional Routing via Generalized st-Numberings. SIAM J. Discrete Math. 13(2): 268-279 (2000)
- [j9]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)
- [c10]Fred S. Annexstein, Kenneth A. Berman: Distributed Models and Algorithms for Survivability in Network Routing. IPDPS 2000: 359-364
1990 – 1999
- 1998
- [j8]Fred S. Annexstein, Ramjee P. Swaminathan: On Testing Consecutive-ones Property in Parallel. Discrete Applied Mathematics 88(1-3): 7-28 (1998)
- 1997
- [j7]Fred S. Annexstein: Generating De Bruijn Sequences: An Efficient Implementation. IEEE Trans. Computers 46(2): 198-200 (1997)
- [c9]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON 1997: 18-22
- [c8]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23
- [c7]Fred S. Annexstein, Chris Giannella: An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. SIROCCO 1997: 176-187
- 1995
- [j6]Fred S. Annexstein, John V. Franco: Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. Discrete Applied Mathematics 60(1-3): 13-23 (1995)
- [j5]John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan: On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. 54(3): 133-137 (1995)
- [c6]Fred S. Annexstein, Ramjee P. Swaminathan: On Testing Consecutive-Ones Property in Parallel. SPAA 1995: 234-243
- [c5]Fred S. Annexstein, Eugene A. Kuchko: A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. WADS 1995: 263-269
- 1994
- [j4]Fred S. Annexstein: Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays. J. Parallel Distrib. Comput. 23(1): 72-79 (1994)
- 1993
- [j3]Fred S. Annexstein, Marc Baumslag: On the Diameter and Bisector Size of Cayley Graphs. Mathematical Systems Theory 26(3): 271-291 (1993)
- 1992
- [c4]Fred S. Annexstein: Parallel Implementations of Graph Embeddings. Heinz Nixdorf Symposium 1992: 207-217
- 1991
- [j2]Marc Baumslag, Fred S. Annexstein: A Unified Framework for Off-Line Permutation Routing in Parallel Networks. Mathematical Systems Theory 24(4): 233-251 (1991)
- [c3]
- 1990
- [j1]Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg: Group Action Graphs and Parallel Architectures. SIAM J. Comput. 19(3): 544-569 (1990)
- [c2]Fred S. Annexstein, Marc Baumslag: A Unified Approach to Off-Line Permutation Routing on Parallel Networks. SPAA 1990: 398-406
1980 – 1989
- 1989
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-11-29 01:02 CET by the dblp team