The average-case complexity of determining the majority

SIAM Journal on Computing

Volumn 26, Issue 1, 1997, Pages 1-14

  Alonso, Laurent ^a,b   Reingold, Edward M ^c   Schott, René ^a  

^a INRIA   (France)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

Algorithm analysis; Average case; Decision trees; Lower bounds

Indexed keywords

EID: 0040810966     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794275914     Document Type: Article

References (11)

1. G. L. ALEXANDERSON, L. F. KLOSINSKI, AND L. C. LARSON, The William Lowell Putnam Mathematical Competition, Problems and Solutions: 1965-1984, Mathematical Association of America, Washington, DC, 1985.
2. L. ALONSO, E. M. REINGOLD, AND R. SCHOTT, Determining the majority, Inform. Process. Lett., 47 (1993), pp. 253-255.
3. W. FELLER, An Introduction to Probability Theory and Its Applications, Vol. I, 3rd ed., John Wiley, New York, 1968.
4. D. H. GREENE AND D. E. KNUTH, Mathematics for the Analysis of Algorithms, 3rd ed., Birkhäuser, Boston, 1990.
5. R. K. GUY AND R. J. NOWAKOWSKI, Coin-weighing problems, Amer. Math. Monthly, 102 (1995), pp. 164-167.
6. S. L. HAKIMI AND E. F. SCHMEICHEL, An adaptive algorithm for system level diagnosis, J. Algorithms, 5 (1984), pp. 526-530.
7. A. P. HlLLMAN, The William Lowell Putnam mathematical competition, Amer. Math. Monthly, 82 (1975), pp. 905-912.
8. E. M. REINGOLD, J. NIEVERGELT, AND N. DEO, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Engtewood Cliffs, NJ, 1977.
9. M. E. SAKS AND M. WERMAN, On computing majority by comparisons, Combinatorica, 11 (1991), pp. 383-387.
10. E. SCHMEICHEL, S. L. HAKIMI, M. OTSUKA, AND G. SULLIVAN, A parallel fault identification algorithm, J. Algorithms, 11 (1990), pp. 231-241.
11. R. SMULLYAN, What Is the Name of This Book?: The Riddle of Dracula and Other Logical Puzzlez, Prentice-Hall, Englewood Cliffs, NJ, 1978.