Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The worst-case chip problem

From MaRDI portal
Publication:1029103
Jump to:navigation, search

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


zbMATH Keywords

analysis of algorithmsfault diagnosismajority problemchip problem


Mathematics Subject Classification ID

Analysis of algorithms (68W40)


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1029103&oldid=13031872"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 22:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki