Range mode and range median queries in constant time and sub-quadratic space

Information Processing Letters

Volumn 109, Issue 4, 2009, Pages 225-228

  Petersen, Holger ^a   Grabowski, Szymon ^b  

^a UNIVERSITY OF STUTTGART   (Germany)

^b LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Algorithms; Computational complexity; Theory of computation

Indexed keywords

FUNCTIONS; PROBABILITY DENSITY FUNCTION; QUERY LANGUAGES;

ARBITRARY CONSTANTS; CONSTANT TIMES; RANGE MEDIANS; RANGE MODES; SPACE BOUNDS; THEORY OF COMPUTATION;

COMPUTATIONAL COMPLEXITY;

EID: 57749083327     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.10.007     Document Type: Article

References (8)

1. Bender M.A., Farach-Colton M., Pemmasani G., Skiena S., and Sumazin P. Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms 57 (2005) 75-94
2. Bose P., Kranakis E., Morin P., and Tang Y. Approximate range mode and range median queries. Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS 2005). Stuttgart (Germany). LNCS vol. 3404 (2005) 377-388
3. Berkman O., and Vishkin U. Recursive star-tree parallel data structure. SIAM J. Comput. 22 (1993) 221-242
4. Gabow H.N., Bentley J.L., and Tarjan R.E. Scaling and related techniques for geometry problems. Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing (STOC 84) (1984), ACM Press, New York 135-143
5. Har-Peled S., and Muthukrishnan S. Range medians. In: Halperin D., and Mehlhorn K. (Eds). Algorithms-ESA 2008, 16th Annual European Symposium. LNCS vol. 5193 (2008) 503-514
6. Harel D., and Tarjan R.E. Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13 (1984) 338-355
7. Krizanc D., Morin P., and Smid M. Range mode and range median queries on lists and trees. Nordic J. Comput. 12 (2005) 1-17
8. Petersen H. Improved bounds for range mode and range median queries. Proceedings of the 34th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2008). LNCS vol. 4910 (2008) 418-423