69

An algorithmic approach to the lovász local lemma. i
– József Beck
 1991

219

Problems and results on 3chromatic hypergraphs and some related questions
– P Erdos, L Lov'asz
 1975

1707

The probabilistic method
– N Alon, J Spencer

29

Further Algorithmic Aspects of the Local Lemma
– Michael Molloy, Bruce Reed
 2001

63

Fast algorithms for finding O(congestion + dilation) packet routing schedules
– Tom Leighton, Bruce Maggs, Andréa W. Richa
 1999

104

Packet routing and jobshop scheduling in O(congestion+dilation) steps
– F. T. Leighton, Bruce M. Maggs, Satish B. Rao
 1994

13

Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma
– Artur Czumaj , Christian Scheideler

35

An Algorithmic Approach to the Lovász
– J Beck
 1991

84

Improved Approximation Algorithms for Shop Scheduling Problems
– David B. Shmoys, Clifford Stein, Joel Wein
 1994

258

SmallBias Probability Spaces: Efficient Constructions and Applications
– Joseph Naor, Moni Naor
 1993

380

A simple parallel algorithm for the maximal independent set problem
– Michael Luby
 1986

31

An Extension of the Lovász Local Lemma, and its Applications to Integer Programming
– Aravind Srinivasan
 1996

287

Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs
– Prabhakar Raghavan
 1988

1802

Books in graphs
– Béla Bollobás, Vladimir Nikiforov
 2008

40

Acyclic coloring of graphs, Random Structures Algorithms 2
– N Alon, C J H McDiarmid, B Reed
 1991

1309

Introduction to Parallel Algorithms and Architectures: Arrays
– F T Leighton
 1991

226

A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
– N Alon, L Babai, A Itai
 1986

270

Simple Constructions of Almost kwise Independent Random Variables
– Noga Alon, Oded Goldreich, Johan Håstad, René Peralta
 1992

337

Randomized rounding: a technique for provably good algorithms and algorithmic proofs
– Prabhakar Raghavan, Clark D Tompson
 1987
