SCEAS

The SCEAS System

Search the dblp DataBase

Title:
Author:

Fred S. Annexstein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

Michael T. Helmick, Fred S. Annexstein
Depth-Latency Tradeoffs in Multicast Tree Algorithms. [Citation Graph (0, 0)][DBLP]
AINA, 2007, pp:555-564 [Conf]
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. [Citation Graph (0, 0)][DBLP]
COCOON, 1997, pp:18-22 [Conf]
Fred S. Annexstein, Kenneth A. Berman
Distributed Models and Algorithms for Survivability in Network Routing. [Citation Graph (0, 0)][DBLP]
IPDPS, 2000, pp:359-364 [Conf]
Fred S. Annexstein
Parallel Implementations of Graph Embeddings. [Citation Graph (0, 0)][DBLP]
Heinz Nixdorf Symposium, 1992, pp:207-217 [Conf]
Fred S. Annexstein, Kenneth A. Berman
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. [Citation Graph (0, 0)][DBLP]
P2PKM, 2004, pp:- [Conf]
Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. [Citation Graph (0, 0)][DBLP]
PerCom Workshops, 2006, pp:91-95 [Conf]
Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1997, pp:12-23 [Conf]
Fred S. Annexstein, Chris Giannella
An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
SIROCCO, 1997, pp:176-187 [Conf]
Svetlana Strunjas-Yoshikawa, Fred S. Annexstein, Kenneth A. Berman
Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet. [Citation Graph (0, 0)][DBLP]
SOFSEM, 2006, pp:511-520 [Conf]
Fred S. Annexstein
Fault Tolerance in Hypercube-Derivative Networks. [Citation Graph (0, 0)][DBLP]
SPAA, 1989, pp:179-188 [Conf]
Fred S. Annexstein, Marc Baumslag
A Unified Approach to Off-Line Permutation Routing on Parallel Networks. [Citation Graph (0, 0)][DBLP]
SPAA, 1990, pp:398-406 [Conf]
Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic
Latency effects on reachability in large-scale peer-to-peer networks. [Citation Graph (0, 0)][DBLP]
SPAA, 2001, pp:84-92 [Conf]
Fred S. Annexstein, Ramjee P. Swaminathan
On Testing Consecutive-Ones Property in Parallel. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:234-243 [Conf]
Fred S. Annexstein, Eugene A. Kuchko
A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. [Citation Graph (0, 0)][DBLP]
WADS, 1995, pp:263-269 [Conf]
Fred S. Annexstein, John V. Franco
Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:13-23 [Journal]
Fred S. Annexstein, Ramjee P. Swaminathan
On Testing Consecutive-ones Property in Parallel. [Citation Graph (0, 0)][DBLP]
Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:7-28 [Journal]
John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan
On Finding Solutions for Extended Horn Formulas. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1995, v:54, n:3, pp:133-137 [Journal]
Fred S. Annexstein
Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1994, v:23, n:1, pp:72-79 [Journal]
Fred S. Annexstein, Marc Baumslag
On the Diameter and Bisector Size of Cayley Graphs. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1993, v:26, n:3, pp:271-291 [Journal]
Fred S. Annexstein, Marc Baumslag
On the Diameter and Bisector Size of Cayley Graphs. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1993, v:26, n:3, pp:271-291 [Journal]
Marc Baumslag, Fred S. Annexstein
A Unified Framework for Off-Line Permutation Routing in Parallel Networks. [Citation Graph (0, 0)][DBLP]
Mathematical Systems Theory, 1991, v:24, n:4, pp:233-251 [Journal]
Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg
Group Action Graphs and Parallel Architectures. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1990, v:19, n:3, pp:544-569 [Journal]
Fred S. Annexstein, Kenneth A. Berman
Directional Routing via Generalized st-Numberings. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2000, v:13, n:2, pp:268-279 [Journal]
Fred S. Annexstein
Generating De Bruijn Sequences: An Efficient Implementation. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1997, v:46, n:2, pp:198-200 [Journal]
Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan
A multi-tree routing scheme using acyclic orientations. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2000, v:240, n:2, pp:487-494 [Journal]
Fred S. Annexstein, Kenneth A. Berman, Mijhalo A. Jovanovic
Broadcasting in unstructured peer-to-peer overlay networks. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:355, n:1, pp:25-36 [Journal]
Fred S. Annexstein, Ken Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. [Citation Graph (0, 0)][DBLP]
ALENEX, 2007, pp:- [Conf]
Collaborative partitioning with maximum user satisfaction. [Citation Graph (, )][DBLP]
The lonely NATed node. [Citation Graph (, )][DBLP]
SIMD-emulations of hypercubes and related networks. [Citation Graph (, )][DBLP]

Search in 0.005secs, Finished in 0.006secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP