Dynamic Algorithms for the Dyck Languages (1995)

by Gudmund Skovbjerg Frandsen , Thore Husfeldt , Peter Bro Miltersen , Theis Rauhe , Søren Skyum
Venue:IN PROC. 4TH WORKSHOP ON ALGORITHMS AND DATA STRUCTURES (WADS
Citations:12 - 9 self

Documents Related by Co-Citation

149 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
19 Dynamic Word Problems – Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum - 1993
11 Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching – Thore Husfeldt, Theis Rauhe, Søren Skyum - 1996
52 Marked Ancestor Problems – Stephen Alstrup, Thore Husfeldt, Theis Rauhe - 1998
9 Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method – Thore Husfeldt, Theis Rauhe - 1998
128 The cell probe complexity of dynamic data structures – M L Fredman, M E Saks - 1989
2452 The Design and Analysis of Computer Algorithms – A V Aho, J E Hopcroft, J D Ullman - 1974
151 linear-time algorithm for a special case of disjoint set union – H N Gabow, A R E Tarjan - 1983
43 Complexity Models for Incremental Computation – Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia - 1994
49 Lower bounds for Union-Split-Find related problems on random access machines – Peter Bro Miltersen - 1994
138 Should tables be sorted – Andrew Chi-chih Yao - 1981
52 A lower bound for finding predecessors in Yao’s cell probe model – M Ajtai - 1988
85 On Data Structures and Asymmetric Communication Complexity – Peter Bro Miltersen, Shmuel Safra, Noam Nisan, Avi Wigderson - 1994
41 The complexity of maintaining an array and computing its partial sums – M L Fredman - 1982
36 Optimal algorithms for list indexing and subset rank – P F Dietz - 1989
29 Cell probe complexity - a survey – Peter Bro Miltersen
42 On the complexity of maintaining partial sums – Andrew Yao - 1985
90 Maintaining order in a linked list – Paul F Dietz - 1982
5 Dynamic Connectivity in Digital Images – David Eppstein - 1996