| 2009 | COCOON | Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. | Kenneth A. Berman, Chad Yoshikawa |
| 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 | CEC | Discovering Adaptive Heuristics for Ad-Hoc Sensor Networks by Mining Evolved Optimal Configurations. | Prasanna Ranganathan, Aravind Ranganathan, Kenneth A. Berman, Ali A. Minai |
| 2006 | PERCOM | Dominating Connectivity and Reliability of Heterogeneous Sensor Networks. | Kenneth A. Berman, Fred S. Annexstein, Aravind Ranganathan |
| 2006 | SIGCSE | A template library to facilitate teaching message passing parallel computing. | Jerome L. Paul, Michal Kouril, Kenneth A. Berman |
| 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 |
| 1995 | LPNMR | Computing Well-founded Semantics Faster. | Kenneth A. Berman, John S. Schlipf, John V. Franco |