This is not meant to be a comprehensive listing of published
papers. For that, see this other
listing. Here, there is an attempt at a reasonable organization,
with some duplication between topics and references to technical
reports as appropriate.
-
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 ]
-
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 ]
-
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, Michael Walfish, and David G. Andersen.
A pragmatic approach to DHT adoption.
Technical report, CS Department, Boston University, December 2003.
[ .ps.Z |
.ps |
.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 ]
-
Jeffrey Considine and Thomas Florio.
Scalable peer-to-peer indexing with constant state.
Technical report, CS Department, Boston University, September 2002.
[ .ps.Z |
.ps |
.pdf ]
-
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 ]
-
Jeffrey Considine.
Deciding isomorphisms of simple types in polynomial time.
Technical report, CS Department, Boston University, April 2000.
[ .ps.Z |
.ps |
.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 ]
-
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 ]
-
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 ]
-
Boulat A. Bash, John Byers, and Jeffrey Considine.
Approximately uniform random sampling in sensor networks.
In Proceedings of DMSN 2004, August 2004.
[ .pdf ]
-
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 ]
-
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 ]