Fred S. Annexstein

Publication Activity (10 Years)

Years Active: 1989-2013
Publications (10 Years): 0

Top Topics

Ranking Algorithm

Nearest Neighbor Search

Exhaustive Search

Top Venues

IPDPS Workshops

Publications

Lee Carraher, Philip A. Wilsey, Fred S. Annexstein
A GPGPU Algorithm for c-Approximate r-Nearest Neighbor Search in High Dimensions. IPDPS Workshops (2013)
Fred S. Annexstein, Kenneth A. Berman
Synthesis ranking with critic resonance. WebSci (2012)
Fred S. Annexstein, Svetlana Strunjas
Collaborative partitioning with maximum user satisfaction. CIKM (2008)
Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. ALENEX (2007)
Michael T. Helmick, Fred S. Annexstein
Depth-Latency Tradeoffs in Multicast Tree Algorithms. AINA (2007)
Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. PerCom Workshops (2006)
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)
Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic
Broadcasting in unstructured peer-to-peer overlay networks. Theor. Comput. Sci. 355 (1) (2006)
Fred S. Annexstein, Kenneth A. Berman
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. P2PKM (2004)
Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman
The lonely NATed node. ACM SIGOPS European Workshop (2004)
Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko
Indexing techniques for file sharing in scalable peer-to-peer networks. ICCCN (2002)
Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic
Latency effects on reachability in large-scale peer-to-peer networks. SPAA (2001)
Fred S. Annexstein, Kenneth A. Berman
-Numberings. SIAM J. Discret. Math. 13 (2) (2000)
Fred S. Annexstein, Kenneth A. Berman
Distributed Models and Algorithms for Survivability in Network Routing. IPDPS (2000)
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) (2000)
Fred S. Annexstein, Ramjee P. Swaminathan
On Testing Consecutive-ones Property in Parallel. Discret. Appl. Math. 88 (1-3) (1998)
Fred S. Annexstein
Generating De Bruijn Sequences: An Efficient Implementation. IEEE Trans. Computers 46 (2) (1997)
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON (1997)
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO (1997)
Fred S. Annexstein, Chris Giannella
An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. SIROCCO (1997)
Fred S. Annexstein, Eugene A. Kuchko
A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. WADS (1995)
Fred S. Annexstein, Ramjee P. Swaminathan
On Testing Consecutive-Ones Property in Parallel. SPAA (1995)
Fred S. Annexstein, John V. Franco
Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. Discret. Appl. Math. 60 (1-3) (1995)
John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. 54 (3) (1995)
Fred S. Annexstein
Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays. J. Parallel Distributed Comput. 23 (1) (1994)
Fred S. Annexstein
Ranking algorithms for Hamiltonian paths in hypercubic networks. Interconnection Networks and Mapping and Scheduling Parallel Computations (1994)
Fred S. Annexstein, Marc Baumslag
On the Diameter and Bisector Size of Cayley Graphs. Math. Syst. Theory 26 (3) (1993)
Fred S. Annexstein
Parallel Implementations of Graph Embeddings. Heinz Nixdorf Symposium (1992)
Fred S. Annexstein
SIMD-emulations of hypercubes and related networks. SPDP (1991)
Marc Baumslag, Fred S. Annexstein
A Unified Framework for Off-Line Permutation Routing in Parallel Networks. Math. Syst. Theory 24 (4) (1991)
Fred S. Annexstein
Fault tolerance in hypercube-derivative networks (preliminary version). SIGARCH Comput. Archit. News 19 (1) (1991)
Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg
Group Action Graphs and Parallel Architectures. SIAM J. Comput. 19 (3) (1990)
Fred S. Annexstein, Marc Baumslag
A Unified Approach to Off-Line Permutation Routing on Parallel Networks. SPAA (1990)
Fred S. Annexstein
Fault Tolerance in Hypercube-Derivative Networks. SPAA (1989)