Fault Tolerance in Hypercube-Derivative Networks. - Fred S. Annexstein (SPAA, 1989)

A Unified Approach to Off-Line Permutation Routing on Parallel Networks. - Fred S. Annexstein; Marc Baumslag (SPAA, 1990)

Group Action Graphs and Parallel Architectures. - Fred S. Annexstein; Marc Baumslag; Arnold L. Rosenberg (SIAM J. Comput., 1990)

SIMD-emulations of hypercubes and related networks. - Fred S. Annexstein (SPDP, 1991)

A Unified Framework for Off-Line Permutation Routing in Parallel Networks. - Marc Baumslag; Fred S. Annexstein (Math. Syst. Theory, 1991)

Fault tolerance in hypercube-derivative networks (preliminary version). - Fred S. Annexstein (SIGARCH Comput. Archit. News, 1991)

Parallel Implementations of Graph Embeddings. - Fred S. Annexstein (Heinz Nixdorf Symposium, 1992)

On the Diameter and Bisector Size of Cayley Graphs. - Fred S. Annexstein; Marc Baumslag (Math. Syst. Theory, 1993)

Ranking algorithms for Hamiltonian paths in hypercubic networks. - Fred S. Annexstein (Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994)

Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays. - Fred S. Annexstein (J. Parallel Distributed Comput., 1994)

A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. - Fred S. Annexstein; Eugene A. Kuchko (WADS, 1995)

Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. - Fred S. Annexstein; John V. Franco (Discret. Appl. Math., 1995)

On Finding Solutions for Extended Horn Formulas. - John S. Schlipf; Fred S. Annexstein; John V. Franco; Ramjee P. Swaminathan (Inf. Process. Lett., 1995)

A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. - Fred S. Annexstein; Kenneth A. Berman; Ramjee P. Swaminathan (COCOON, 1997)

On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. - Fred S. Annexstein; Kenneth A. Berman; Ramjee P. Swaminathan (SIROCCO, 1997)

An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. - Fred S. Annexstein; Chris Giannella (SIROCCO, 1997)

Generating De Bruijn Sequences: An Efficient Implementation. - Fred S. Annexstein (IEEE Trans. Computers, 1997)

On Testing Consecutive-ones Property in Parallel. - Fred S. Annexstein; Ramjee P. Swaminathan (Discret. Appl. Math., 1998)

Distributed Models and Algorithms for Survivability in Network Routing. - Fred S. Annexstein; Kenneth A. Berman (IPDPS, 2000)

Directional Routing via Generalized st-Numberings. - Fred S. Annexstein; Kenneth A. Berman (SIAM J. Discret. Math., 2000)

A multi-tree routing scheme using acyclic orientations. - Fred S. Annexstein; Kenneth A. Berman; Tsan-sheng Hsu; Ramjee P. Swaminathan (Theor. Comput. Sci., 2000)

Latency effects on reachability in large-scale peer-to-peer networks. - Fred S. Annexstein; Kenneth A. Berman; Mihajlo A. Jovanovic (SPAA, 2001)

Indexing techniques for file sharing in scalable peer-to-peer networks. - Fred S. Annexstein; Kenneth A. Berman; Mihajlo A. Jovanovic; Kovendhan Ponnavaikko (ICCCN, 2002)

A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. - Fred S. Annexstein; Kenneth A. Berman (P2PKM, 2004)

The lonely NATed node. - Chad Yoshikawa; Brent N. Chun; Amin Vahdat; Fred S. Annexstein; Kenneth A. Berman (ACM SIGOPS European Workshop, 2004)

Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. - Kenneth A. Berman; Fred S. Annexstein; Aravind Ranganathan (PerCom Workshops, 2006)

Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet. - Svetlana Strunjas-Yoshikawa; Fred S. Annexstein; Kenneth A. Berman (SOFSEM, 2006)

Broadcasting in unstructured peer-to-peer overlay networks. - Fred S. Annexstein; Kenneth A. Berman; Mihajlo A. Jovanovic (Theor. Comput. Sci., 2006)

Depth-Latency Tradeoffs in Multicast Tree Algorithms. - Michael T. Helmick; Fred S. Annexstein (AINA, 2007)

Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. - Fred S. Annexstein; Kenneth A. Berman; Svetlana Strunjas-Yoshikawa; Chad Yoshikawa (ALENEX, 2007)

Collaborative partitioning with maximum user satisfaction. - Fred S. Annexstein; Svetlana Strunjas (CIKM, 2008)

Synthesis ranking with critic resonance. - Fred S. Annexstein; Kenneth A. Berman (WebSci, 2012)

A GPGPU Algorithm for c-Approximate r-Nearest Neighbor Search in High Dimensions. - Lee Carraher; Philip A. Wilsey; Fred S. Annexstein (IPDPS Workshops, 2013)