A parallel algorithmic version of the local lemma
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Simple construction of almost k-wise independent random variablesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Star arboricityCombinatorica, 1992
- Single round simulation on radio networksJournal of Algorithms, 1992
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991
- Acyclic coloring of graphsRandom Structures & Algorithms, 1991
- Every 7-regular digraph contains an even cycleJournal of Combinatorial Theory, Series B, 1989
- On the complexity of radio communicationPublished by Association for Computing Machinery (ACM) ,1989
- The probabilistic method yields deterministic parallel algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- A fast and simple randomized parallel algorithm for the maximal independent set problemJournal of Algorithms, 1986
- The directed subgraph homeomorphism problemTheoretical Computer Science, 1980