From Discrepancy to Majority
Authors:
- 16 March 2017
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 80 (4) , 1278-1297
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (CCF-1228639)
- National Science Foundation (CCF-1618301, CCF-1616248)
This publication has 17 references indexed in Scilit:
- Randomized strategies for the plurality problemDiscrete Applied Mathematics, 2008
- Improved Combinatorial Group Testing Algorithms for Real‐World Problem SizesSIAM Journal on Computing, 2007
- Probabilistic strategies for the partition and plurality problemsRandom Structures & Algorithms, 2006
- The plurality problem with three colors and moreTheoretical Computer Science, 2005
- Variants of the majority problemDiscrete Applied Mathematics, 2004
- Search for a majority elementJournal of Statistical Planning and Inference, 2002
- The Average-Case Complexity of Determining the MajoritySIAM Journal on Computing, 1997
- Determining the majorityInformation Processing Letters, 1993
- On computing majority by comparisonsCombinatorica, 1991
- Short monotone formulae for the majority functionJournal of Algorithms, 1984