World's Best Scientists 2026 revealed!
Michael Luby

Michael Luby

D-Index & Metrics

Computer Science

D-Index
98
Citations
44804
World Ranking
400
National Ranking
221

Michael Luby 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 Luby 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: 256 publications — 64th percentile

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

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

Michael Luby 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 Luby 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: 98 D-Index — 97th percentile

97% 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

  • 2015 - ACM Paris Kanellakis Theory and Practice Award For ground-breaking contributions to erasure correcting codes, which are essential for improving the quality of video transmission over the Internet.
  • 2015 - ACM Fellow For contributions to coding theory, cryptography, parallel algorithms and derandomization.
  • 2014 - Member of the National Academy of Engineering For contributions to coding theory including the inception of rateless codes.
  • 2012 - IEEE Richard W. Hamming Medal “For the conception, development, and analysis of practical rateless codes.”
  • 2009 - IEEE Fellow For contributions to theory and practice of iterative coding
  • 2007 - IEEE Eric E. Sumner Award “For bridging mathematics, internet design and mobile broadcasting as well as successful standardization.”

Overview

Michael Luby is affiliated with BitRipple in the United States and specializes primarily in computer science. Their research has a strong focus on computer networks and communications, with additional work in computer vision and pattern recognition as well as human-computer interaction.

The main topics addressed in their work include advanced data storage technologies, caching and content delivery, distributed systems and fault tolerance, error correcting code techniques, image and video quality assessment, virtual reality applications and impacts, and peer-to-peer network technologies.

Frequent co-authors collaborating with Michael Luby are Thomas J. Richardson, Pooja Aggarwal, and Lorenz Minder. Their work has primarily been published in venues such as arXiv (Cornell University) and IEEE Transactions on Information Theory.

Recent papers by Michael Luby include:

  • SOPI design and analysis for LDN (2020), arXiv (Cornell University)
  • Distributed storage algorithms with optimal tradeoffs (2021), arXiv (Cornell University)
  • Repair Rate Lower Bounds for Distributed Storage (2021), IEEE Transactions on Information Theory
  • Whack-a-Mole: Deterministic Packet Spraying Across Multiple Network Paths (2025), arXiv (Cornell University)

Michael Luby has been recognized with several awards, including the ACM Fellow (2015) for contributions to coding theory, cryptography, parallel algorithms, and derandomization. The same year, they received the ACM Paris Kanellakis Theory and Practice Award for contributions to erasure correcting codes related to video transmission over the Internet.

Additional distinctions include membership in the National Academy of Engineering (2014) for work in coding theory including the inception of rateless codes, the IEEE Richard W. Hamming Medal (2012) for developing practical rateless codes, IEEE Fellow (2009) for contributions to iterative coding theory and practice, and the IEEE Eric E. Sumner Award (2007) for bridging mathematics, internet design, and mobile broadcasting standards.

Best Publications

  • LT codes

    M. Luby

  • A Pseudorandom Generator from any One-way Function

    Johan HÅstad;Russell Impagliazzo;Leonid A. Levin;Michael Luby

  • Raptor Codes

    Amin Shokrollahi;Michael Luby

  • A simple parallel algorithm for the maximal independent set problem

    Michael Luby

  • A digital fountain approach to reliable distribution of bulk data

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

  • Efficient erasure correcting codes

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

  • Optimal speedup of Las Vegas algorithms

    M. Luby;A. Sinclair;D. Zuckerman

  • How to construct pseudorandom permutations from pseudorandom functions

    Michael Luby;Charles Rackoff

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

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

  • Practical loss-resilient codes

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

  • Priority encoding transmission

    A. Albanese;J. Blomer;J. Edmonds;M. Luby

  • Approximating probabilistic inference in Bayesian belief networks is NP-hard

    Paul Dagum;Michael Luby

  • Pseudo-random generation from one-way functions

    R. Impagliazzo;L. A. Levin;M. Luby

  • A digital fountain approach to asynchronous reliable multicast

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

  • Pseudorandomness and Cryptographic Applications

    Michael George Luby;Luby Michael

  • An XOR-based erasure-resilient coding scheme

    Johannes Blömer;Malik Kalfane;Richard Karp;Marek Karpinski

  • Competitive paging algorithms

    Amos Fiat;Richard M. Karp;Michael Luby;Lyle A. McGeoch

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

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

  • Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads

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

  • One-way functions are essential for complexity based cryptography

    R. Impagliazzo;M. Luby

  • Self-testing/correcting with applications to numerical problems

    M. Blum;M. Luby;R. Rubinfeld

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

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

  • Pseudo-random Generation from one-way functions (Extended Abstracts)

    Russell Impagliazzo;Leonid A. Levin;Michael Luby

  • How to construct pseudo-random permutations from pseudo-random functions

    Michael Luby;Charles Rackoff

Frequent Co-Authors

Thomas Stockhammer
Thomas Stockhammer Qualcomm (Germany)
Michael Mitzenmacher
Michael Mitzenmacher Harvard University
Richard M. Karp
Richard M. Karp University of California, Berkeley
John W. Byers
John W. Byers Boston University
Jon Crowcroft
Jon Crowcroft University of Cambridge
Amin Shokrollahi
Amin Shokrollahi École Polytechnique Fédérale de Lausanne
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Daniel A. Spielman
Daniel A. Spielman Yale University
Mark Handley
Mark Handley University College London
Tom Richardson
Tom Richardson Qualcomm (United States)

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 online education options can open new doors for those interested in Computer Science or related fields. If you're starting your academic journey, you may want to consider what is the easiest associate's degree to get, which can be a practical and accessible way to enter the world of technology.

For individuals seeking advanced studies, options like the cheapest accredited online doctoral programs allow you to earn a recognized credential without the high cost of traditional education. No matter which path you choose, it is essential to ensure your program is reputable. Verify that your chosen institution is included among online degree programs accredited to help ensure your qualifications are valued by employers and other universities.

Looking to specialize your skills? Careers in gaming are booming, and programs like online game design programs allow you to combine creativity with coding from anywhere in the world. Whatever your career goal, online study can provide flexible and affordable pathways to success.

Best Scientists Citing Michael Luby

Trending Scientists

Recently Published Articles