Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs.
Bernhard HaeuplerDavid G. HarrisPublished in: ACM Trans. Algorithms (2017)
Keyphrases
- parallel algorithm
- directed acyclic graph
- lower bound
- approximation methods
- parallel computation
- parallel programming
- upper bound
- shared memory
- parallel implementations
- parallel computers
- johnson lindenstrauss
- parallel version
- general purpose
- database systems
- directed graph
- orders of magnitude
- combinatorial search problems