Range medians

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5193 LNCS, Issue , 2008, Pages 503-514

  Har Peled, Sariel ^a   Muthukrishnan, S ^b  

^a University of Illinois ^*  (United States)

^b GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

LOWER BOUNDS; RANGE MEDIAN;

ARTIFICIAL INTELLIGENCE;

EID: 57749083049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87744-8_42     Document Type: Conference Paper

References (15)

1. [AY89] Altman, T., Yoshihide, I.: Roughly sorting: Sequential and parallel approach. Journal of Information Processing 12(2), 154-158 (1989)
2. [BFC04] Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. Theo. Comp. Sci. 321(1), 5-12 (2004)
3. [BFP+73] Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Sys. Sci. 7(4), 448-461 (1973)
4. [BJ85] Bent, S.W., John, J.W.: Finding the median requires 2n comparisons. In: Proc. 17th Annu. ACM Sympos. Theory Comput., pp. 213-216 (1985)
5. [BKMT05] Bose, P., Kranakis, E., Morin, P., Tang, Y.: Approximate range mode and range median queries. In: Proc. 22nd Internat. Sympos. Theoret. Asp. Comp. Sci., pp. 377-388 (2005)
6. [DZ99] Dor, D., Zwiek, U.: Selecting the median. SIAM J. Comput. 28(5), 1722-1758 (1999)
7. [DZ01] Dor, D., Zwick, U.: Median selection requires (2 + ε)n comparisons. SIAM J. Discret. Math. 14(3), 312-325 (2001)
8. [GK01] Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: Proc. 2001 ACM SIGOD Conf. Mang. Data, pp. 58-66 (2001)
9. [GK04] Greenwald, M., Khanna, S.: Power-conserving computation of order-statistics over sensor networks. In: Proc. 23rd ACM Sympos. Principles Database Syst., pp. 275-285 (2004)
10. [KMS05] Krizanc, D., Morin, P., Smid, M.: Range mode and range median queries on lists and trees. Nordic J. Comput, 12(1), 1-17 (2005)
11. [KMZ03] Korn, F., Muthukrishnan, S., Zhu, Y.: Checks and balances: Monitoring data quality problems in network traffic databases. In: Proc. 29th Intl. Conf. Very Large Data Bases, pp. 536-547 (2003)
12. [MR95] Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
13. [SPP76] Schönhage, A., Paterson, M., Pippenger, N.: Finding the median. J. Comput. Sys. Sci. 13(2), 184-199 (1976)
14. [Yao82] Yao, A.C.: Space-time tradeoff for answering range queries. In: Proc. 14th Annu. ACM Sympos. Theory Comput., pp. 128-136 (1982)
15. [Yao85] Yao, A.C.: On the complexity of maintaining partial sums. SIAM J. Comput, 14(2), 277-288 (1985)