The worst-case chip problem
From MaRDI portal
Publication:1029103
DOI10.1016/j.ipl.2003.11.013zbMath1178.68696OpenAlexW1965862047MaRDI QIDQ1029103
Philippe Chassaing, Laurent Alonso, René Schott, Edward M. Reingold
Publication date: 9 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2003.11.013
Related Items (4)
The plurality problem with three colors and more. ⋮ Randomized strategies for the plurality problem ⋮ On more variants of the majority problem ⋮ Truth tellers and liars with fewer questions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mathematics for the Analysis of Algorithms.
- Determining the majority
- On computing majority by comparisons
- On a logical problem
- A parallel fault identification algorithm
- Reliable Fault Diagnosis with Few Tests
- The Average-Case Complexity of Determining the Majority
- Optimization of Reduced Dependencies for Synchronous Sequential Machines
- Search for a majority element
This page was built for publication: The worst-case chip problem