Michael Luby

According to our database1, Michael Luby authored at least 128 papers between 1982 and 2021.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

ACM Fellow

ACM Fellow 2015, "For contributions to coding theory, cryptography, parallel algorithms and derandomization.".

IEEE Fellow

IEEE Fellow 2009, "For contributions to theory and practice of iterative coding".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Distributed storage algorithms with optimal tradeoffs.
CoRR, 2021

2020
SOPI design and analysis for LDN.
CoRR, 2020

Repair rate lower bounds for distributed storage.
CoRR, 2020

Liquid Data Networking.
Proceedings of the ICN '20: 7th ACM Conference on Information-Centric Networking, Virtual Event, Canada, September 29, 2020

2019
Liquid Cloud Storage.
ACM Trans. Storage, 2019

A digital fountain retrospective.
Comput. Commun. Rev., 2019

2017
Learning from partial correction.
CoRR, 2017

2016
Capacity bounds for distributed storage.
CoRR, 2016

2015
Deriving and Validating User Experience Model for DASH Video Streaming.
IEEE Trans. Broadcast., 2015

Keynote 1: Converged Internet and Broadcast media delivery.
Proceedings of the 16th IEEE International Symposium on A World of Wireless, 2015

2014
Coding theory for scalable media delivery.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

2013
User Experience Modeling for DASH Video.
Proceedings of the 20th International Packet Video Workshop, 2013

2012
FLUTE - File Delivery over Unidirectional Transport.
RFC, November, 2012

RTP Payload Format for Raptor Forward Error Correction (FEC).
RFC, August, 2012

Raptor Forward Error Correction (FEC) Schemes for FECFRAME.
RFC, August, 2012

Dash in mobile networks and services.
Proceedings of the 2012 Visual Communications and Image Processing, 2012

Best practices for mobile broadcast delivery and playback of multimedia content.
Proceedings of the IEEE international Symposium on Broadband Multimedia Systems and Broadcasting, 2012

2011
RaptorQ Forward Error Correction Scheme for Object Delivery.
RFC, August, 2011

Slepian-Wolf type problems on the erasure channel.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Asynchronous Layered Coding (ALC) Protocol Instantiation.
RFC, April, 2010

2009
Layered Coding Transport (LCT) Building Block.
RFC, October, 2009

AL-FEC for Improved Mobile Reception of MPEG-2 DVB-T Transport Streams.
Int. J. Digit. Multim. Broadcast., 2009

Raptor Codes.
Found. Trends Commun. Inf. Theory, 2009

2008
IPTV Systems, Standards and Architectures: Part II - Application Layer FEC In IPTV Services.
IEEE Commun. Mag., 2008

2007
Raptor Forward Error Correction Scheme for Object Delivery.
RFC, October, 2007

Forward Error Correction (FEC) Building Block.
RFC, August, 2007

Reliable Multimedia Download Delivery in Cellular Broadcast Networks.
IEEE Trans. Broadcast., 2007

2006
Fine-grained layered multicast with STAIR.
IEEE/ACM Trans. Netw., 2006

Mobile data broadcasting over MBMS tradeoffs in forward error correction.
Proceedings of the 5th International Conference on Mobile and Ubiquitous Multimedia, 2006

Raptor codes for reliable download delivery in wireless broadcast systems.
Proceedings of the 3rd IEEE Consumer Communications and Networking Conference, 2006

2005
Verification-based decoding for packet-based low-density parity-check codes.
IEEE Trans. Inf. Theory, 2005

Pairwise Independence and Derandomization.
Found. Trends Theor. Comput. Sci., 2005

Verification decoding of raptor codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Repeat-accumulate codes that approach the Gilbert-Varshamov bound.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Wave and Equation Based Rate Control (WEBRC) Building Block.
RFC, April, 2004

Compact Forward Error Correction (FEC) Schemes.
RFC, February, 2004

