Brief announcement: exponential speed-up of local algorithms using non-local communication

Authors:
Christoph Lenzen;Roger Wattenhofer
Affiliations:
ETH Zurich, Zurich, Switzerland;ETH Zurich, Zurich, Switzerland
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 6
Cited 2

A simple parallel algorithm for the maximal independent set problem

SIAM Journal on Computing
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The price of being near-sighted

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Improved distributed approximate matching

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributed and parallel algorithms for weighted vertex cover and other covering problems

Proceedings of the 28th ACM symposium on Principles of distributed computing

The round complexity of distributed sorting: extended abstract

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Super-fast distributed algorithms for metric facility location

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate how to leverage a system's capability for all-to-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions. More precisely, if a network comprises n nodes with all-to-all bandwidth nε (ε 0 constant) and nodes know their input and neighborhood with respect to a graph problem instance of polylogarithmic maximum degree, any local algorithm for this problem with running time r ∈ O(log n) and reasonably small states can be simulated within O(log r) rounds.