- Efficient construction of a small hitting set for combinatorial rectangles in high dimension
- ITW 1998, San Diego, CA, February 8 --11 Practical LossResilient Codes
- ISIT 1998, Cambridge, MA, USA, August 16 --August 21 Improved LowDensity ParityCheck Codes Using Irregular Graphs
- A PSEUDORANDOM GENERATOR ONEWAY FUNCTION
- Analysis of Low Density Codes Improved Designs Using Irregular Graphs
- Applications ReliableMulticast
- A MonteCarlo Algorithm for Estimating the N. Karmarkar
- Priority Encoding Transmission Andres Albanese \Lambda Johannes Blomer y Jeff Edmonds z
- A Parallel Approximation Algorithm Positive Linear Programming
- Approximating the Permanent of Graphs with Large Factors
- On Deterministic Approximation of DNF Michael Luby \Lambda Boban Velickovi'c y
- An XORBased ErasureResilient Coding Scheme Johannes Blomer \Lambda , Malik Kalfane y , Richard Karp z , Marek Karpinski x
- Approximating the Number of Zeroes of a GF[2] Polynomial
- An Optimal Algorithm for Monte Carlo Estimation Paul Dagum \Lambda Richard Karp y Michael Luby z Sheldon Ross x
- A Linear Time ErasureResilient Code With Nearly Optimal Recovery
- Optimal Parallelization of Las Vegas Algorithms
- An Optimal Approximation Algorithm for Bayesian Inference Paul Dagum \Lambda Michael Luby y
- SelfTesting/Correcting with Applications to Numerical Problems
- Deterministic Approximate Counting of Depth2 Circuits Michael Luby \Lambda Boban Velickovi'c y Avi Wigderson z
- Network Decomposition and Locality in Distributed Computation
- Removing Randomness in Parallel Computation Without a Processor Penalty
- Efficient Approximation of Product Distributions \Lambda Guy Even y Oded Goldreich z Michael Luby x Noam Nisan --Boban Velickovi'c k
- A Digital Fountain Approach Reliable Distribution of Bulk Data
- Approximately Counting Up To Four (Extended Abstract)
- Security of Blind Digital Signatures (Extended Abstract)
- Analysis of Random Processes via AndOr Tree Evaluation
- Efficient PRAM Simulation on a Distributed Memory Machine
- Combinatorial Bounds for Broadcast Encryption Michael Luby 1? and Jessica Staddon 2??
- Accessing Multiple Mirror Sites in Using Tornado Codes to Speed Up
- Practical LossResilient Codes Michael Luby \Lambda Michael Mitzenmacher y Amin Shokrollahi z
- Program Result Checking Against Adaptive Programs and in Cryptographic Settings
- Optimal Speedup of Las Vegas Algorithms y Michael Luby z
- Approximations of General Independent Distributions Guy Even \Lambda Oded Goldreich y Michael Luby z Noam Nisan x Boban Velickovi'c --
