| Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis M Mitzenmacher, E Upfal Cambridge university press, 2017 | 3247 | 2017 |
| Network applications of bloom filters: A survey A Broder, M Mitzenmacher Internet mathematics 1 (4), 485-509, 2004 | 2022 | 2004 |
| A brief history of generative models for power law and lognormal distributions M Mitzenmacher Internet mathematics 1 (2), 226-251, 2004 | 1983 | 2004 |
| A digital fountain approach to reliable distribution of bulk data JW Byers, M Luby, M Mitzenmacher, A Rege ACM SIGCOMM Computer Communication Review 28 (4), 56-67, 1998 | 1772 | 1998 |
| Detecting novel associations in large data sets DN Reshef, YA Reshef, HK Finucane, SR Grossman, G McVean, ... science 334 (6062), 1518-1524, 2011 | 1708 | 2011 |
| Efficient erasure correcting codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on Information Theory 47 (2), 569-584, 2001 | 1287 | 2001 |
| Privacy preserving keyword searches on remote encrypted data YC Chang, M Mitzenmacher International Conference on Applied Cryptography and Network Security, 442-455, 2005 | 1275 | 2005 |
| The power of two choices in randomized load balancing M Mitzenmacher IEEE Transactions on Parallel and Distributed Systems 12 (10), 1094-1104, 2001 | 1267 | 2001 |
| Min-wise independent permutations AZ Broder, M Charikar, AM Frieze, M Mitzenmacher Journal of Computer and System Sciences 60 (3), 630-659, 2000 | 1263 | 2000 |
| Improved low-density parity-check codes using irregular graphs MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman IEEE Transactions on information Theory 47 (2), 585-598, 2001 | 1182 | 2001 |
| Practical loss-resilient codes MG Luby, M Mitzenmacher, MA Shokrollahi, DA Spielman, V Stemann Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997 | 1116 | 1997 |
| Compressed bloom filters M Mitzenmacher IEEE/ACM transactions on networking 10 (5), 604-612, 2002 | 906 | 2002 |
| A digital fountain approach to asynchronous reliable multicast JW Byers, M Luby, M Mitzenmacher IEEE journal on selected areas in communications 20 (8), 1528-1540, 2002 | 666 | 2002 |
| Network applications of bloom filters: A survey A Broder, M Mitzenmacher, ABIM Mitzenmacher Internet mathematics, 2002 | 590 | 2002 |
| Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads JW Byers, M Luby, M Mitzenmacher IEEE INFOCOM'99. Conference on Computer Communications. Proceedings …, 1999 | 453 | 1999 |
| Analysis of low density codes and improved designs using irregular graphs M Luby, M Mitzenmacher, A Shokrollah, D Spielman Proceedings of the thirtieth annual ACM symposium on Theory of computing …, 1998 | 452 | 1998 |
| Analysis of Random Processes via And-Or Tree Evaluation. M Luby, M Mitzenmacher, MA Shokrollahi SODA 98, 364-373, 1998 | 430 | 1998 |
| The power of two random choices: A survey of techniques and results AW Richa, M Mitzenmacher, R Sitaraman Combinatorial Optimization 9, 255-304, 2001 | 419 | 2001 |
| Simple load balancing for distributed hash tables J Byers, J Considine, M Mitzenmacher International Workshop on Peer-to-Peer Systems, 80-87, 2003 | 412 | 2003 |
| An improved construction for counting bloom filters F Bonomi, M Mitzenmacher, R Panigrahy, S Singh, G Varghese European Symposium on Algorithms, 684-695, 2006 | 393 | 2006 |
John W. ByersProfessor of Computer Science, Boston UniversityVerified email at cs.bu.edu
