default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFred S. Annexstein
Person information
- affiliation: University of Cincinnati, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2006
[j12]Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic:
Broadcasting in unstructured peer-to-peer overlay networks. Theor. Comput. Sci. 355(1): 25-36 (2006)- 2000
- [j11]Fred S. Annexstein, Kenneth A. Berman:
Directional Routing via Generalized st-Numberings. SIAM J. Discret. Math. 13(2): 268-279 (2000) - [j10]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): 487-494 (2000) - 1998
- [j9]Fred S. Annexstein, Ramjee P. Swaminathan:
On Testing Consecutive-ones Property in Parallel. Discret. Appl. Math. 88(1-3): 7-28 (1998) - 1997
- [j8]Fred S. Annexstein:
Generating De Bruijn Sequences: An Efficient Implementation. IEEE Trans. Computers 46(2): 198-200 (1997) - 1995
- [j7]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): 13-23 (1995) - [j6]John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan:
On Finding Solutions for Extended Horn Formulas. Inf. Process. Lett. 54(3): 133-137 (1995) - 1994
- [j5]Fred S. Annexstein:
Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays. J. Parallel Distributed Comput. 23(1): 72-79 (1994) - 1993
- [j4]Fred S. Annexstein, Marc Baumslag:
On the Diameter and Bisector Size of Cayley Graphs. Math. Syst. Theory 26(3): 271-291 (1993) - 1991
- [j3]Marc Baumslag, Fred S. Annexstein:
A Unified Framework for Off-Line Permutation Routing in Parallel Networks. Math. Syst. Theory 24(4): 233-251 (1991) - [j2]Fred S. Annexstein:
Fault tolerance in hypercube-derivative networks (preliminary version). SIGARCH Comput. Archit. News 19(1): 25-34 (1991) - 1990
- [j1]Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg:
Group Action Graphs and Parallel Architectures. SIAM J. Comput. 19(3): 544-569 (1990)
Conference and Workshop Papers
- 2013
- [c22]Lee Carraher, Philip A. Wilsey, Fred S. Annexstein:
A GPGPU Algorithm for c-Approximate r-Nearest Neighbor Search in High Dimensions. IPDPS Workshops 2013: 2079-2088 - 2012
- [c21]Fred S. Annexstein, Kenneth A. Berman:
Synthesis ranking with critic resonance. WebSci 2012: 15-23 - 2008
- [c20]Fred S. Annexstein, Svetlana Strunjas:
Collaborative partitioning with maximum user satisfaction. CIKM 2008: 1445-1446 - 2007
- [c19]Michael T. Helmick, Fred S. Annexstein:
Depth-Latency Tradeoffs in Multicast Tree Algorithms. AINA 2007: 555-564 - [c18]Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa:
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. ALENEX 2007 - 2006
- [c17]Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan:
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. PerCom Workshops 2006: 91-95 - [c16]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: 511-520 - 2004
- [c15]Fred S. Annexstein, Kenneth A. Berman:
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. P2PKM 2004 - [c14]Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman:
The lonely NATed node. ACM SIGOPS European Workshop 2004: 36 - 2002
- [c13]Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko:
Indexing techniques for file sharing in scalable peer-to-peer networks. ICCCN 2002: 10-15 - 2001
- [c12]Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic:
Latency effects on reachability in large-scale peer-to-peer networks. SPAA 2001: 84-92 - 2000
- [c11]Fred S. Annexstein, Kenneth A. Berman:
Distributed Models and Algorithms for Survivability in Network Routing. IPDPS 2000: 359-364 - 1997
- [c10]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan:
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. COCOON 1997: 18-22 - [c9]Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan:
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. SIROCCO 1997: 12-23 - [c8]Fred S. Annexstein, Chris Giannella:
An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. SIROCCO 1997: 176-187 - 1995
- [c7]Fred S. Annexstein, Ramjee P. Swaminathan:
On Testing Consecutive-Ones Property in Parallel. SPAA 1995: 234-243 - [c6]Fred S. Annexstein, Eugene A. Kuchko:
A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. WADS 1995: 263-269 - 1994
- [c5]Fred S. Annexstein:
Ranking algorithms for Hamiltonian paths in hypercubic networks. Interconnection Networks and Mapping and Scheduling Parallel Computations 1994: 1-7 - 1992
- [c4]Fred S. Annexstein:
Parallel Implementations of Graph Embeddings. Heinz Nixdorf Symposium 1992: 207-217 - 1991
- [c3]Fred S. Annexstein:
SIMD-emulations of hypercubes and related networks. SPDP 1991: 656-659 - 1990
- [c2]Fred S. Annexstein, Marc Baumslag:
A Unified Approach to Off-Line Permutation Routing on Parallel Networks. SPAA 1990: 398-406 - 1989
- [c1]Fred S. Annexstein:
Fault Tolerance in Hypercube-Derivative Networks. SPAA 1989: 179-188
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
