Parallel exhaustive search without coordination

DOI10.1145/2897518.2897541zbMath1373.68202arXiv1511.00486OpenAlexW1921653233MaRDI QIDQ5361839

Pierre Fraigniaud, Yoav Rodeh, Amos Korman

Publication date: 29 September 2017

Published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.00486

zbMATH Keywords

robustnessparallel computationlinear searchnon-coordination

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Unnamed Item ⋮ The ANTS problem ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers

This page was built for publication: Parallel exhaustive search without coordination