Collective asynchronous reading with polylogarithmic worst-case overhead.
Bogdan S. ChlebusDariusz R. KowalskiAlexander A. ShvartsmanPublished in: STOC (2004)
Keyphrases
- worst case
- average case
- np hard
- greedy algorithm
- upper bound
- error bounds
- computational complexity
- running times
- collective intelligence
- space complexity
- note taking
- online discussion
- approximation algorithms
- databases
- communication overhead
- asynchronous communication
- lower bound
- times faster
- worst case analysis
- asynchronous cellular automata