The following pages link to Michael Luby (Q685335):
Displaying 50 items.
- Approximating probabilistic inference in Bayesian belief networks is NP- hard (Q685336) (← links)
- Optimal speedup of Las Vegas algorithms (Q689615) (← links)
- Monte-Carlo algorithms for the planar multiterminal network reliability problem (Q1079111) (← links)
- A study of password security (Q1121243) (← links)
- (Q1167063) (redirect page) (← links)
- Scheduling open shops with parallel machines (Q1167065) (← links)
- Parallel asynchronous connected components in a mesh (Q1178235) (← links)
- Approximating the permanent of graphs with large factors (Q1199692) (← links)
- Removing randomness in parallel computation without a processor penalty (Q1309384) (← links)
- Self-testing/correcting with applications to numerical problems (Q1317490) (← links)
- (Q1382406) (redirect page) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- An optimal approximation algorithm for Bayesian inference (Q1402716) (← links)
- A bidirectional shortest-path algorithm with good average-case behavior (Q1823692) (← links)
- On deterministic approximation of DNF (Q1923857) (← links)
- Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
- Markov Chain Algorithms for Planar Lattice Structures (Q2784446) (← links)
- Raptor Codes (Q3012128) (← links)
- (Q3033320) (← links)
- (Q3128936) (← links)
- A linear time erasure-resilient code with nearly optimal recovery (Q3129459) (← links)
- Priority encoding transmission (Q3129461) (← links)
- (Q3138895) (← links)
- (Q3138965) (← links)
- (Q3212297) (← links)
- (Q3413301) (← links)
- (Q3495182) (← links)
- Pairwise Independence and Derandomization (Q3522268) (← links)
- Verification-Based Decoding for Packet-Based Low-Density Parity-Check Codes (Q3547290) (← links)
- (Q3746901) (← links)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem (Q3756533) (← links)
- How to Construct Pseudorandom Permutations from Pseudorandom Functions (Q3787920) (← links)
- Monte-Carlo approximation algorithms for enumeration problems (Q3834934) (← links)
- A Monte-Carlo Algorithm for Estimating the Permanent (Q4032938) (← links)
- Approximating the Number of Zeroes of a GF[2] Polynomial (Q4033769) (← links)
- (Q4231919) (← links)
- (Q4231920) (← links)
- (Q4249662) (← links)
- (Q4250203) (← links)
- (Q4252735) (← links)
- A Pseudorandom Generator from any One-way Function (Q4268715) (← links)
- On the Existence of Pseudorandom Generators (Q4277535) (← links)
- (Q4318712) (← links)
- (Q4364549) (← links)
- (Q4526978) (← links)
- (Q4527036) (← links)
- (Q4542543) (← links)
- Efficient erasure correcting codes (Q4544507) (← links)
- Improved low-density parity-check codes using irregular graphs (Q4544508) (← links)
- Fast convergence of the Glauber dynamics for sampling independent sets (Q4704791) (← links)
