A dynamic stabbing-max data structure with sub-logarithmic query time

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

Volumn 7074 LNCS, Issue , 2011, Pages 170-179

  Nekrich, Yakov ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

AMORTIZED TIME; DYNAMIC DATA STRUCTURE; INSERTIONS AND DELETIONS; LINEAR SPACES; QUERY TIME; SPACE DATA STRUCTURES;

ALGORITHMS; CONVOLUTIONAL CODES;

DATA STRUCTURES;

EID: 84055217343     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25591-5_19     Document Type: Conference Paper

References (24)

1. Agarwal, P.K., Arge, L., Yang, J., Yi, K.: I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 7-18. Springer, Heidelberg (2003)
2. Agarwal, P.K., Arge, L., Yi, K.: An Optimal Dynamic Interval Stabbing-Max Data Structure? In: Proc. SODA 2005, pp. 803-812 (2005)
3. Alstrup, S., Husfeldt, T., Rauhe, T.: Marked Ancestor Problems. In: Proc. FOCS 1998, pp. 534-544 (1998)
4. Arge, L., Vitter, J.S.: Optimal External Memory Interval Management. SIAM J. Comput. 32(6), 1488-1508 (2003)
5. Blelloch, G.E.: Space-Efficient Dynamic Orthogonal Point Location, Segment Intersection, and Range Reporting. In: Proc. SODA 2008, pp. 894-903 (2008)
6. Chazelle, B.: A Functional Approach to Data Structures and its Use in Multidimensional Searching. SIAM J. on Computing 17, 427-462 (1988)
7. Edelsbrunner, H.: A New Approach to Rectangle Intersections, part I. Int. J. Computer Mathematics 13, 209-219 (1983)
8. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and Implementation of an Efficient Priority Queue. Mathematical Systems Theory 10, 99-127 (1977)
9. Gupta, P., McKeown, N.: Dynamic Algorithms with Worst-Case Performance for Packet Classification. In: Pujolle, G., Perros, H.G., Fdida, S., Körner, U., Stavrakakis, I. (eds.) NETWORKING 2000. LNCS, vol. 1815, pp. 528-539. Springer, Heidelberg (2000)
10. Gupta, P., McKeown, N.: Algorithms for Packet Classification. IEEE Network 15(2), 24-32 (2001)
11. Feldmann, A., Muthukrishnan, S.: Tradeoffs for Packet Classification. In: Proc. INFOCOM 2000, pp. 1193-1202 (2000)
12. Fredman, M.L., Willard, D.E.: Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Syst. Sci. 48(3), 533-551 (1994)
13. Imai, H., Asano, T.: Dynamic Orthogonal Segment Intersection Search. Journal of Algorithms 8(1), 1-18 (1987)
14. Itai, A., Konheim, A.G., Rodeh, M.: A Sparse Table Implementation of Priority Queues. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 417-431. Springer, Heidelberg (1981)
15. Kaplan, H., Molad, E., Tarjan, R.E.: Dynamic Rectangular Intersection with Priorities. In: Proc. STOC 2003, pp. 639-648 (2003)
16. Nekrich, Y.: Orthogonal Range Searching in Linear and Almost-Linear Space. Comput. Geom. 42(4), 342-351 (2009)
17. Pǎ;traşcu, M., Demaine, E.D.: Tight Bounds for the Partial-Sums Problem. In: Proc. 15th SODA 2004, pp. 20-29 (2004)
18. Sahni, S., Kim, K.: O(log n) Dynamic Packet Routing. In: Proc. IEEE Symposium on Computers and Communications, pp. 443-448 (2002)
19. Sahni, S., Kim, K., Lu, H.: Data Structures for One-Dimensional Packet Classification Using Most Specific Rule Matching. In: Proc. ISPAN 2002, pp. 3-14 (2002)
20. Tarjan, R.E.: A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets. J. Comput. Syst. Sci. 18(2), 110-127 (1979)
21. Thorup, M.: Undirected Single-Source Shortest Paths with Positive IntegerWeights in Linear Time. J. ACM 46(3), 362-394 (1999)
22. Thorup, M.: Space Efficient Dynamic Stabbing with Fast Queries. In: Proc. STOC 2003, pp. 649-658 (2003)
23. Willard, D.E.: A Density Control Algorithm for Doing Insertions and Deletions in a Sequentially Ordered File in Good Worst-Case Time. Information and Computation 97, 150-204 (1992)
24. Yang, J., Widom, J.: Incremental Computation and Maintenance of Temporal Aggregates. In: Proc. IEEE Intl. Conf. on Data Engineering 2001, pp. 51-60 (2001)