Tightening the bounds on the Baron's omni-sequence

DOI10.1016/J.DISC.2011.12.026MaRDI QIDQ764901zbMATH OpenOpenAlexFDO

Authors Michael Brand

Publication date 16 March 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.12.026

zbMATH Keywords

verificationBaron's omni-sequencecoin weighingMünchhausen

Mathematics Subject Classification ID

Search theory (90B40) Searching and sorting (68P10) Partitions of sets (05A18) Other combinatorial number theory (11B75) Extremal combinatorics (05D99)

Recommendations

• Münchhausen matrices
• Lower bounds on the Münchhausen problem
• Baron Münchhausen's sequence
• Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle
• Coins and cones

Cites work

• scientific article; zbMATH DE number 3916389 (Why is no real title available?)
• scientific article; zbMATH DE number 1099195 (Why is no real title available?)
• scientific article; zbMATH DE number 1511595 (Why is no real title available?)
• Baron Münchhausen redeems himself: bounds for a coin-weighing puzzle
• Introduction to algorithms
• The general counterfeit coin problem

Cited in

(3)

• Lower bounds on the Münchhausen problem
• Münchhausen matrices
• Baron Münchhausen's sequence

This page was built for publication: Tightening the bounds on the Baron's omni-sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764901)