Michael Luby

From MaRDI portal
Person:685335

Available identifiers

zbMath Open luby.michael-gDBLPl/MichaelLubyWikidataQ14492353 ScholiaQ14492353MaRDI QIDQ685335

List of research outcomes





PublicationDate of PublicationType
Repair Rate Lower Bounds for Distributed Storage2021-09-07Paper
A parallel approximation algorithm for positive linear programming2015-05-07Paper
Efficient construction of a small hitting set for combinatorial rectangles in high dimension2015-05-07Paper
Raptor Codes2011-07-05Paper
Verification-Based Decoding for Packet-Based Low-Density Parity-Check Codes2008-12-21Paper
Pairwise Independence and Derandomization2008-09-01Paper
https://portal.mardi4nfdi.de/entity/Q34133012007-01-04Paper
https://portal.mardi4nfdi.de/entity/Q45425432004-01-14Paper
An optimal approximation algorithm for Bayesian inference2003-08-28Paper
Improved low-density parity-check codes using irregular graphs2002-08-04Paper
Efficient erasure correcting codes2002-08-04Paper
Markov chain algorithms for planar lattice structures2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q45270362001-03-01Paper
https://portal.mardi4nfdi.de/entity/Q45269782001-02-28Paper
Fast convergence of the Glauber dynamics for sampling independent sets2000-08-07Paper
https://portal.mardi4nfdi.de/entity/Q42527352000-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42319192000-04-26Paper
An Optimal Algorithm for Monte Carlo Estimation2000-03-19Paper
https://portal.mardi4nfdi.de/entity/Q42502032000-01-31Paper
Efficient approximation of product distributions1999-12-19Paper
A Pseudorandom Generator from any One-way Function1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42496621999-09-09Paper
https://portal.mardi4nfdi.de/entity/Q42319201999-08-08Paper
Efficient construction of a small hitting set for combinatorial rectangles in high dimension1998-03-26Paper
https://portal.mardi4nfdi.de/entity/Q43645491997-11-17Paper
A linear time erasure-resilient code with nearly optimal recovery1997-10-20Paper
Priority encoding transmission1997-06-12Paper
Efficient PRAM simulation on a distributed memory machine1997-02-18Paper
On deterministic approximation of DNF1996-10-13Paper
Tight Bounds for Dynamic Storage Allocation1996-08-13Paper
https://portal.mardi4nfdi.de/entity/Q48712181996-03-28Paper
https://portal.mardi4nfdi.de/entity/Q43187121995-08-13Paper
https://portal.mardi4nfdi.de/entity/Q31388951994-09-19Paper
Self-testing/correcting with applications to numerical problems1994-09-18Paper
On the Existence of Pseudorandom Generators1994-09-13Paper
Approximating probabilistic inference in Bayesian belief networks is NP- hard1994-02-17Paper
https://portal.mardi4nfdi.de/entity/Q31289361994-01-01Paper
Removing randomness in parallel computation without a processor penalty1993-12-20Paper
Optimal speedup of Las Vegas algorithms1993-11-15Paper
https://portal.mardi4nfdi.de/entity/Q31389651993-10-20Paper
A Monte-Carlo Algorithm for Estimating the Permanent1993-05-17Paper
Approximating the Number of Zeroes of a GF[2] Polynomial1993-05-16Paper
Approximating the permanent of graphs with large factors1993-01-16Paper
Parallel asynchronous connected components in a mesh1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q32122971991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30333201990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57487961990-01-01Paper
Monte-Carlo approximation algorithms for enumeration problems1989-01-01Paper
A bidirectional shortest-path algorithm with good average-case behavior1989-01-01Paper
A study of password security1989-01-01Paper
How to Construct Pseudorandom Permutations from Pseudorandom Functions1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34951821988-01-01Paper
A Simple Parallel Algorithm for the Maximal Independent Set Problem1986-01-01Paper
Monte-Carlo algorithms for the planar multiterminal network reliability problem1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37469011985-01-01Paper
Scheduling open shops with parallel machines1982-01-01Paper

Research outcomes over time

This page was built for person: Michael Luby