Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
- M. Luby
- Computer ScienceThe 43rd Annual IEEE Symposium on Foundations of…
- 16 November 2002
LT codes are introduced, the first rateless erasure codes that are very efficient as the data length grows, and are based on EMMARM code, which was introduced in version 2.0.
A simple parallel algorithm for the maximal independent set problem
- M. Luby
- Computer ScienceSTOC '85
- 1 December 1985
Powerful and general techniques for converting Monte Carlo algorithms into deterministic algorithms are used to convert the Monte Carlo algorithm for the MIS problem into a simple deterministic algorithm with the same parallel running time.
This talk will introduce several classes of probabilistic Fountain codes, including LT-and Raptor codes, show tools for their design and analysis, and discuss how they are used today to solve various data transmission problems on heterogenous unreliable networks.
A Pseudorandom Generator from any One-way Function
- J. Håstad, R. Impagliazzo, L. Levin, M. Luby
- Computer Science, MathematicsSIAM J. Comput.
- 1 March 1999
It is shown how to construct a pseudorandom generator from any one-way function, and it is shown that there is a Pseudorandom Generator if and only ifthere is a one- way function.
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Any pseudorandom bit generator can be used to construct a block private key cryptos system which is secure against chosen plaintext attack, which is one of the strongest known attacks against a cryptosystem.
Self-testing/correcting with applications to numerical problems
This work presents general techniques for constructing simple to program self-testing/correcting pairs for a variety of numerical functions, including integer multiplication, modular multiplication, matrix multiplication, inverting matrices, computing the determinant of a matrix, Computing the rank of a Matrix, integer division, modular exponentiation, and polynomial multiplication.
Efficient erasure correcting codes
- M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman
- Computer ScienceIEEE Trans. Inf. Theory
- 1 February 2001
A simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs is introduced and a simple criterion involving the fractions of nodes of different degrees on both sides of the graph is obtained which is necessary and sufficient for the decoding process to finish successfully with high probability.
A digital fountain approach to reliable distribution of bulk data
A protocol is developed that closely approximates a digital fountain using a new class of erasure codes that for large block sizes are orders of magnitude faster than standard erasures codes.
Practical loss-resilient codes
- M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, V. Stemann
- Computer ScienceSTOC '97
- 4 May 1997
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encod-ing and decoding algorithms for…