Jeffrey Considine - Papers by Year

This is meant to be a comprehensive listing of published papers. Unpublished work such as technical reports is omitted. For a semi-organized listing by topic, see here.

2005

• J. Considine, M. Fitzi, L. Levin, U. Maurer, and D. Metcalf. Byzantine agreement given partial broadcast. Journal of Cryptology, 18(3), July 2005.
  

• G. Kollios, J. Byers, J. Considine, M. Hadjieleftheriou, and F. Li. Robust aggregation in sensor networks. IEEE Data Engineering Bulletin, 28(1), March 2005.
  [ .ps ]

2004

• John Byers, Jeffrey Considine, Michael Mitzenmacher, and Stanislav Rost. Informed content delivery across adaptive overlay networks. ACM/IEEE Transactions on Networking, 12(5), October 2004. An earlier version appeared in Proceedings of the ACM SIGCOMM 2002 Conference.
  [ .ps ]

• Boulat A. Bash, John Byers, and Jeffrey Considine. Approximately uniform random sampling in sensor networks. In Proceedings of DMSN 2004, August 2004.
  [ .pdf ]

• John Byers, Jeffrey Considine, and Michael Mitzenmacher. Geometric generalizations of the power of two choices. In Proceedings of the 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 2004.
  [ .ps ]

• Jeffrey Considine, Feifei Li, George Kollios, and John Byers. Approximate aggregation techniques for sensor databases. In Proceedings of the International Conference on Data Engineering (ICDE04), March 2004. Winner of the Best Paper Award.
  [ .pdf ]

• Yufei Tao, George Kollios, Jeffrey Considine, Feifei Li, and Dimitris Papadias. Spatio-temporal aggregation using sketches. In Proceedings of the International Conference on Data Engineering (ICDE04), March 2004.
  [ .pdf ]

• John Byers, Mei Chin Cheng, Jeffrey Considine, Gene Itkis, and Alex Yeung. Securing bulk content almost for free. To appear in Computer Communications, Special Issue on Network Security, 2004.
  [ .ps ]

2003

• Jeffrey Considine, John W. Byers, and Ketan Mayer-Patel. A case for testbed embedding services. In Proceedings of HotNets-II, November 2003.
  [ .pdf ]

• John Byers, Jeffrey Considine, and Michael Mitzenmacher. Simple load balancing for distributed hash tables. In Proceedings of the Second International Workshop on Peer-to-Peer Systems (IPTPS 2003), February 2003.
  [ .ps ]

• Yoav Zibin, Yossi Gil, and Jeffrey Considine. Efficient algorithms for isomorphisms of simple types. In Proceedings of the 30th ACM Symposium on Principles of Programming Languages (POPL 2003), January 2003.
  [ http | .pdf ]

2002

• John Byers, Jeffrey Considine, Michael Mitzenmacher, and Stanislav Rost. Informed content delivery across adaptive overlay networks. In Proceedings of ACM SIGCOMM 2002, August 2002.
  [ http | .pdf ]

2000

• Allyn Dimock, Ian Westmacott, Robert Muller, Franklyn Turbak, J. B. Wells, and Jeffrey Considine. Program representation size in an intermediate language with intersection and union types. In Proceedings of the Third Workshop on Types in Compilation (TIC 2000), volume 2071 of LNCS, pages 27-52. Springer-Verlag, 2000.
  [ .html ]