| Online Routing in Convex Subdivisions. | 0 | 0.34 | 2002 |
| Worst case constant time priority queue | 13 | 1.35 | 2001 |
| Online Routing in Convex Subdivisions | 38 | 4.90 | 2000 |
| Resizable Arrays in Optimal Time and Space | 30 | 2.08 | 1999 |
| Computing Vision Points in Polygons | 7 | 0.49 | 1999 |
| An optimal distributed 3-edge-connected component algorithm | 0 | 0.34 | 1998 |
| A single-sex programme in computer science and engineering (poster) | 0 | 0.34 | 1997 |
| Small forwarding tables for fast routing lookups | 317 | 38.12 | 1997 |
| Heaps with bits | 6 | 0.63 | 1996 |
| Linear-time In-place Selection in Less than 3n Comparisons | 7 | 0.67 | 1995 |
| Heap Construction: Optimal in Both Worst and Average Cases? | 2 | 0.42 | 1995 |
| Searching Rigid Data Structures (Extended Abstract) | 0 | 0.34 | 1995 |
| Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time | 13 | 0.89 | 1995 |
| Some Lower Bounds for Comparison-Based Algorithms | 1 | 0.36 | 1994 |
| Finding the Shortest Watchman Route in a Simple Polygon | 29 | 2.66 | 1993 |
| Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons | 8 | 0.93 | 1993 |
| Maintaining Discrete Probability Distributions Optimally | 9 | 1.01 | 1993 |
| Guarding a Treasury | 3 | 0.48 | 1993 |
| Sublinear Merging and Natural Mergesort | 16 | 2.75 | 1993 |
| Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings | 55 | 9.06 | 1993 |
| A general approach to dominance in the plane | 9 | 0.79 | 1992 |
| The complexity of heaps | 0 | 0.34 | 1992 |
| Parallel Complexity of Heaps and Min-Max Heaps | 5 | 0.50 | 1992 |
| Parallel Constructions of Heaps and Min-Max Heaps | 1 | 0.35 | 1992 |
| On partitions and presortedness of sequences | 5 | 0.59 | 1992 |
| The complexity of heaps | 9 | 0.74 | 1992 |
| In-place Linear Probing Sort | 3 | 0.64 | 1992 |
| A new compacting garbage-collection algorithm with a good average-case performance | 0 | 0.34 | 1991 |
| An optimal parallel adaptive sorting algorithm | 3 | 0.51 | 1991 |
| Optimum Guard Covers And M-Watchmen Routes For Restricted Polygons | 12 | 0.92 | 1991 |
| An optimal algorithm for deleting the roof of a heap | 9 | 0.96 | 1991 |
| On Partitions and Presortedness of Sequences | 0 | 0.34 | 1991 |
| Sublinear merging and natural merge sort | 25 | 3.46 | 1990 |
| An extrapolation on the interpolation search | 0 | 0.34 | 1988 |
| An implicit binomial queue with constant insertion time | 27 | 1.63 | 1988 |
| The Deap—A double-ended heap to implement double-ended priority queues | 34 | 1.97 | 1987 |
| Average-case results on heapsort | 27 | 2.92 | 1987 |
| A variant of Heapsort with almost optimal number of comparisons | 34 | 3.24 | 1987 |
| Improving worst-case behavior of heaps | 7 | 1.45 | 1984 |
