Recent

• Rajesh Krishnan and David Starobinski, ``Message-Efficient Self-Organization of Wireless Sensor Networks,''
  to appear in IEEE WCNC 2003. pdf
• David Starobinski, Mark Karpovsky, and Lev Zakrevski, ``Application of Network Calculus to General Topologies using Turn-Prohibition,'' to appear in IEEE/ACM Transactions on Networking. pdf
• Saikat Ray, Jeffrey Carruthers, and David Starobinski, ``RTS/CTS-induced Congestion in Ad-Hoc Wireless LANs,'' to appear in IEEE WCNC 2003. pdf
• Ray S., Ugrangsi R., De Pellegrini F., Trachtenberg A., Starobinski D., "Robust Location Detection for Emergency Sensor Networks", to appear in the proceedings of IEEE INFOCOM 2003, San Francisco, CA. pdf(241k)

2002

• Y. Minsky and A. Trachtenberg, Practical set reconciliation, Technical Report 2002-01, Boston University. Also appeared as Scalable set reconciliation at the 40th Annual Allerton Conference on Communication, Control, and Computing, October 2002.
• Ari Trachtenberg, David Starobinski, and Sachin Agarwal, ``Fast PDA
  Synchronization using Characteristic Polynomial Interpolation,'' Proceedings of IEEE INFOCOM 2002, pp.1510-1519, June 2002. Available in postscript(5.7M) or pdf(372k)
• Sachin Agarwal, David Starobinski and Ari Trachtenberg, ``On the Scalability of Data Synchronization Protocols for PDAs and Mobile Devices,", IEEE Network (Special Issue on Scalability in Communication Networks), Vol. 16, No. 4, pp. 22-28, July-August 2002. pdf (973k)
• David Starobinski, Mark Karpovsky, and Lev Zakrevski, ``Application of
  Network Calculus to General Topologies using Turn-Prohibition,'' Proceedings of IEEE INFOCOM 2002, pp.1151-1159, June 2002. pdf(113k)
• A. Trachtenberg, Designing Lexicographic Codes with a Given Trellis Complexity, IEEE Transactions on Information Theory (January 2002)
• S. Agarwal, Data Synchronization in Mobile and Distributed Networks, Master's Thesis, Boston University, July 2002. pdf  

2001

• David Starobinski and David Tse, ``Probabilistic Methods for Web Caching'', Performance Evaluation , Vol 46, Nos. 2-3,  pp. 125-137,
  October 2001. pdf
• M. Karpovsky, L. Levitin, and A. Trachtenberg, Data verification and reconciliation with generalized error-control codes,39th Annual Allerton Conference on Communication, Control, and Computing, Monticello IL, Oct 3-5, 2001. Available in postscript (103K) or pdf (109K)
• Y. Minsky, A. Trachtenberg, and R. Zippel, Set Reconciliation with Nearly Optimal Communication Complexity, International Symposium on Information Theory, Washington D.C., June 2001. Available in postscript(86k) or pdf(117k).
• M. Karpovsky, L. Levitin, and A. Trachtenberg, Connections between data reconciliation and error-correcting codes, International Symposium on Information Theory, Washington D.C., June 2001, recent result. Abstract available in postscript (46k) or pdf. (55k).
• David Starobinski and Mark Karpovsky, ``Turn Prohibition-based Packet Forwarding in Gigabit Ethernets,''
  Gigabit Networking Workshop (GBN 2001), Anchorage, Alaska, April  2001.
• A. Trachtenberg and D. Starobinski, Towards Global Synchronization, Workshop on New Visions for Large-Scale Networks: Research and Applications, Vienna, VA, March 2001. Available in pdf.

2000

• David Starobinski and Moshe Sidi, ``Modeling and Analysis of Power-Tail Distributions via Classical Teletraffic Methods,'' Queueing Systems (QUESTA), Vol. 36, Nos. 1-3, pp. 243-267, November 2000. Gzipped PostScript
• T. Etzion, A. Trachtenberg, and A. Vardy, Which Codes have Cycle-Free Tanner Graphs? IEEE Trans. Inf. Theory, 45:6.
  Available in postscript (496K) or pdf (378k)
• David Starobinski and David Tse, ``Probabilistic Models for Web Caching,''
  Conference and Workshop on Stochastic Networks, Madison, Wisconsin, June 2000.
• David Starobinski and Moshe Sidi, ``Stochastically Bounded Burstiness for Communication Networks,''
  IEEE Transactions on Information Theory, Vol. 46, No. 1, pp.206-212, January 2000. Gzipped PostScript
• Y. Minsky, A. Trachtenberg, and R. Zippel, Efficient reconciliation of unordered databases, Technical Report 2000-1796, Cornell University.
  Available in postscript (296k) or pdf(260k).
• Ari Trachtenberg, Error-Correcting Codes on Graphs: Lexicodes, Trellises, and Factor Graphs, Ph.D. thesis from the University of Illinois at Urbana-Champaign, Department of Computer Science. Available in html, postscript (1.2M) or pdf (1M).

1999

• David Starobinski and Moshe Sidi, ``Modeling and Analysis of Heavy-Tailed Distributions via Classical Teletraffic Methods,''
  Proceedings of ITC-16, pp. 45-54, June 1999.
  A PostScript version is available upon request.
• David Starobinski, Ph.D. Thesis
  Quality of Service in High Speed Networks with Multiple Time-Scale Traffic,
  Technion - Israel Institute of Technology, May 1999.
  Gzipped PostScript
• David Starobinski and Moshe Sidi, ``Stochastically Bounded Burstiness for Communication Networks,''
  Proceedings of INFOCOM '99, pp.36-42, March 1999.
  Gzipped PostScript
• A. Trachtenberg and Y. Minsky, Efficient reconciliation of unordered databases, Technical Report 99-1778, Cornell University.
  Available in postscript (431k) or pdf(272k).

Earlier

• Moshe Sidi and David Starobinski, ``New Call Blocking versus Handoff Blocking in Cellular Networks,''
  ACM Journal of Wireless Networks, Vol. 3, No. 1, pp. 15-27, March 1997 (forwarded for fast-track publication by the Program Chair of Infocom '96). Gzipped PostScript
• A. Trachtenberg and A. Vardy, Lexicographic Codes; Constructions, Bounds, and Trellis Complexities, CISS '97.
  Available in postscript(337K) or pdf (225k).
• Moshe Sidi and David Starobinski, ``New Call Blocking versus Handoff Blocking in Cellular Networks '',
  Proceedings of INFOCOM '96, pp. 35-42, March 1996.
  Gzipped PostScript
• A. Trachtenberg, Computational Methods in Coding Theory, M.Sc. thesis, available in postscript (1M) or pdf (1M).
• David Starobinski, M.Sc. Thesis
  New Call Blocking versus Handoff Blocking in Cellular Networks,
  Technion - Israel Institute of Technology, December 1995.
  Gzipped PostScript