| Compact Labeling Scheme for Ancestor Queries | 98 | 4.40 | 2006 |
| Union-Find with Constant Time Deletions | 4 | 0.42 | 2005 |
| Labeling Schemes for Small Distances in Trees | 37 | 1.15 | 2005 |
| Black box for constant-time insertion in priority queues (note) | 9 | 0.53 | 2005 |
| Dynamic nested brackets | 0 | 0.34 | 2004 |
| Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment | 23 | 0.82 | 2004 |
| New Lower Bound Techniques for Dynamic Partial Sums and Related Problems | 9 | 0.59 | 2003 |
| Improved Labeling Scheme for Ancestor Queries | 50 | 2.57 | 2002 |
| Time and Space Efficient Multi-method Dispatching | 3 | 0.39 | 2002 |
| Nearest common ancestors: a survey and a new distributed algorithm | 50 | 2.42 | 2002 |
| A cell probe lower bound for dynamic nearest-neighbor searching | 2 | 0.40 | 2001 |
| Optimal static range reporting in one dimension | 30 | 1.08 | 2001 |
| Pattern matching in dynamic texts | 26 | 1.29 | 2000 |
| Worst-case and amortised optimality in union-find (extended abstract) | 7 | 0.53 | 1999 |
| Marked Ancestor Problems | 59 | 1.98 | 1998 |
| Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method | 9 | 0.68 | 1998 |
| Optimal Time-Space Trade-Offs for Sorting | 29 | 1.66 | 1998 |
| Algorithms for Guided Tree Automata | 25 | 1.97 | 1996 |
| Mona: Decidable Arithmetic in Practice | 8 | 0.92 | 1996 |
| Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parentheses Matching | 15 | 0.79 | 1996 |
| Dynamic Algorithms for the Dyck Languages | 7 | 0.57 | 1995 |
| Mona: Monadic Second-Order Logic in Practice | 161 | 9.62 | 1995 |
