Search problems: One, two or many rounds
type: Item
instance of: scholarly article
title: Search problems: One, two or many rounds
zbMATH Open document ID: 0824.68106
DOI: 10.1016/0012-365X(94)00106-S
author: Claude A. Christen
published in: Discrete Mathematics
publication date: 1995-02-13T00:00:00Z
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 722484
zbMATH Keywords: combinatorial search theory
MaRDI profile type: Publication
cites work: Q4773298
cites work: Search problems on graphs
cites work: Q3994535
cites work: The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
cites work: Parallel sorting
cites work: Optimal Detection of Two Complementary Defectives
cites work: Q4857782
cites work: Some Completeness Results on Decision Trees and Group Testing
cites work: An improved algorithm for quantitative group testing
cites work: Parallel Sorting with Constant Time for Comparisons
cites work: Error Detecting and Error Correcting Codes
cites work: The optimal procedures for quantitative group testing
cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Q4294600
cites work: Q5535504
cites work: Determination of two vectors from the sum
cites work: On \(B_ 2\)-sequences of vectors
cites work: Q4146667
cites work: Q5750863
cites work: Sorting and Selecting in Rounds
cites work: Coping with errors in binary search procedures
description: scientific article; zbMATH DE number 722484