The communication complexity of distributed task allocation
From MaRDI portal
Publication:2933777
DOI10.1145/2332432.2332443zbMath1301.68134OpenAlexW2045760791MaRDI QIDQ2933777
Fabian Kuhn, Rotem Oshman, Andrew Drucker
Publication date: 5 December 2014
Published in: Proceedings of the 2012 ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.261.2512
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model ⋮ Solving the at-most-once problem with nearly optimal effectiveness ⋮ Lessons from the congested clique applied to MapReduce ⋮ Bounds on oblivious multiparty quantum communication complexity ⋮ Doing-it-all with bounded work and communication ⋮ Unnamed Item ⋮ Fast distributed algorithms for testing graph properties ⋮ The role of randomness in the broadcast congested clique model ⋮ Connectivity and connected components in the number-in-hand computation model ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE
This page was built for publication: The communication complexity of distributed task allocation
