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

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