Non-Abelian Homomorphism Testing, and Distributions Close to their Self-Convolutions
Electron. Colloquium Comput. Complex., 2004

Finite length analysis of LT codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Fast, Reliable Data Transport.
Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003

2002
The Use of Forward Error Correction (FEC) in Reliable Multicast.
RFC, December, 2002

Forward Error Correction (FEC) Building Block.
RFC, December, 2002

Layered Coding Transport (LCT) Building Block.
RFC, December, 2002

Asynchronous Layered Coding (ALC) Protocol Instantiation.
RFC, December, 2002

A digital fountain approach to asynchronous reliable multicast.
IEEE J. Sel. Areas Commun., 2002

FLID-DL: congestion control for layered multicast.
IEEE J. Sel. Areas Commun., 2002

Wave and equation based rate control using multicast round trip time.
Proceedings of the ACM SIGCOMM 2002 Conference on Applications, 2002

LT Codes.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
PGM Reliable Transport Protocol Specification.
RFC, December, 2001

Reliable Multicast Transport Building Blocks for One-to-Many Bulk-Data Transfer.
RFC, January, 2001

Improved low-density parity-check codes using irregular graphs.
IEEE Trans. Inf. Theory, 2001

Efficient erasure correcting codes.
IEEE Trans. Inf. Theory, 2001

Markov Chain Algorithms for Planar Lattice Structures.
SIAM J. Comput., 2001

A Scalable and Reliable Paradigm for Media on Demand.
Computer, 2001

Fine-Grained Layered Multicast.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

2000
The Reliable Multicast Design Space for Bulk Data Transfer.
RFC, August, 2000

An Optimal Algorithm for Monte Carlo Estimation.
SIAM J. Comput., 2000

FLID-DL.
Proceedings of the Networked Group Communication, 2000

1999
A Pseudorandom Generator from any One-way Function.
SIAM J. Comput., 1999

Fast convergence of the Glauber dynamics for sampling independent sets.
Random Struct. Algorithms, 1999

Accessing Multiple Mirror Sites in Parallel: Using Tornado Codes to Speed Up Downloads.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998
Efficient approximation of product distributions.
Random Struct. Algorithms, 1998

Analysis of Low Density Codes and Improved Designs Using Irregular Graphs.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

Analysis of Random Processes via And-Or Tree Evaluation.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

A Digital Fountain Approach to Reliable Distribution of Bulk Data.
Proceedings of the ACM SIGCOMM 1998 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 31, 1998

Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Feedback-free multicast prefix protocols.
Proceedings of the Third IEEE Symposium on Computers and Communications (ISCC 1998), June 30, 1998

Combinatorial Bounds for Broadcast Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

1997
Foreword.
Random Struct. Algorithms, 1997

Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension.
Comb., 1997

An Optimal Approximation Algorithm for Bayesian Inference.
Artif. Intell., 1997

Approximately Counting Up To Four (Extended Abstract).
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Practical Loss-Resilient Codes.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

A Modular Analysis of Network Transmission Protocols.
Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

Security of Blind Digital Signatures (Extended Abstract).
Proceedings of the Advances in Cryptology, 1997

1996
A linear time erasure-resilient code with nearly optimal recovery.
IEEE Trans. Inf. Theory, 1996

Priority encoding transmission.
IEEE Trans. Inf. Theory, 1996

SICACT Treasurer's Report.
SIGACT News, 1996

Tight Bounds for Dynamic Storage Allocation.
SIAM J. Discret. Math., 1996

On Deterministic Approximation of DNF.
Algorithmica, 1996

Introduction to Special Issue on Randomized and Derandomized Algorithms.
Algorithmica, 1996

Efficient PRAM Simulation on a Distributed Memory Machine.
Algorithmica, 1996

Pseudorandomness and cryptographic applications.
Princeton computer science notes, Princeton University Press, ISBN: 978-0-691-02546-9, 1996

