|
9
|
Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations
– Gabriel Nivasch
- 2009
|
|
3
|
Dynamic Optimality for Skip Lists and B-Trees
– Prosenjit Bose, Karim Douïeb, Stefan Langerman
- 2008
|
|
2
|
Degrees of Nonlinearity in Forbidden 0-1 Matrix Problems
– Seth Pettie
|
|
1
|
Queaps
– John Iacono, Stefan Langerman
- 2002
|
|
4
|
Extremal problems for ordered (hyper) graphs: applications of Davenport–Schinzel sequences
– Martin Klazar
|
|
2
|
Generalized Davenport-Schinzel Sequences and Their 0-1 Matrix Counterparts
– S. Pettie
- 2010
|
|
7
|
Combinatorial Aspects of Davenport-Schinzel Sequences
– Martin Klazar
- 1995
|
|
370
|
Davenport-Schinzel Sequences and Their Geometric Applications
– Pankaj K. Agarwal , Micha Sharir
- 1998
|
|
11
|
Generalized Davenport-Schinzel sequences: results, problems, and applications
– Martin Klazar
- 1994
|
|
10
|
Towards a Final Analysis of Pairing Heaps
– Seth Pettie
- 2005
|
|
1
|
Parameterized Analysis of Paging and List Update Algorithms
– Reza Dorrigiv, Martin R. Ehmsen, Alejandro López-Ortiz
|
|
16
|
Self-Organizing Data Structures
– Susanne Albers, Jeffery Westbrook
- 1998
|
|
2
|
New Bounds on Optimal Binary Search Trees
– Dion Harmon, Erik Demaine, Rodolfo Ruben Rosales, Pavel I. Etingof, Dion Harmon
- 2006
|
|
8
|
Dynamic Optimality–Almost
– Erik D. Demaine, Dion Harmon, John Iacono
|
|
2
|
Forbidden submatrices in 0-1 matrices
– Balázs Keszegh
- 2005
|
|
|
On the Structure and Composition of Forbidden Sequences, with Geometric Applications ∗
– Seth Pettie
- 2010
|
|
|
Finger Search on Balanced Search Trees
– Maverick Woo
- 2006
|
|
5
|
Pairing heaps with O(log log n) decrease cost
– Amr Elmasry
- 2009
|
|
3
|
Skip-Splay: Toward Achieving the Unified Bound in the BST Model
– Jonathan C. Derryberry, Daniel D. Sleator
|
