World's Best Scientists 2026 revealed!
Michael Mitzenmacher

Michael Mitzenmacher

D-Index & Metrics

Computer Science

D-Index
91
Citations
50480
World Ranking
563
National Ranking
300

Michael Mitzenmacher publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Michael Mitzenmacher sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 385 publications — 86th percentile

86% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Michael Mitzenmacher D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Michael Mitzenmacher sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 91 D-Index — 96th percentile

96% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

Research.com Recognitions

  • 2014 - ACM Fellow For contributions to coding theory, hashing algorithms and data structures, and networking algorithms.
  • 2000 - Fellow of Alfred P. Sloan Foundation

Overview

Michael Mitzenmacher is affiliated with Harvard University in the United States. Their primary research area is computer science, with a focus on several subfields including computer networks and communications, artificial intelligence, computer vision and pattern recognition, electrical and electronic engineering, and computational theory and mathematics.

They have contributed to a wide range of research topics, notably:

  • Caching and Content Delivery
  • Optimization and Search Problems
  • Advanced Queuing Theory Analysis
  • Algorithms and Data Compression
  • Software-Defined Networks and 5G
  • Sparse and Compressive Sensing Techniques
  • Machine Learning and Algorithms

Mitzenmacher's recent publications include the following papers:

  • Algorithms with predictions, 2022, Communications of the ACM
  • Adaptive Cuckoo Filters, 2020, ACM Journal of Experimental Algorithmics
  • Scheduling with Predictions and the Price of Misprediction, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

These publications demonstrate a focus on algorithm design and network-related algorithms. Additionally, Mitzenmacher has been associated with papers authored by frequent collaborators, reinforcing a network of research in related domains.

Frequent co-authors include:

  • Ran Ben Basat
  • Shay Vargaftik
  • Minlan Yu
  • Rana Shahout
  • Charalampos E. Tsourakakis

Mitzenmacher has published in various venues that are central to computer science research, such as:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • bioRxiv (Cold Spring Harbor Laboratory)
  • Proceedings of the VLDB Endowment
  • Internet Mathematics

Professional recognition includes being named an ACM Fellow in 2014 for contributions to coding theory, hashing algorithms and data structures, and networking algorithms. Earlier in their career, Mitzenmacher was also recognized as a Fellow of the Alfred P. Sloan Foundation in 2000.

Best Publications

  • Detecting Novel Associations in Large Data Sets

    David N. Reshef;David N. Reshef;David N. Reshef;Yakir A. Reshef;Yakir A. Reshef;Hilary K. Finucane;Sharon R. Grossman;Sharon R. Grossman

  • Probability and Computing: Randomized Algorithms and Probabilistic Analysis

    Michael Mitzenmacher;Eli Upfal

  • Network Applications of Bloom Filters: A Survey

    Andrei Z. Broder;Michael Mitzenmacher

  • A Brief History of Generative Models for Power Law and Lognormal Distributions

    Michael D. Mitzenmacher

  • A digital fountain approach to reliable distribution of bulk data

    John W. Byers;Michael Luby;Michael Mitzenmacher;Ashutosh Rege

  • The power of two choices in randomized load balancing

    M. Mitzenmacher

  • Privacy preserving keyword searches on remote encrypted data

    Yan-Cheng Chang;Michael Mitzenmacher

  • Min-Wise Independent Permutations

    Andrei Z Broder;Moses Charikar;Alan M Frieze;Michael Mitzenmacher

  • Efficient erasure correcting codes

    M.G. Luby;M. Mitzenmacher;M.A. Shokrollahi;D.A. Spielman

  • Improved low-density parity-check codes using irregular graphs

    M.G. Luby;M. Mitzenmacher;M.A. Shokrollahi;D.A. Spielman

  • Compressed Bloom filters

    Michael Mitzenmacher

  • Practical loss-resilient codes

    Michael G. Luby;Michael Mitzenmacher;M. Amin Shokrollahi;Daniel A. Spielman

  • Probability and computing

    Michael Mitzenmacher

  • Cuckoo Filter: Practically Better Than Bloom

    Bin Fan;Dave G. Andersen;Michael Kaminsky;Michael D. Mitzenmacher

  • Less hashing, same performance: Building a better Bloom filter

    Adam Kirsch;Michael Mitzenmacher

  • A digital fountain approach to asynchronous reliable multicast

    J.W. Byers;M. Luby;M. Mitzenmacher

  • The Power of Two Random Choices: A Survey of Techniques and Results

    Michael Mitzenmacher;Andrea W. Richa;Ramesh Sitaraman

  • An improved construction for counting bloom filters

    Flavio Bonomi;Michael Mitzenmacher;Rina Panigrahy;Sushil Singh

  • Analysis of low density codes and improved designs using irregular graphs

    M. Luby;M. Mitzenmacher;A. Shokrollah;D. Spielman

  • Min-wise independent permutations (extended abstract)

    Andrei Z. Broder;Moses Charikar;Alan M. Frieze;Michael Mitzenmacher

  • Improved low-density parity-check codes using irregular graphs and belief propagation

    M.G. Luby;M. Amin Shokrolloahi;M. Mizenmacher;D.A. Spielman

  • Probability and computing : an introduction to randomizedalgorithms and probabilistic analysis

    Michael Mitzenmacher;Eli Upfal

Frequent Co-Authors

Michael T. Goodrich
Michael T. Goodrich University of California, Irvine
John W. Byers
John W. Byers Boston University
Michael Luby
Michael Luby BitRipple
Andrei Z. Broder
Andrei Z. Broder Google (United States)
Eli Upfal
Eli Upfal Brown University
Pardis C. Sabeti
Pardis C. Sabeti Harvard University
Georgios Zervas
Georgios Zervas University College London
Roberto Tamassia
Roberto Tamassia Brown University
George Varghese
George Varghese University of California, Los Angeles
Susanne Albers
Susanne Albers Technical University of Munich

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens various doors, both academically and professionally. Many students consider related fields by looking into majors in college that complement or expand their options, such as data science, information technology, or engineering.

For those interested in advancing further, graduate programs offer greater depth and specialization. Some opt for the easiest masters programs to get into to quickly enhance qualifications or shift career paths. These flexible online opportunities make upskilling more accessible.

Cost is a major consideration for many prospective students. Pursuing one of the most affordable doctoral programs helps reduce student debt while still offering respected credentials. Fast-track courses, such as the cheapest edd programs online, allow educators and professionals to earn their doctorate efficiently.

Ultimately, the variety of online degrees and flexible career pathways allows students to tailor their educational journey, balancing time, cost, and career objectives.

Best Scientists Citing Michael Mitzenmacher

Trending Scientists

Recently Published Articles