The worst-case chip problem
type: Item
instance of: scholarly article
title: The worst-case chip problem
zbMATH Open document ID: 1178.68696
author: L. Alonso
author: Philippe Chassaing
author: Edward M. Reingold
author: R. Schott
published in: Information Processing Letters
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5576958
zbMATH Keywords: fault diagnosis
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: chip problem
zbMATH Keywords: majority problem
MaRDI profile type: Publication
full work available at URL: j.ipl.2003.11.013
OpenAlex ID: W1965862047
cites work: Determining the majority
cites work: The Average-Case Complexity of Determining the Majority
cites work: Q5471353
cites work: On a logical problem
cites work: Q3619797
cites work: Mathematics for the Analysis of Algorithms.
cites work: Reliable Fault Diagnosis with Few Tests
cites work: Optimization of Reduced Dependencies for Synchronous Sequential Machines
cites work: On computing majority by comparisons
cites work: A parallel fault identification algorithm
cites work: Q3869300
cites work: Search for a majority element
DOI: 10.1016/J.IPL.2003.11.013
Recommended article: Q5471353
Recommended article: Combinatorial Problems in Chip Design
Recommended article: Circuit complexity: from the worst case to the average case
Recommended article: The pin redistribution problem in multi-chip modules
Recommended article: On worst case design strategies
Recommended article: Q3976790
Recommended article: Q4687388
Recommended article: On the complexity of the chip-firing reachability problem
Recommended article: Algorithms and Data Structures
description: scientific article; zbMATH DE number 5576958