Determining the majority: The biased case

DOI10.1214/aoap/1034625343zbMath0876.68057OpenAlexW2021104342MaRDI QIDQ1364402

Philippe Chassaing

Publication date: 12 November 1997

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1034625343

zbMATH Keywords

quasi-optimal algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Stochastic programming (90C15) Optimal stochastic control (93E20) Markov and semi-Markov decision processes (90C40)

Related Items (1)

A stochastically quasi-optimal search algorithm for the maximum of the simple random walk

Cites Work

• Unnamed Item
• Unnamed Item
• Determining the majority
• On computing majority by comparisons
• Optimality of move-to-front for self-organizing data structures with locality of references
• An adaptive algorithm for system level diagnosis
• A parallel fault identification algorithm
• Average case selection
• The Average-Case Complexity of Determining the Majority
• The average complexity of a coin-weighing problem
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

This page was built for publication: Determining the majority: The biased case