Fred S. Annexstein

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