Towards optimal range medians

Theoretical Computer Science

Volumn 412, Issue 24, 2011, Pages 2588-2601

  Brodal, Gerth Stølting ^a   Gfeller, Beat ^b   Jørgensen, Allan Grønlund ^a   Sanders, Peter ^c  

^a AARHUS UNIVERSITY   (Denmark)

^b IBM RESEARCH ZURICH   (Switzerland)

^c UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Algorithms; Data structures; Medians; Range queries

Indexed keywords

COMPARISON MODELS; FOLLOWING PROBLEM; HIGHER-DIMENSIONAL; LOWER BOUNDS; MEDIANS; OPTIMAL RANGES; POINTER MACHINES; PROBE-MODEL; QUERY TIME; RAM MODEL; RANGE MEDIAN; RANGE QUERIES; SIMPLE ALGORITHM; SPACE COMPLEXITY; SPACE DATA STRUCTURES; SUB-ARRAYS;

ALGORITHMS; DATA STRUCTURES;

QUERY PROCESSING;

EID: 79954878345     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.05.003     Document Type: Conference Paper

References (29)

1. Stephen Alstrup, Thore Husfeldt, and Theis Rauhe Marked ancestor problems Proc. 39th Annual Symposium on Foundations of Computer Science 1998 IEEE Computer Society Washington, DC, USA 534 543
2. Lars Arge, and Jeffrey Scott Vitter Optimal external memory interval management SIAM Journal on Computing 32 6 2003 1488 1508
3. Paul Beame, and Faith E. Fich Optimal bounds for the predecessor problem and related problems Journal of Computer and System Sciences 65 1 2002 38 72
4. Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan, Linear time bounds for median computations, in: 4th Annual Symp. on Theory of Computing, STOC, 1972, pp. 119124.
5. Gerth Stølting Brodal, and Allan Grønlund Jørgensen Data structures for range median queries Proc. 20th Annual International Symposium on Algorithms and Computation LNCS vol. 5878 2009 Springer Verlag Berlin
6. Bernard Chazelle, and Leonidas J. Guibas Fractional cascading: I. A data structuring technique Algorithmica 1 1986 133 162 (Pubitemid 17556682)
7. David R. Clark, Compact Pat Trees. Ph.D. Thesis, University of Waterloo, 1988.
8. David Cline, Kenric B. White, and Parris K. Egbert Fast 8-bit median filtering based on separability IEEE International Conference on Image Processing (ICIP) 5 2007 281 284
9. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf Computational Geometry Algorithms and Applications 2nd ed. 2000 Springer-Verlag
10. Harold N. Gabow, Jon L. Bentley, and Robert E. Tarjan Scaling and related techniques for geometry problems Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing STOC 1984 ACM New York, NY, USA 135 143
11. Beat Gfeller, and Peter Sanders Towards optimal range medians 36th International Colloquium on Automata, Languages and Programming ICALP LNCS vol. 5555 2009 Springer 475 486
12. Joseph Gil, and Michael Werman Computing 2-d min, median, and max filters Pattern Analysis and Machine Intelligence, IEEE Transactions on 15 5 1993 504 507
13. Sariel Har-Peled, and S. Muthukrishnan Range medians 16th Annual European Symp. on Algorithms ESA LNCS vol. 5193 2008 Springer 503 514
14. Joseph JJ, Christian Worm Mortensen, and Qingmin Shi Space-efficient and fast algorithms for multidimensional dominance reporting and counting 19th International Symp. on Algorithms and Computation ISAAC LNCS vol. 3341 2004 Springer 558 568 (Pubitemid 39745107)
15. Richard M. Karp, Rajeev Motwani, and Prabhakar Raghavan Deferred data structuring SIAM Journal on Computing 17 5 1988 883 902
16. Danny Krizanc, Pat Morin, and Michiel H.M. Smid Range mode and range median queries on lists and trees Nordic Journal of Computing 12 1 2005 1 17
17. Yakov Nekrich Orthogonal range searching in linear and almost-linear space Computational Geometry 42 4 2009 342 351
18. Jrg Nievergelt, and Edward M. Reingold Binary search trees of bounded balance 4th Annual Symposium on Theory of Computing STOC 1972 ACM 137 142
19. Daisuke Okanohara, Kunihiko Sadakane, Practical entropy-compressed rank/select dictionary. The Computing Research Repository, CoRR, abs/cs/0610001, 2006.
20. Mihai Patracu Lower bounds for 2-dimensional range counting Proc. 39th ACM Symposium on Theory of Computing 2007 40 46
21. Mihai Patracu, (Data) structures, in: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 434443.
22. Holger Petersen, Improved bounds for range mode and range median queries, in: 34th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM, 2008, pp. 418423. (Pubitemid 351154034)
23. Holger Petersen, and Szymon Grabowski Range mode and range median queries in constant time and sub-quadratic space Information Processing Letters 109 4 2009 225 228
24. Simon Perreault, and Patrick Hbert Median filtering in constant time IEEE Transactions on Image Processing 16 9 2007 2389 2394 (Pubitemid 47316685)
25. Peter van Emde Boas, R. Kaas, and E. Zijlstra Design and implementation of an efficient priority queue Mathematical Systems Theory 10 1977 99 127
26. Peter J. Varman, Scott D. Scheufler, Balakrishna R. Iyer, and Gary R. Ricard Merging multiple lists on hierarchical-memory multiprocessors Jorunal of Parallel and Distributed Computing 12 2 1991 171 177
27. Ben Weiss Fast median and bilateral filtering ACM Transactions on Graphics 25 3 2006 519 526
28. Andrew Chi-Chih Yao, Spacetime tradeoff for answering range queries (extended abstract), in: 14th Annual Symposium on Theory of Computing, STOC, 1982, pp. 128136.
29. Andrew Chi-Chih Yao On the complexity of maintaining partial sums SIAM Journal on Computing 14 2 1985 277 288