Recent Publications

Please contact me via email at if you would like a copy of any papers listed below.

Peer-to-Peer Computing

  1. F.S. Annexstein and K.A. Berman and M. Jovanovic: Broadcasting in Unstructured Peer-to-Peer Overlay Networks,  Theoretical Computer Science, Special Issue on Complex Networks, April 2006, PDF

2.      F.S. Annexstein and K.A. Berman and M. Jovanovic: Latency Effects on Reachability in Large-scale Peer-to-Peer Networks . Appears in Proceedings SPAA 2001, Thirteenth ACM Symposium on Parallel Algorithms and Architectures - Postscript version and  Powerpoint Presentation

3.      F.S. Annexstein and K.A. Berman, M. Jovanovic, and Kovendhan Ponnavaikko: Indexing Techniques for File Sharing in Scalable Peer-to-Peer Networks. Appears in Proceedings IEEE ICCCN 2002, The 11th International Conference on Computer Communications and Networks - PDF version

4.      M. Jovanović, F. Annexstein, and K. Berman: Modeling peer-to-peer network topologies through “small-world” models and power laws, IX Telecommunications Forum TELFOR 2001, Belgrade. Postscript version

5.      M. Jovanović, F. Annexstein, and K. Berman: Scalability Issues in Large Peer-to-peer networks: A case study of Gnutella,  Postscript version


Network and Combinatorial Algorithms


  1. F. Annexstein, K. Berman, S. Strunjus, C. Yoshikawa:  Maximizing Throughput in Minimum Rounds in an Application­ Level Relay Service, Workshop on Algorithm Engineering and Experiments (ALENEX07)

2.      K. Berman, F. Annexstein, and A. Ranganathan: Dominating Connectivity and Reliability of Heterogeneous Sensor Networks,  Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06), 2006,  pp. 91-95. PDF, PPT slides

3.      F.S. Annexstein and K.A. Berman: Directional routing via generalized st-numberings. SIAM J DISCRETE MATH 13: (2) 268-279 APR 7 2000 PDF

4.      F.S. Annexstein and R.P. Swaminathan: On testing consecutive-ones property in parallel. Discrete Applied Mathematics 88: (1-3) pp. 7-28 NOV 9 1998. Second Special Issue on Computational Molecular Biology, guest-edited by S. Istrail, P. Pevzner and R. Shamir; a preliminary version appears in Proceedings of 7th ACM Symposium on Parallel Architectures and Algorithms. PDF

5.      F.S. Annexstein, Ken Berman, Tsan-sheng Hsu, and Ram Swaminathan: A multi-tree generating routing scheme using acyclic orientations. Theoretical Computer Science, 240: (2) 487-494 JUN 17 2000. See also, Computing and combinatorics : third annual international conference, COCOON '97, Shanghai, China, 1997. Tao Jiang, D.T. Lee, (eds.) Lecture notes in computer science 1276, pp. 18-22.

  1. F.S. Annexstein, Ken Berman, and Ram Swaminathan: Approximation algorithms for optimal depth independent trees and $st$-numberings. International Colloquium on Structural Information and Communication Complexity (SIROCCO '97), Carleton University Press, pp. 12--23.
  2. F.S.Annexstein, K.A. Berman, “Distributed Models and Algorithms for Survivability in Network Routing, IPDPS May 2000, Mexico. PDF
  3. F.S. Annexstein and C. Giannella: An empirical study of "lazy" protocols for routing information in dynamic networks. International Colloquium on Structural Information and Communication Complexity (SIROCCO '97), Carleton University Press, pp. 176--187.
  4. F.S. Annexstein: Generating debruijn sequences: an efficient implementation. IEEE Transactions on Computers, vol. 46, no. 2, February 1997, pp. 198-200.  PDF Supplement: C-code implementation
  5. F.S. Annexstein and E.A. Kuchko: A ranking algorithm for hamilton paths in shuffle-exchange networks. Lecture Notes in Computer Science 955, Springer Verlag, 1995, pp. 263--269.
  6. F.S. Annexstein: Ranking algorithms for hamiltonian paths in hypercubic networks, American Mathematical Society DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 21, 1995, pp. 1--7
  7. F.S. Annexstein and J.V. Franco: Work-preserving emulations of shuffle-exchange networks by linear arrays: An analysis of the complex plane diagram, Discrete Applied Mathematics (60), 1-3, 1995, pp. 13-23. Abstract or download the paper in PDF format.
  8. J.S. Schlipf, F.S. Annexstein, J. Franco, and R.P. Swaminathan: On finding solutions for extended horn formulas, Information Processing Letters (54), 1995, pp. 133-137.
  9. F.S. Annexstein: Embedding hypercubes and related networks into mesh-connected processor arrays, Journal of Parallel and Distributed Computing 23 (1), 1994, pp. 72--79.
  10. F.S. Annexstein: SIMD Emulations of hypercubes and related networks Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991. PDF
  11. F.S. Annexstein: Parallel implementations of graph embeddings, in Parallel Architectures and Their Efficient Use, Lecture Notes in Computer Science 678, Springer Verlag, 1993, pp. 207-217.
  12. F.S. Annexstein and M. Baumslag: On the diameter and bisector size of cayley graphs, Mathematical Systems Theory 26, 1993, pp. 271-291.


Information Networks and Information Organization


  1. Svetlana Strunjaš-Yoshikawa, Fred Annexstein, and Kenneth Berman: Compact Encodings for All Local Path Information in Web Taxonomies with Application to WordNet, 32nd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM06, 2006, Czech Republic, Powerpoint,  PDF
  2. F.S. Annexstein, K.A. Berman, K. Henkener, and S. Strunjus: A Space-Efficient Model for Sharing Personal Knowledge in Peer Communities, First International Workshop on Peer-to-Peer Knowledge Management (P2PKM), August 2004.
  3. K.A. Berman and F.S. Annexstein: An Educational Tool for the 21st Century: Peer-to-peer computing, Ohio Learning Network Conference, Windows on the Future Conference, Powerpoint Presentation , PDF version
  4. K.A. Berman and F.S. Annexstein:  BookQuest: A Model for Sharing Personal Knowledge and Information Organizational Objects in a Peer Community, Technical Report 2003, PDF

5.      K.A. Berman and F.S. Annexstein: Actualizing Context for Personal Knowledge Management, Technical Report 2002.