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

Active Bibliography

29 Cell probe complexity - a survey – Peter Bro Miltersen
Computational Complexity of Dynamic Problems – Thore Husfeldt
2 Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink – Thore Husfeldt - 1994
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
1 Lower Bound Techniques for Data Structures – Mihai Patrascu - 2008
8 New Lower Bound Techniques For Dynamic Partial Sums and Related Problems – Thore Husfeldt, Theis Rauhe - 2003
9 Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method – Thore Husfeldt, Theis Rauhe - 1998
43 Complexity Models for Incremental Computation – Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia - 1994
1 Dynamic Computation – Thore Husfeldt, Thore Husfeldt, Thore Husfeldt - 1997
2 On dynamic bit-probe complexity – Mihai Pǎtrascu, Corina E. Tarnitǎ - 2005
49 Lower bounds for Union-Split-Find related problems on random access machines – Peter Bro Miltersen - 1994
5 On Searching Sorted Lists: A Near-Optimal Lower Bound – Paul Beame, Faith Fich - 1997
16 Optimal Biweighted Binary Trees And The Complexity Of Maintaining Partial Sums – Haripriyan Hampapuram, Michael, Michael L. Fredman, Siam J. Comput C - 1998
15 Lower bounds for dynamic connectivity – Erik D. Demaine - 2004
34 Logarithmic lower bounds in the cell-probe model – Erik, D. Demaine
Models and Techniques for Proving Data Structure Lower Bounds – Kasper Green Larsen - 2013
57 Are bitvectors optimal? – H. Buhrman, P. B. Miltersen, J. Radhakrishnan, S. Venkatesh
1 k-Valued Link Grammars are Learnable from – Gerald Penn (ed, Denis Béchet - 2003