| Approximate aggregation techniques for sensor databases J Considine, F Li, G Kollios, J Byers Proceedings. 20th International Conference on Data Engineering, 449-460, 2004 | 805 | 2004 |
| Simple load balancing for distributed hash tables J Byers, J Considine, M Mitzenmacher Peer-to-Peer Systems II, 80-87, 2003 | 447 | 2003 |
| Informed content delivery across adaptive overlay networks J Byers, J Considine, M Mitzenmacher, S Rost ACM SIGCOMM Computer Communication Review 32 (4), 47-60, 2002 | 405 | 2002 |
| Spatio-temporal aggregation using sketches Y Tao, G Kollios, J Considine, F Li, D Papadias Proceedings. 20th International Conference on Data Engineering, 214-225, 2004 | 240 | 2004 |
| Informed content delivery across adaptive overlay networks JW Byers, J Considine, M Mitzenmacher, S Rost IEEE/ACM transactions on networking 12 (5), 767-780, 2004 | 157 | 2004 |
| Geometric generalizations of the power of two choices JW Byers, J Considine, M Mitzenmacher Proceedings of the sixteenth annual ACM symposium on Parallelism in …, 2004 | 91 | 2004 |
| Approximately uniform random sampling in sensor networks BA Bash, JW Byers, J Considine Proceeedings of the 1st international workshop on Data management for sensor …, 2004 | 70 | 2004 |
| Byzantine agreement given partial broadcast J Considine, M Fitzi, M Franklin, LA Levin, U Maurer, D Metcalf Journal of Cryptology 18, 191-217, 2005 | 63 | 2005 |
| Robust approximate aggregation in sensor data management systems J Considine, M Hadjieleftheriou, F Li, J Byers, G Kollios ACM Transactions on Database Systems (TODS) 34 (1), 1-35, 2009 | 56 | 2009 |
| Fast approximate reconciliation of set differences J Byers, J Considine, M Mitzenmacher Boston University Computer Science Department, 2002 | 49 | 2002 |
| Robust Aggregation in Sensor Networks. G Kollios, JW Byers, J Considine, M Hadjieleftheriou, F Li IEEE Data Eng. Bull. 28 (1), 26-32, 2005 | 46 | 2005 |
| A constraint satisfaction approach to testbed embedding services J Considine, JW Byers, K Meyer-Patel ACM SIGCOMM Computer Communication Review 34 (1), 137-142, 2004 | 23 | 2004 |
| Efficient algorithms for isomorphisms of simple types Y Zibin, J Gil, J Considine ACM SIGPLAN Notices 38 (1), 160-171, 2003 | 21 | 2003 |
| Securing bulk content almost for free J Byers, J Considine, G Itkis, MC Cheng, A Yeung Computer communications 29 (3), 280-290, 2006 | 17 | 2006 |
| Cluster-based optimizations for distributed hash tables J Considine Boston University Computer Science Department, 2002 | 15 | 2002 |
| Generating Good Degree Distributions for Sparse Parity Check Codes Using Oracles J Considine | 15 | 2001 |
| Scalable peer-to-peer indexing with constant state J Considine, TA Florio Boston Univ., Boston, MA, Tech. Rep 26, 2002 | 13 | 2002 |
| Deciding isomorphisms of simple types in polynomial time J Considine Boston University Computer Science Department, 2000 | 9 | 2000 |
| Byzantine agreement with faulty majority using bounded broadcast J Considine, LA Levin, D Metcalf arXiv preprint cs/0012024, 2000 | 8* | 2000 |
| Program representation size in an intermediate language with intersection and union types A Dimock, I Westmacott, R Muller, F Turbak, JB Wells, J Considine International Workshop on Types in Compilation, 27-52, 2000 | 7 | 2000 |
John W. ByersProfessor of Computer Science, Boston UniversityVerified email at cs.bu.edu
