| 2008 | CIKM | Collaborative partitioning with maximum user satisfaction. | Fred S. Annexstein, Svetlana Strunjas |
| 2007 | AINA | Depth-Latency Tradeoffs in Multicast Tree Algorithms. | Michael T. Helmick, Fred S. Annexstein |
| 2007 | ALENEX | Maximizing Throughput in Minimum Rounds in an Application-Level Relay Service. | Fred S. Annexstein, Kenneth A. Berman, Svetlana Strunjas-Yoshikawa, Chad Yoshikawa |
| 2006 | PERCOM | Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. | Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan |
| 2006 | SOFSEM | Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet. | Svetlana Strunjas-Yoshikawa, Fred S. Annexstein, Kenneth A. Berman |
| 2002 | ICCCN | Indexing techniques for file sharing in scalable peer-to-peer networks. | Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic, Kovendhan Ponnavaikko |
| 2001 | SPAA | Latency effects on reachability in large-scale peer-to-peer networks. | Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic |
| 1997 | COCOON | A Multi-Tree Generating Routing Scheme Using Acyclic Orientations. | Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan |
| 1997 | SIROCCO | On Computing Nearly Optimal Multi-Tree Paths and s, t-Numberings. | Fred S. Annexstein, Kenneth A. Berman, Ramjee P. Swaminathan |
| 1997 | SIROCCO | An Empirical Study of "Lazy" Protocols for Routing Information in Dynamic Networks. | Fred S. Annexstein, Chris Giannella |
| 1995 | SPAA | On Testing Consecutive-Ones Property in Parallel. | Fred S. Annexstein, Ramjee P. Swaminathan |
| 1995 | WADS | A Ranking Algorithm for Hamilton Paths in Shuffle-Exchange Graphs. | Fred S. Annexstein, Eugene A. Kuchko |
| 1990 | SPAA | A Unified Approach to Off-Line Permutation Routing on Parallel Networks. | Fred S. Annexstein, Marc Baumslag |
| 1989 | SPAA | Fault Tolerance in Hypercube-Derivative Networks. | Fred S. Annexstein |