107

Augmentation problems
– K P Eswaran, R E Tarjan
 1976

25

Parallel Implementation of Algorithms for Finding Connected Components in Graphs
– TsanSheng Hsu, Vijaya Ramachandran, Nathaniel Dean
 1997

258

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

270

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

28

Simulating (log c n)wise independence in NC
– B Berger, J Rompel
 1991

226

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

380

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

49

Removing Randomness in Parallel Computation Without a Processor Penalty
– Michael Luby
 1988

25

Randomized algorithms and pseudorandom numbers
– H KARLOFF, P RAGHAVAN
 1988

49

Monte Carlo simulations: Hidden errors from “good” random number generators
– A M Ferrenberg, D P Landau, Y J Wong
 1992

287

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

117

Construction of asymptotically good, lowrate errorcorrecting codes through pseudorandom graphs
– Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth
 1992

53

The probabilistic method yields deterministic parallel algorithms
– Rajeev Motwani, Joseph (Seffi) Naor, Moni Naor
 1989

23

Monte Carlo simulations: Hidden errors from "good" random number generators
– A M Ferrenberg, D P Landau, Y J Wong
 1992

20

Extracting randomness: How and why
– N Nisan
 1996

78

Fast Parallel Algorithm for the Maximal Independent Set Problem
– Richard M. Karp, Avi Wigderson
 1984

4

Yield optimization in physical design: a review
– V K R Chiluvuri
 1996

4

de Gyvez, “Yield modeling and beol fundamentals
– J P

10

Evolutionary Local Search for the EdgeBiconnectivity Augmentation Problem
– G. R. Raidl, I. Ljubić
 2002
