Electing a leader in a synchronous ring
Journal of the ACM (JACM)
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Locality in distributed graph algorithms
SIAM Journal on Computing
Rounds in communication complexity revisited
SIAM Journal on Computing
Communication complexity
What cannot be computed locally!
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On the complexity of distributed graph coloring
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Design and Analysis of Distributed Algorithms (Wiley Series on Parallel and Distributed Computing)
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
Improved distributed approximate matching
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Distributed (δ+1)-coloring in linear (in δ) time
Proceedings of the forty-first annual ACM symposium on Theory of computing
Weak graph colorings: distributed algorithms and applications
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
On the bit communication complexity of randomized rumor spreading
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
A new technique for distributed symmetry breaking
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Deterministic distributed vertex coloring in polylogarithmic time
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed coloring in Õ (√log n) Bit Rounds
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Distributed coloring depending on the chromatic number or the neighborhood growth
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Symmetry breaking depending on the chromatic number or the neighborhood growth
Theoretical Computer Science
| Hi-index | 0.00 |
We present tradeoffs between time complexity t, bit complexity b, and message complexity m. Two communication parties can exchange Θ(mlog(tb/m2)+b) bits of information for m bt and Θ(b) for m ≥ √bt. This allows to derive lower bounds on the time complexity for distributed algorithms as we demonstrate for the MIS and the coloring problems. We reduce the bit-complexity of the state-of-the art O(Δ) coloring algorithm without changing its time and message complexity. We also give techniques for several problems that require a time increase of tc (for an arbitrary constant c) to cut both bit and message complexity by Ω(log t). This improves on the traditional time-coding technique which does not allow to cut message complexity.