# Parallel Algorithms via the Probabilistic Method

@inproceedings{Srivastav2007ParallelAV, title={Parallel Algorithms via the Probabilistic Method}, author={Anand Srivastav and Lasse Kliemann}, booktitle={Handbook of Parallel Computing}, year={2007} }

We give an introduction to the design of parallel algorithms with the probabilistic
method. Algorithms of this kind usually possess a randomized sequential counterpart.
Parallelization of such algorithms is inherently linked with derandomization, either
with the Erdős-Spencer method of conditional probabilities, or exhaustive search in
a polynomial sized sample space.
The key notation is the treatment of random variables with various concepts of
only limited independence, leading to…

## 3 Citations

### Adaptive density control in heterogeneous wireless sensor networks with and without power management

- Computer ScienceIET Commun.
- 2010

The authors discover a functional relationship between the redundancy, density of nodes in each tier for active coverage and the network lifetime, which is much less pronounced in the absence of heterogeneity.

### 1 Parallel Algorithms via the Probabilistic Method

- Computer Science
- 2008

Christian-Albrechts Universitat zu Kiel 1.

### Derandomizing local distributed algorithms under bandwidth restrictions

- Computer ScienceDistributed Computing
- 2020

The congested clique model, which allows all-to-all communication, is addressed, and there is a deterministic maximal independent set algorithm that runs in O ( log 2 Δ ) rounds, where Δ is the maximum degree.

## References

SHOWING 1-10 OF 131 REFERENCES

### The probabilistic method yields deterministic parallel algorithms

- Computer Science30th Annual Symposium on Foundations of Computer Science
- 1989

Results obtained by applying the method of conditional probabilities to the set balancing problem, lattice approximation, edge-coloring graphs, random sampling, and combinatorial constructions are presented.

### Improved parallel approximation of a class of integer programming problems

- Computer ScienceAlgorithmica
- 2006

We present a method to derandomizeRNC algorithms, converting them toNC algorithms. Using it, we show how to approximate a class of NP-hard integer programming problems inNC, to within factors better…

### (De)randomized Construction of Small Sample Spaces in NC

- Computer Science, MathematicsJ. Comput. Syst. Sci.
- 1997

This paper provides the first parallel parallel (NC) algorithm for constructing a compact distribution that satisfies the constraints up to a small relative error and suggests new proof techniques which might be useful in general probabilistic analysis.

### A parallel algorithmic version of the local lemma

- Computer Science, Mathematics[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
- 1991

The Lovasz local lemma (1975) is a tool that enables one to show that certain events hold with positive, though very small probability, thus providing deterministic NC/sup 1/ algorithms for various interesting algorithmic search problems.

### Splitters and near-optimal derandomization

- Computer Science, MathematicsProceedings of IEEE 36th Annual Foundations of Computer Science
- 1995

A fairly general method for finding deterministic constructions obeying k-restrictions, which yields structures of size not much larger than the probabilistic bound and imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/Spl Sigma/ threshold formulae.

### On the parallel complexity of computing a maximal independent set in a hypergraph

- Mathematics, Computer ScienceSTOC '92
- 1992

It is shown that an algorithm proposed by Beame and Luby is in randomized NC for hypergraphs in which the maximum edge size is bounded by a constant, and the upper tail of sums of dependent random variables defined on the edges of a hypergraph is bound.

### Parallel search for maximal independence given minimal dependence

- MathematicsSODA '90
- 1990

A randomized NC algorithm for the case when the size of each minimal dependent set is at most a constant is provided, and an algorithm which is conjecture is a randomized NC algorithms for the general case is provided.

### Randomized geometric algorithms and pseudo-random generators

- Computer Science, MathematicsProceedings., 33rd Annual Symposium on Foundations of Computer Science
- 1992

The author shows that the expected running times of most of the randomized incremental algorithms in computational geometry do not change (up to a constant factor), when the sequence of additions is not truly random but is instead generated using only O(log n) random bits.

### On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms

- Mathematics, Computer ScienceInf. Comput.
- 1987