Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGs.
Bernhard HaeuplerDavid G. HarrisPublished in: SODA (2017)
Keyphrases
- parallel algorithm
- directed acyclic graph
- parallel computation
- upper bound
- lower bound
- approximation methods
- shared memory
- parallel programming
- parallel version
- combinatorial search problems
- cluster of workstations
- parallel implementations
- belief networks
- johnson lindenstrauss
- processor array
- discovery of association rules
- pc cluster
- database management systems
- peer to peer
- wireless sensor networks
- search space