| 2015 | WoWMoM | Keynote 1: Converged Internet and Broadcast media delivery. | Michael Luby |
| 2012 | VCIP | Dash in mobile networks and services. | Thomas Stockhammer, Michael Luby |
| 2011 | ISIT | Slepian-Wolf type problems on the erasure channel. | Michael Luby, Mohammad Amin Shokrollahi |
| 2006 | MUM | Mobile data broadcasting over MBMS tradeoffs in forward error correction. | Michael Luby, Mark Watson, Tiago Gasiba, Thomas Stockhammer |
| 2005 | ISIT | Repeat-accumulate codes that approach the Gilbert-Varshamov bound. | Andrew Brown, Michael Luby, Amin Shokrollahi |
| 2005 | ISIT | Verification decoding of raptor codes. | Richard M. Karp, Michael Luby, Amin Shokrollahi |
| 2004 | ISIT | Finite length analysis of LT codes. | Richard M. Karp, Michael Luby, Amin Shokrollahi |
| 2002 | FOCS | LT Codes. | Michael Luby |
| 2002 | SIGCOMM | Wave and equation based rate control using multicast round trip time. | Michael Luby, Vivek K. Goyal, Simon Skaria, Gavin B. Horn |
| 2001 | INFOCOM | Fine-Grained Layered Multicast. | John W. Byers, Michael Luby, Michael Mitzenmacher |
| 1999 | INFOCOM | Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads. | John W. Byers, Michael Luby, Michael Mitzenmacher |
| 1998 | EuroCrypt | Combinatorial Bounds for Broadcast Encryption. | Michael Luby, Jessica Staddon |
| 1998 | ISCC | Feedback-free multicast prefix protocols. | Yair Bartal, John W. Byers, Michael Luby, Danny Raz |
| 1998 | SODA | Analysis of Random Processes via And-Or Tree Evaluation. | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi |
| 1998 | STOC | Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman |
| 1998 | SIGCOMM | A Digital Fountain Approach to Reliable Distribution of Bulk Data. | John W. Byers, Michael Luby, Michael Mitzenmacher, Ashutosh Rege |
| 1997 | CRYPTO | Security of Blind Digital Signatures (Extended Abstract). | Ari Juels, Michael Luby, Rafail Ostrovsky |
| 1997 | STOC | Practical Loss-Resilient Codes. | Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman, Volker Stemann |
| 1997 | STOC | Approximately Counting Up To Four (Extended Abstract). | Michael Luby, Eric Vigoda |
| 1995 | FOCS | Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract). | Noga Alon, Jeff Edmonds, Michael Luby |
| 1995 | FOCS | An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract). | Paul Dagum, Richard M. Karp, Michael Luby, Sheldon M. Ross |
| 1995 | FOCS | Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract). | Michael Luby, Dana Randall, Alistair Sinclair |
| 1994 | FOCS | Priority Encoding Transmission | Andres Albanese, Johannes Blmer, Jeff Edmonds, Michael Luby, Madhu Sudan |
| 1994 | SODA | Tight Bounds for Dynamic Storage Allocation. | Michael Luby, Joseph Naor, Ariel Orda |
| 1994 | STACS | Optimal Parallelization of Las Vegas Algorithms. | Michael Luby, Wolfgang Ertel |
| 1993 | STOC | Efficient construction of a small hitting set for combinatorial rectangles in high dimension. | Nathan Linial, Michael Luby, Michael E. Saks, David Zuckerman |
| 1993 | STOC | A parallel approximation algorithm for positive linear programming. | Michael Luby, Noam Nisan |
| 1992 | CRYPTO | Pubic Randomness in Cryptography. | Amir Herzberg, Michael Luby |
| 1992 | STOC | Approximations of General Independent Distributions | Guy Even, Oded Goldreich, Michael Luby, Noam Nisan, Boban Velickovic |
| 1992 | STOC | Efficient PRAM Simulation on a Distributed Memory Machine | Richard M. Karp, Michael Luby, Friedhelm Meyer auf der Heide |
| 1991 | CRYPTO | Pseudo-random Generators from One-way Functions (Abstract). | Michael Luby |
| 1991 | SODA | Approximating the Number of Zeroes of a GF[2] Polynomial. | Marek Karpinski, Michael Luby |
| 1991 | STOC | On Deterministic Approximation of DNF | Michael Luby, Boban Velickovic |
| 1990 | SODA | Parallel Search for Maximal Independence Given Minimal Dependence. | Paul Beame, Michael Luby |
| 1990 | STOC | Self-Testing/Correcting with Applications to Numerical Problems | Manuel Blum, Michael Luby, Ronitt Rubinfeld |
| 1989 | FOCS | Network Decomposition and Locality in Distributed Computation | Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin |
| 1989 | FOCS | One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract) | Russell Impagliazzo, Michael Luby |
| 1989 | STOC | On the Theory of Average Case Complexity | Shai Ben-David, Benny Chor, Oded Goldreich, Michael Luby |
| 1989 | STOC | Pseudo-random Generation from one-way functions (Extended Abstracts) | Russell Impagliazzo, Leonid A. Levin, Michael Luby |
| 1988 | CRYPTO | On the Existence of Pseudorandom Generators. | Oded Goldreich, Hugo Krawczyk, Michael Luby |
| 1988 | FOCS | Polytopes, Permanents and Graphs with Large Factors | Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani |
| 1988 | FOCS | On the Existence of Pseudorandom Generators (Extended Abstract) | Oded Goldreich, Hugo Krawczyk, Michael Luby |
| 1988 | FOCS | Removing Randomness in Parallel Computation Without a Processor Penalty | Michael Luby |
| 1987 | CRYPTO | A Study of Password Security. | Michael Luby, Charles Rackoff |
| 1986 | STOC | Pseudo-random Permutation Generators and Cryptographic Composition | Michael Luby, Charles Rackoff |
| 1985 | CRYPTO | How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract). | Michael Luby, Charles Rackoff |
| 1985 | ICALP | A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version). | Michael Luby, Prabhakar Ragde |
| 1985 | STOC | A Simple Parallel Algorithm for the Maximal Independent Set Problem | Michael Luby |
| 1984 | STOC | A Probabilistic Analysis of Multidimensional Bin Packing Problems | Richard M. Karp, Michael Luby, Alberto Marchetti-Spaccamela |
| 1983 | FOCS | Monte-Carlo Algorithms for Enumeration and Reliability Problems | Richard M. Karp, Michael Luby |
| 1983 | FOCS | How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin | Michael Luby, Silvio Micali, Charles Rackoff |