Fred S. Annexstein - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2013

A GPGPU Algorithm for c-Approximate r-Nearest Neighbor Search in High DimensionsLee Carraher, Philip A. Wilsey, Fred S. Annexstein. ipps 2013: 2079-2088 [doi]

2012

Synthesis ranking with critic resonanceFred S. Annexstein, Kenneth A. Berman. WebSci 2012: 15-23 [doi]

2008

Collaborative partitioning with maximum user satisfactionFred S. Annexstein, Svetlana Strunjas. CIKM 2008: 1445-1446 [doi]

2007

Maximizing Throughput in Minimum Rounds in an Application-Level Relay ServiceFred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa. alenex 2007: [doi]

Depth-Latency Tradeoffs in Multicast Tree AlgorithmsMichael T. Helmick, Fred S. Annexstein. aina 2007: 555-564 [doi]

2006

Broadcasting in unstructured peer-to-peer overlay networksFred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic. TCS, 355(1):25-36, 2006. [doi]

Dominating Connectivity and Reliability of Heterogeneous Sensor NetworksKenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan. percom 2006: 91-95 [doi]

Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNetSvetlana Strunjas-Yoshikawa, Fred S. Annexstein, Kenneth A. Berman. sofsem 2006: 511-520 [doi]

2004

A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer CommunitiesFred S. Annexstein, Kenneth A. Berman. p2pkm 2004: [doi]

The lonely NATed nodeChad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman. sigopsE 2004: 36 [doi]

2002

Indexing techniques for file sharing in scalable peer-to-peer networksFred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko. icccn 2002: 10-15 [doi]

2001

Latency effects on reachability in large-scale peer-to-peer networksFred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic. spaa 2001: 84-92 [doi]

2000

Distributed Models and Algorithms for Survivability in Network RoutingFred S. Annexstein, Kenneth A. Berman. ipps 2000: 359-364 [doi]

Directional Routing via Generalized ::::st::::-NumberingsFred S. Annexstein, Kenneth A. Berman. siamdm, 13(2):268-279, 2000. [doi]

A multi-tree routing scheme using acyclic orientationsFred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan. TCS, 240(2):487-494, 2000. [doi]

1998

On Testing Consecutive-ones Property in ParallelFred S. Annexstein, Ramjee P. Swaminathan. DAM, 88(1-3):7-28, 1998. [doi]

1997

On Computing Nearly Optimal Multi-Tree Paths and s, t-NumberingsFred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan. sirocco 1997: 12-23

An Empirical Study of Lazy Protocols for Routing Information in Dynamic NetworksFred S. Annexstein, Chris Giannella. sirocco 1997: 176-187

A Multi-Tree Generating Routing Scheme Using Acyclic OrientationsFred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan. cocoon 1997: 18-22

Generating De Bruijn Sequences: An Efficient ImplementationFred S. Annexstein. TC, 46(2):198-200, 1997.

1995

1994

Embedding Hypercubes and Related Networks into Mesh-Connected Processor ArraysFred S. Annexstein. jpdc, 23(1):72-79, 1994.

Ranking algorithms for Hamiltonian paths in hypercubic networksFred S. Annexstein. dimacs 1995: 1-8

1993

On the Diameter and Bisector Size of Cayley GraphsFred S. Annexstein, Marc Baumslag. mst, 26(3):271-291, 1993.

On the Diameter and Bisector Size of Cayley GraphsFred S. Annexstein, Marc Baumslag. mst, 26(3):271-291, 1993.

1992

Parallel Implementations of Graph EmbeddingsFred S. Annexstein. nixdorf 1993: 207-217

1991

SIMD-emulations of hypercubes and related networksFred S. Annexstein. spdp 1991: 656-659 [doi]

Fault tolerance in hypercube-derivative networks (preliminary version)Fred S. Annexstein. sigarch, 19(1):25-34, 1991. [doi]

A Unified Framework for Off-Line Permutation Routing in Parallel NetworksMarc Baumslag, Fred S. Annexstein. mst, 24(4):233-251, 1991.

1990

Group Action Graphs and Parallel ArchitecturesFred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg. SICOMP, 19(3):544-569, 1990.

A Unified Approach to Off-Line Permutation Routing on Parallel NetworksFred S. Annexstein, Marc Baumslag. spaa 1990: 398-406 [doi]

1989

Fault Tolerance in Hypercube-Derivative NetworksFred S. Annexstein. spaa 1989: 179-188 [doi]

Sign in or sign up to see more results.

runs on WebDSL