| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Fred S. Annexstein, Svetlana Strunjas |
Collaborative partitioning with maximum user satisfaction.  |
CIKM  |
2008 |
DBLP DOI BibTeX RDF |
collaborative filtering |
| 1 | Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa |
Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. |
ALENEX |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael T. Helmick, Fred S. Annexstein |
Depth-Latency Tradeoffs in Multicast Tree Algorithms. |
AINA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic |
Broadcasting in unstructured peer-to-peer overlay networks. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan |
Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. |
PerCom Workshops |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Chad Yoshikawa, Brent N. Chun, Amin Vahdat, Fred S. Annexstein, Kenneth A. Berman |
The lonely NATed node. |
ACM SIGOPS European Workshop |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Kenneth A. Berman |
A Space-Efficient Model for Sharing Personal Knowledge Objects in Peer Communities. |
P2PKM |
2004 |
DBLP BibTeX RDF |
|
| 1 | Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic |
Latency effects on reachability in large-scale peer-to-peer networks. |
SPAA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Kenneth A. Berman, Tsan-sheng Hsu, Ramjee P. Swaminathan |
A multi-tree routing scheme using acyclic orientations. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Kenneth A. Berman |
Directional Routing via Generalized st-Numberings. |
SIAM J. Discrete Math. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Kenneth A. Berman |
Distributed Models and Algorithms for Survivability in Network Routing. (PDF / PS) |
IPDPS |
2000 |
DBLP DOI BibTeX RDF |
algorithms for network routing, computational complexity, Graph connectivity, network survivability |
| 1 | Fred S. Annexstein, Ramjee P. Swaminathan |
On Testing Consecutive-ones Property in Parallel. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein |
Generating De Bruijn Sequences: An Efficient Implementation. |
IEEE Trans. Computers |
1997 |
DBLP DOI BibTeX RDF |
Shift register sequences, De Bruijn graphs, NESL programming language, computational complexity, recursive algorithms |
| 1 | Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan |
On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. |
SIROCCO |
1997 |
DBLP BibTeX RDF |
|
| 1 | Fred S. Annexstein, Chris Giannella |
An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. |
SIROCCO |
1997 |
DBLP BibTeX RDF |
|
| 1 | Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan |
A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. |
COCOON |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | John S. Schlipf, Fred S. Annexstein, John V. Franco, Ramjee P. Swaminathan |
On Finding Solutions for Extended Horn Formulas. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, John V. Franco |
Work-preserving Emulations of Shuffle-exchange Networks: An Analysis of the Complex Plane Diagram. |
Discrete Applied Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Eugene A. Kuchko |
A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. |
WADS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Ramjee P. Swaminathan |
On Testing Consecutive-Ones Property in Parallel. |
SPAA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein |
Embedding Hypercubes and Related Networks into Mesh-Connected Processor Arrays. |
J. Parallel Distrib. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Marc Baumslag |
On the Diameter and Bisector Size of Cayley Graphs. |
Mathematical Systems Theory |
1993 |
DBLP BibTeX RDF |
|
| 1 | Fred S. Annexstein, Marc Baumslag |
On the Diameter and Bisector Size of Cayley Graphs. |
Mathematical Systems Theory |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein |
Parallel Implementations of Graph Embeddings. |
Heinz Nixdorf Symposium |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Baumslag, Fred S. Annexstein |
A Unified Framework for Off-Line Permutation Routing in Parallel Networks. |
Mathematical Systems Theory |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein |
SIMD-emulations of hypercubes and related networks. |
SPDP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Marc Baumslag, Arnold L. Rosenberg |
Group Action Graphs and Parallel Architectures. |
SIAM J. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein, Marc Baumslag |
A Unified Approach to Off-Line Permutation Routing on Parallel Networks. |
SPAA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Fred S. Annexstein |
Fault Tolerance in Hypercube-Derivative Networks. |
SPAA |
1989 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")