Comparison-based time-space lower bounds for selection

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 140-149

  Chan, Timothy M ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHING PROGRAMS; EXPECTED TIME; RANDOMIZED ALGORITHMS; SELECTION PROBLEMS; SEQUENTIAL ACCESS; STREAMING ALGORITHM; STREAMING MODEL; TIME SPACE TRADEOFFS;

ALGORITHMS;

EID: 70349161155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.17     Document Type: Conference Paper

References (29)

1. M. Ajtai. A non-linear time lower bound for Boolean branching programs. In Proc. 40th IEEE Sympos. Found. Comput. Sci., pages 60-70, 1999. (Pubitemid 129306183)
2. M. Ajtai. Determinism versus nondeterminism for linear time RAMs with memory restrictions. J. Comput. Sys. Sci., 65:2-37, 2002.
3. L. Arge and J. Pagter. I/O-space trade-offs. In Proc. 7th Scand. Workshop Algorithm Theory, Lect. Notes Comput. Sci., vol.1851, Springer-Verlag, pages 448-461, 2000.
4. P. Beame. A general sequential time-space tradeoff for finding unique elements. SIAM J. Comput., 20:270-277, 1991.
5. P. Beame, T. S. Jayram, and M. Saks. Time-space tradeoffs for branching programs. J. Comput Sys. Sci., 63:542-572, 2001.
6. P. Beame, M. Saks, X. Sun, and E. Vee. Time-space trade-off lower bounds for randomized computation of decision problems. J. ACM, 50:154-195, 2003.
7. S. W. Bent and J. W. John. Finding the median requires 2n comparisons. In Proc. 17th ACM Sympos. Theory Comput., pages 213-216, 1985.
8. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. J. Comput. Sys. Sci., 7:448-461, 1973.
9. A. Borodin and S. A. Cook. A time-space tradeoff for sorting on a general sequential model of computation. SIAM J. Comput., 11:287-297, 1982.
10. A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson. A time-space tradeoff for element distinctness. SIAM J. Comput., 16:97-99, 1987.
11. A. Borodin, M. J. Fischer, D. G. Kirkpatrick, N. A. Lynch, and M. Tompa. A time-space tradeoff for sorting on non-oblivious machines. J. Comput. Sys. Sci., 22:351-364, 1981.
12. A. Chakrabarti, T. S. Jayram, and M. Pǎtraşcu. Tight lower bounds for selection in randomly ordered streams. In Proc. 19th ACM-SIAM Sympos. Discrete Algorithms, pages 720-729, 2008.
13. A. Chakrabarti, G. Cormode, and A. McGregor. Robust lower bounds for communication and stream computation. In Proc. 40th ACM Sympos. Theory Comput., pages 641-650, 2008.
14. T. M. Chan and E. Y. Chen. Multi-pass geometric algorithms. Discrete Comput. Geom., 37:79-102, 2007.
15. A. Cobham. The recognition problem for the set of perfect squares. In Proc. 7th IEEE Sympos. Found. Comput. Sci., pages 78-87, 1966.
16. W. Cunto and J. I. Munro. Average case selection. J. ACM, 36:270-279, 1989.
17. D. Dor and U. Zwick. Selecting the median. SIAM J. Comput., 28:1722-1758, 1999.
18. D. Dor and U. Zwick. Median selection requires (2+ε)n comparisons. SIAM J. Discrete Math., 14:312-325, 2001.
19. R. W. Floyd and R. L. Rivest. Expected time bounds for selection. Commun. ACM, 18:165-173, 1975.
20. G. N. Frederickson. Upper bounds for time-space trade-offs in sorting and selection. J. Comput. Sys. Sci., 34:19-26, 1987.
21. S. Guha and A. McGregor. Lower bounds for quantile estimation in random-order and multi-pass streaming. In Proc. 34th Int. Colloq. Automata, Languages, and Programming, Lect. Notes Comput. Si., vol.4596, Springer-Verlag, pages 704-715, 2007.
22. T. W. Lai and D. Wood. Implicit selection. In Proc. 1st Scand. Workshop Algorithm Theory, Lect. Notes Comput. Sci., vol.318, Springer-Verlag, pages 14-23, 1988.
23. R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.
24. J. I. Munro and M. S. Paterson. Selection and sorting with limited storage. Theoret. Comput. Sci., 12:315-323, 1980. Preliminary version in FOCS 1978.
25. J. I. Munro and V. Raman. Selection from read-only memory and sorting with minimum data movement. Theoret Comput. Sci., 165:311-323, 1996. Preliminary version in FCTTCS 1992.
26. J. Pagter and T. Rauhe. Optimal time-space tradeoffs for sorting. In Proc. 39th IEEE Sympos. Found. Comput Sci., pages 264-268, 1998.
27. V. Raman and S. Ramnath. Improved upper bounds for time-space trade-offs for selection. Nord. J. Comput., 6:162-180, 1999.
28. A. Schönhage, M. Paterson, and N. Pippenger. Finding the median. J. Comput. Sys. Sci., 13:184-199, 1976.
29. A. C.-C. Yao. Near-optimal time-space tradeoff for element distinctness. SIAM J. Comput., 23:966-975, 1994.