Searching for authors named "Michael Luby" – sorted by Relevance.
-
Removing Randomness in Parallel Computation Without a Processor Penalty
- Removing Randomness in Parallel Computation Without a Processor Penalty Michael Luby
- Cited by 50 (1 self) – Add To MetaCart
-
LT Codes
- that they are simultaneously near optimal for LT Codes Michael Luby Digital Fountain, Inc. luby@(email omitted); every
- Cited by 142 (1 self) – Add To MetaCart
-
On Deterministic Approximation of DNF
- On Deterministic Approximation of DNF Michael Luby Boban Velickovi'c y TR-93-009 March 1993
- Cited by 14 (3 self) – Add To MetaCart
-
Approximating the Permanent of Graphs with Large Factors
- Group Knowledge Systems Laboratory Stanford University Stanford, CA 94305 Michael Luby y International
- Cited by 17 (2 self) – Add To MetaCart
-
A linear time erasure-resilient code with nearly optimal recovery
- A Linear Time Erasure-Resilient Code With Nearly Optimal Recovery Noga Alon ∗ Michael Luby
- Cited by 32 (6 self) – Add To MetaCart
-
Verification Codes
- Verification Codes Michael Luby* Michael Mitzenmacher t Abstract Most work in low-density parity
- Cited by 1 (0 self) – Add To MetaCart
-
Approximating the Number of Zeroes of a GF[2] Polynomial
- Approximating the Number of Zeroes of a GF[2] Polynomial Marek Karpinski Michael Luby y
- Cited by 4 (1 self) – Add To MetaCart
-
Approximately Counting Up To Four (Extended Abstract)
- Approximately Counting Up To Four (Extended Abstract) Michael Luby Eric Vigoda y Abstract We
- Cited by 4 (1 self) – Add To MetaCart
-
Approximating the Number of Solutions of a GF(2) Polynomial
- Michael Luby International Computer Science Institute Berkeley, California Abstract We develop a
- Cited by 5 (4 self) – Add To MetaCart
-
Public Randomness in Cryptography
- Public Randomness in Cryptography Amir Herzberg y Michael Luby z TR-92-068 October 1992
- Cited by 11 (1 self) – Add To MetaCart

