|
27
|
Cell Probe Complexity - a Survey
– Peter Bro Miltersen
- 1999
|
|
|
Computational Complexity of Dynamic Problems
– Thore Husfeldt
|
|
2
|
Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink
– Thore Husfeldt
- 1994
|
|
12
|
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching
– Thore Husfeldt, Theis Rauhe, Søren Skyum
- 1996
|
|
16
|
Tight bounds for the partial-sums problem
– Scu Erik D. Demaine
- 2004
|
|
45
|
Marked Ancestor Problems
– Stephen Alstrup, Thore Husfeldt, Theis Rauhe
- 1998
|
|
9
|
New Lower Bound Techniques For Dynamic Partial Sums and Related Problems
– Thore Husfeldt, Theis Rauhe
- 2003
|
|
1
|
Lower Bound Techniques for Data Structures
– Mihai Patrascu
- 2008
|
|
7
|
Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method
– Thore Husfeldt, Theis Rauhe
- 1998
|
|
39
|
Complexity Models for Incremental Computation
– Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia
- 1994
|
|
2
|
On dynamic bit-probe complexity
– Mihai Pǎtrascu, Corina E. Tarnitǎ
- 2005
|
|
41
|
Lower bounds for Union-Split-Find related problems on random access machines
– Peter Bro Miltersen
- 1994
|
|
1
|
Dynamic Computation
– Thore Husfeldt, Thore Husfeldt, Thore Husfeldt
- 1997
|
|
5
|
On Searching Sorted Lists: A Near-Optimal Lower Bound
– Paul Beame, Faith Fich
- 1997
|
|
11
|
Lower bounds for dynamic connectivity
– Erik D. Demaine
- 2004
|
|
17
|
Optimal Biweighted Binary Trees And The Complexity Of Maintaining Partial Sums
– Haripriyan Hampapuram, Michael, Michael L. Fredman, Siam J. Comput C
- 1998
|
|
23
|
Logarithmic lower bounds in the cell-probe model
– Erik, D. Demaine
- 2006
|
|
49
|
Are bitvectors optimal?
– H. Buhrman, P. B. Miltersen, J. Radhakrishnan, S. Venkatesh
|
|
5
|
Lower Bounds for Dynamic Algebraic Problems
– Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen
- 1999
|
