On two random search problems

DOI10.1016/0378-3758(85)90022-9zbMath0564.90027OpenAlexW2159716457MaRDI QIDQ1058449

András Sebő

Publication date: 1985

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(85)90022-9

zbMATH Keywords

random searchsequentialfalse coinsseparating systemsstatic search on a finite setstatic strategies

Mathematics Subject Classification ID

Search theory (90B40) Designs and configurations (05B99) Theory of questionnaires (94A50)

Related Items

A non-adaptive search algorithm that identifies up to three defects, Bounds for the Number of Tests in Non-adaptive Randomized Algorithms for Group Testing, Almost separable matrices, Decoding from Pooled Data: Sharp Information-Theoretic Bounds

Cites Work

• Unnamed Item
• A Remark on Stirling's Formula
• On the theory of random search
• On separating systems of a finite set