Cell probe lower bounds and approximations for range mode

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

Volumn 6198 LNCS, Issue PART 1, 2010, Pages 605-616

  Greve, Mark ^a   Jørgensen, Allan Grønlund ^a   Larsen, Kasper Dalgaard ^a   Truelsen, Jakob ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

3D ORTHOGONAL; CELL PROBES; CONSTANT TIME; LINEAR SPACES; LOWER BOUNDS; MEMORY CELL; MULTISET; RANGE MODE; RANGE QUERY; SUBARRAY;

DATA STRUCTURES; LABELS; LINGUISTICS; TRANSLATION (LANGUAGES);

QUERY LANGUAGES;

EID: 77955320846     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14165-2_51     Document Type: Conference Paper

References (15)

1. Yao, A. C. C.: Should tables be sorted? J. ACM 28 (3), 615-628 (1981)
2. Krizanc, D., Morin, P., Smid, M. H. M.: Range mode and range median queries on lists and trees. Nord. J. Comput. 12 (1), 1-17 (2005)
3. Petersen, H.: Improved bounds for range mode and range median queries. In: Geffert, V., Karhumäki, J., Bertoni, A., Preneel, B., Návrat, P., Bieliková, M. (eds.) SOFSEM 2008. LNCS, vol. 4910, pp. 418-423. Springer, Heidelberg (2008)
4. Petersen, H., Grabowski, S.: Range mode and range median queries in constant time and sub-quadratic space. Inf. Process. Lett. 109 (4), 225-228 (2008)
5. Bose, P., Kranakis, E., Morin, P., Tang, Y.: Approximate range mode and range median queries. In: Proc. 22nd Symposium on Theoretical Aspects of Computer Science, pp. 377-388 (2005)
6. Patrascu, M., Thorup, M.: Higher lower bounds for near-neighbor and further rich problems. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 646-654 (2006)
7. Pǎtraşcu, M.: (Data) structures. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 434-443 (2008)
8. Pǎtraşcu, M.: Lower bounds for 2-dimensional range counting. In: Proc. 39th ACM Symposium on Theory of Computing, pp. 40-46 (2007)
9. JáJá, J., Mortensen, C. W., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 558-568. Springer, Heidelberg (2004)
10. Afshani, P.: On dominance reporting in 3D. In: Proc. of the 16th Annual European Symposium on Algorithms, pp. 41-51 (2008)
11. Willard, D. E.: Log-logarithmic worst-case range queries are possible in space theta (n). Inf. Process. Lett. 17 (2), 81-84 (1983)
12. Miltersen, P. B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. J. Comput. Syst. Sci. 57 (1), 37-49 (1998)
13. Harel, D., Tarjan, R. E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13 (2), 338-355 (1984)
14. Driscoll, J. R., Sarnak, N., Sleator, D. D., Tarjan, R. E.: Making data structures persistent. Journal of Computer and System Sciences 38 (1), 86-124 (1989)
15. Jacobson, G. J.: Succinct static data structures. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA (1988)