Lower bounds for dynamic transitive closure, planar point location, and parentheses matching

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

Volumn 1097, Issue , 1996, Pages 198-211

  Husfeldt, Thore ^a   Rauhe, Theis ^a   Skyum, Søren ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DYCK LANGUAGE; DYNAMIC MEMBERSHIP; DYNAMIC PROBLEM; PLANAR POINT LOCATION; RANDOM ACCESS; SIGNED PREFIXES; TRANSITIVE CLOSURE; WORD PROBLEM;

QUERY PROCESSING;

EID: 84947932501     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_132     Document Type: Conference Paper

References (19)

1. Arne Andersson. Sublogarithmic searching without multiplications. In Proc. 36th FOCS, pages 655-663. IEEE Computer Society, 1995.
2. Arne Andersson, Torben Hagerup, Stefan Nilsson, and Rajeev Raman. Sorting in linear time? In Proc 27thSTOC, pages 427-436, 1995.
3. Paul Beame and Faith Fich, 1994. Personal communication, reported by Peter Bro Miltersen.
4. Yi-Jen Chiang and Roberto Tamassia. Dynamic algorithms in Computational Geometry. Technical Report CS-91-24, Dept, of Comp. Sc., Brown University, 1991.
5. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Available via anonymous ftp from wilma.cs.brown.eduin/pub/papers/compgeo/gdbiblio.ps.Z, 1994.
6. Paul F. Dietz. Optimal algorithms for list indexing and subset rank. In Proc. First Workshop on Algorithms and Data Structures (WADS), volume 382 of Lecture Notes in Computer Science, pages 39-46. Springer Verlag, Berlin, 1989.
7. Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, and Søren Skyum. Dynamic algorithms for the Dyck languages. In Proc. 4th, WADS, volume 955 of Lecture Notes in Computer Science, pages 98-108. Springer, 1995.
8. Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, and Sven Skyum. Dynamic word problems. In Proc 34th FOCS, pages 470-479, 1993.
9. Michael L. Fredman and Monika Rauch Henzinger. Lower bounds for fully dynamic connectivity problems in graphs. Manuscript, preliminary version in STOC 94.
10. Michael L. Fredman and Michael E. Saks. The cell probe complexity of dynamic data structures. In Proc. 21st STOC, pages 345-354, 1989.
11. Michael A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, 1978.
12. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia. Complexity models for incremental computation. Theoretical Computer Science, 130:203-236, 1994.
13. Peter Bro Miltersen. Lower bounds for union-split-find related problems on random access machines. In Proc. 26th STOC, pages 625-634. ACM, 1994.
14. Peter Bro Miltersen, Noam Nisan, Shmuel Safra, and Avi Wigderson. On data structures and asymmetric communication complexity. In Proc. 27th STOC, pages 103-111. ACM, 1995.
15. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
16. Franco P. Prepaxata and Roberto Tamassia. Fully dynamic point location in a monotone subdivision. SIAM Journal of Computing, 18(4):811-830, 1989.
17. Roberto Tamassia and Franco P. Preparata. Dynamic maintenance of planar digraphs, with applications. Algorithmica, 5:509-527, 1990.
18. Mikkel Thorup. On RAM priority queue. In Proc 7th Ann. Symp. on Discrete Algorithms (SODA), pages 59-67, 1996.
19. Andrew Chi-Chih Yao. Should tables be sorted? Journal of the ACM, 28(3):615-628, July 1981.