Search with small sets in presence of a liar

DOI10.1016/S0378-3758(01)00143-4zbMath1048.90115OpenAlexW2036156656WikidataQ127857856 ScholiaQ127857856MaRDI QIDQ5957834

No author found.

Publication date: 2002

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

Full work available at URL: https://doi.org/10.1016/s0378-3758(01)00143-4

Mathematics Subject Classification ID

Search theory (90B40) Permutations, words, matrices (05A05) Other designs, configurations (05B30) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (7)

Minimum average-case queries of \(q+1\)-ary search game with small sets ⋮ Search When the Lie Depends on the Target ⋮ Nonadaptive group testing with lies: probabilistic existence theorems ⋮ Modularity of some distance graphs ⋮ Minimal average cost of searching for a counterfeit coin: restricted model ⋮ Searching games with errors -- fifty years of coping with liars ⋮ Minimum number of queries for an adaptive liar search game with small sets

Cites Work

• On separating systems whose elements are sets of at most k elements
• On separating systems of a finite set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Search with small sets in presence of a liar