publication . Preprint . Conference object . 2016

Tight Network Topology Dependent Bounds on Rounds of Communication

Arkadev Chattopadhyay; Michael Langberg; Shi Li; Atri Rudra;
Open Access English
  • Published: 10 Aug 2016
Abstract
Comment: 31 pages, 2 figures
Subjects
free text keywords: Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Discrete mathematics, Topological graph theory, Linear network coding, Steiner tree problem, symbols.namesake, symbols, Discrete geometry, Communication complexity, Communication problem, Algebraic geometry, Computer science, Network topology, Theoretical computer science

[DSHK+12] A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. SIAM Journal on Computing, 41(5):1235-1265, 2012.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Preprint . Conference object . 2016

Tight Network Topology Dependent Bounds on Rounds of Communication

Arkadev Chattopadhyay; Michael Langberg; Shi Li; Atri Rudra;