Search problems: One, two or many rounds

DOI10.1016/0012-365X(94)00106-SzbMath0824.68106MaRDI QIDQ1344611

Claude A. Christen

Publication date: 13 February 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial search theory

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (1)

Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Search problems on graphs
• Coping with errors in binary search procedures
• An improved algorithm for quantitative group testing
• The optimal procedures for quantitative group testing
• Parallel sorting
• On \(B_ 2\)-sequences of vectors
• Some Completeness Results on Decision Trees and Group Testing
• Sorting and Selecting in Rounds
• The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
• Parallel Sorting with Constant Time for Comparisons
• Error Detecting and Error Correcting Codes
• Optimal Detection of Two Complementary Defectives
• A Method for the Construction of Minimum-Redundancy Codes
• Determination of two vectors from the sum
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes

This page was built for publication: Search problems: One, two or many rounds