Fred S. Annexstein

According to our database, Fred S. Annexstein authored at least 33 papers between 1989 and 2013.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2013

A GPGPU Algorithm for c-Approximate r-Nearest Neighbor Search in High Dimensions.

Lee Carraher, Philip A. Wilsey, Fred S. Annexstein

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012

Synthesis ranking with critic resonance.

Fred S. Annexstein, Kenneth A. Berman

Proceedings of the Web Science 2012, 2012

2008

Collaborative partitioning with maximum user satisfaction.

Fred S. Annexstein, Svetlana Strunjas

Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007

Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service.

Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

Depth-Latency Tradeoffs in Multicast Tree Algorithms.

Michael T. Helmick, Fred S. Annexstein

Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006

Broadcasting in unstructured peer-to-peer overlay networks.

Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic

Theor. Comput. Sci., 2006

Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet.

Svetlana Strunjas-Yoshikawa, Fred S. Annexstein, Kenneth A. Berman

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Dominating Connectivity and Reliability of Heterogeneous Sensor Networks.

Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

2004

The lonely NATed node.

Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman

Proceedings of the 11st ACM SIGOPS European Workshop, 2004

A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities.

Fred S. Annexstein, Kenneth A. Berman

Proceedings of the MobiQuitous'04 Workshop on Peer-to-Peer Knowledge Management (P2PKM 2004), 2004

2002

Indexing techniques for file sharing in scalable peer-to-peer networks.

Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko

Proceedings of the 11th International Conference on Computer Communications and Networks, 2002

2001

Latency effects on reachability in large-scale peer-to-peer networks.

Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

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

Directional Routing via Generalized <i>st</i>-Numberings.

Fred S. Annexstein, Kenneth A. Berman

SIAM J. Discret. Math., 2000

Distributed Models and Algorithms for Survivability in Network Routing.

Fred S. Annexstein, Kenneth A. Berman

Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1998

On Testing Consecutive-ones Property in Parallel.

Fred S. Annexstein, Ramjee P. Swaminathan

Discret. Appl. Math., 1998

1997

Generating De Bruijn Sequences: An Efficient Implementation.

Fred S. Annexstein

IEEE Trans. Computers, 1997

An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks.

Fred S. Annexstein, Chris Giannella

Proceedings of the SIROCCO'97, 1997

On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings.

Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan

Proceedings of the SIROCCO'97, 1997

A Multi-Tree Generating Routing Scheme Using Acyclic Orientations.

Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1995

On Finding Solutions for Extended Horn Formulas.

John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan

Inf. Process. Lett., 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

A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs.

Fred S. Annexstein, Eugene A. Kuchko

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays.

Fred S. Annexstein

J. Parallel Distributed Comput., 1994

Ranking algorithms for Hamiltonian paths in hypercubic networks.

Fred S. Annexstein

Proceedings of the Workshop on Interconnection Networks and Mapping and Scheduling Parallel Computations, 1994

1993

On the Diameter and Bisector Size of Cayley Graphs.

Fred S. Annexstein, Marc Baumslag

Math. Syst. Theory, 1993

1992

Parallel Implementations of Graph Embeddings.

Fred S. Annexstein

Proceedings of the Parallel Architectures and Their Efficient Use, 1992

1991

Fault tolerance in hypercube-derivative networks (preliminary version).

Fred S. Annexstein

SIGARCH Comput. Archit. News, 1991

A Unified Framework for Off-Line Permutation Routing in Parallel Networks.

Marc Baumslag, Fred S. Annexstein

Math. Syst. Theory, 1991

SIMD-emulations of hypercubes and related networks.

Fred S. Annexstein

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

1990

Group Action Graphs and Parallel Architectures.

Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg

SIAM J. Comput., 1990

A Unified Approach to Off-Line Permutation Routing on Parallel Networks.

Fred S. Annexstein, Marc Baumslag

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1989

Fault Tolerance in Hypercube-Derivative Networks.

Fred S. Annexstein

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989