1995
PET - Priority Encoding Transmission: A New, Robust and Efficient Video Broadcast Technology (Video).
Proceedings of the Third ACM International Conference on Multimedia '95, 1995

Markov Chain Algorithms for Planar Lattice Structures (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

An Optimal Algorithm for Monte Carlo Estimation (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

Linear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract).
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

PET - priority encoding transmission.
Proceedings of the High-Speed Networking for Multimedia Applications [2nd Int. Workshop on Architecture and Protocols for High Performance Networks, 1995

1994
Optimal Parallelization of Las Vegas Algorithms.
Proceedings of the STACS 94, 1994

1993
A Monte-Carlo Algorithm for Estimating the Permanent.
SIAM J. Comput., 1993

On the Existence of Pseudorandom Generators.
SIAM J. Comput., 1993

Removing Randomness in Parallel Computation without a Processor Penalty.
J. Comput. Syst. Sci., 1993

Self-Testing/Correcting with Applications to Numerical Problems.
J. Comput. Syst. Sci., 1993

Approximating the Number of Zeroes of a GF[2] Polynomial.
J. Algorithms, 1993

Optimal Speedup of Las Vegas Algorithms.
Inf. Process. Lett., 1993

Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard.
Artif. Intell., 1993

A parallel approximation algorithm for positive linear programming.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Deterministic Approximate Counting of Depth-2 Circuits.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992
Approximating the Permanent of Graphs with Large Factors.
Theor. Comput. Sci., 1992

On the Theory of Average Case Complexity.
J. Comput. Syst. Sci., 1992

Approximations of General Independent Distributions
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Pubic Randomness in Cryptography.
Proceedings of the Advances in Cryptology, 1992

1991
Competitive Paging Algorithms.
J. Algorithms, 1991

Parallel Asynchronous Connected Components in a Mesh.
Inf. Process. Lett., 1991

Pseudo-random Generators from One-way Functions (Abstract).
Proceedings of the Advances in Cryptology, 1991

1990
Parallel Search for Maximal Independence Given Minimal Dependence.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990

1989
A Study of Password Security.
J. Cryptol., 1989

Monte-Carlo Approximation Algorithms for Enumeration Problems.
J. Algorithms, 1989

A Bidirectional Shortest-Path Algorithm with Good Average-Case Behavior.
Algorithmica, 1989

Pseudo-random Generation from one-way functions (Extended Abstracts)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Network Decomposition and Locality in Distributed Computation
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Program Result Checking against Adaptive Programs and in Cryptographic Settings.
Proceedings of the Distributed Computing And Cryptography, 1989

On the Theory of Average Case Complexity (abstract).
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989

1988
How to Construct Pseudorandom Permutations from Pseudorandom Functions.
SIAM J. Comput., 1988

A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula.
Inf. Process. Lett., 1988

Steepest Descent Can Take Exponential Time for Symmetric Connection Networks.
Complex Syst., 1988

On the Existence of Pseudorandom Generators (Extended Abstract)
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Polytopes, Permanents and Graphs with Large Factors
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1986
A Simple Parallel Algorithm for the Maximal Independent Set Problem.
SIAM J. Comput., 1986

Pseudo-random Permutation Generators and Cryptographic Composition
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
Monte-Carlo algorithms for the planar multiterminal network reliability problem.
J. Complex., 1985

A Bidirectional Shortest-Path Algorithm With Good Average-Case Behavior (Preliminary Version).
Proceedings of the Automata, 1985

How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract).
Proceedings of the Advances in Cryptology, 1985

1984
A Probabilistic Analysis of Multidimensional Bin Packing Problems
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
Finding Shortest Paths in Very Large Networks.
Proceedings of the WG '83, 1983

How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Monte-Carlo Algorithms for Enumeration and Reliability Problems
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
Scheduling open shops with parallel machines.
Oper. Res. Lett., 1982


  Loading...