Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. M. Aigner, Combinatorial Search, Wiley (1988).
2. M. Aigner, Variants of the majority problem, Discrete Applied Math., 137 (2004), 3–25.
3. M. Aigner, G. de Marco and M. Montangero, The plurality problem with three colors and more, to appear in Theoretical Computer Science.
4. L. Alonso, E. Reingold and R. Schott, Determining the majority, Information Processing Letters, 47 (1993), 253–255.
5. L. Alonso, E. Reingold and R. Schott, Average-case complexity of determining the majority, SIAM J. Computing, 26 (1997), 1–14.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. From Discrepancy to Majority;Algorithmica;2017-03-16
2. Searching for majority with k-tuple queries;Discrete Mathematics, Algorithms and Applications;2015-05-25
3. Computing Majority with Triple Queries;Lecture Notes in Computer Science;2011