Fred S. Annexstein Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
c19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Kenneth A. Berman: Synthesis ranking with critic resonance. WebSci 2012: 15-23
2008
c18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Svetlana Strunjas: Collaborative partitioning with maximum user satisfaction. CIKM 2008: 1445-1446
2007
c17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Michael T. Helmick, Fred S. Annexstein: Depth-Latency Tradeoffs in Multicast Tree Algorithms. AINA 2007: 555-564
c16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan: Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. PerCom Workshops 2006: 91-95
c14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Kenneth A. Berman: A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. P2PKM 2004
c12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman: The lonely NATed node. ACM SIGOPS European Workshop 2004: 36
2001
c11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Kenneth A. Berman: Directional Routing via Generalized st-Numberings. SIAM J. Discrete Math. 13(2): 268-279 (2000)
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Kenneth A. Berman: Distributed Models and Algorithms for Survivability in Network Routing. IPDPS 2000: 359-364
1998
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Ramjee P. Swaminathan: On Testing Consecutive-ones Property in Parallel. Discrete Applied Mathematics 88(1-3): 7-28 (1998)
1997
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein: Generating De Bruijn Sequences: An Efficient Implementation. IEEE Trans. Computers 46(2): 198-200 (1997)
c9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON 1997: 18-22
c8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan: On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23
c7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Chris Giannella: An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. SIROCCO 1997: 176-187
1995
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Ramjee P. Swaminathan: On Testing Consecutive-Ones Property in Parallel. SPAA 1995: 234-243
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Eugene A. Kuchko: A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. WADS 1995: 263-269
1994
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein: Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays. J. Parallel Distrib. Comput. 23(1): 72-79 (1994)
1993
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Marc Baumslag: On the Diameter and Bisector Size of Cayley Graphs. Mathematical Systems Theory 26(3): 271-291 (1993)
1992
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein: Parallel Implementations of Graph Embeddings. Heinz Nixdorf Symposium 1992: 207-217
1991
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Marc Baumslag, Fred S. Annexstein: A Unified Framework for Off-Line Permutation Routing in Parallel Networks. Mathematical Systems Theory 24(4): 233-251 (1991)
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein: SIMD-emulations of hypercubes and related networks. SPDP 1991: 656-659
1990
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg: Group Action Graphs and Parallel Architectures. SIAM J. Comput. 19(3): 544-569 (1990)
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein, Marc Baumslag: A Unified Approach to Off-Line Permutation Routing on Parallel Networks. SPAA 1990: 398-406
1989
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Fred S. Annexstein: Fault Tolerance in Hypercube-Derivative Networks. SPAA 1989: 179-188

Coauthor Index

1Marc Baumslag
[j3] [j2] [j1] [c2]
2Kenneth A. Berman
[c19] [c16] [j11] [c15] [c14] [c13] [c12] [c11] [j10] [j9] [c10] [c9] [c8]
3Brent N. Chun
[c12]
4John V. Franco
[j6] [j5]
5Chris Giannella
[c7]
6Michael T. Helmick
[c17]
7Tsan-sheng Hsu
[j9]
8Mihajlo A. Jovanovic
[j11] [c11]
9Eugene A. Kuchko
[c5]
10Aravind Ranganathan
[c15]
11Arnold L. Rosenberg
[j1]
12John S. Schlipf
[j5]
13Svetlana Strunjas (Svetlana Strunjas-Yoshikawa)
[c18] [c16] [c14]
14Ramjee P. Swaminathan
[j9] [j8] [c9] [c8] [j5] [c6]
15Amin Vahdat
[c12]
16Chad Yoshikawa
[c16] [c12]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sat May 25 02:50:10 2013 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page