| Publication | Date of Publication | Type |
|---|
Searching rigid data structures
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| Linear-time in-place selection in less than 3n comparisons | 2023-03-21 | Paper |
| Heap construction: Optimal in both worst and average cases? | 2023-03-21 | Paper |
Computing a shortest watchman path in a simple polygon in polynomial-time
Lecture Notes in Computer Science | 2022-12-16 | Paper |
In-place linear probing sort
STACS 92 | 2022-08-18 | Paper |
| scientific article; zbMATH DE number 2185599 (Why is no real title available?) | 2005-07-04 | Paper |
ONLINE ROUTING IN CONVEX SUBDIVISIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2080234 (Why is no real title available?) | 2004-08-04 | Paper |
| Worst case constant time priority queue | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1555945 (Why is no real title available?) | 2001-01-24 | Paper |
Finding the shortest watchman route in a simple polygon
Discrete & Computational Geometry | 1999-11-23 | Paper |
Computing vision points in polygons
Algorithmica | 1999-06-29 | Paper |
Heaps with bits
Theoretical Computer Science | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 742986 (Why is no real title available?) | 1995-04-11 | Paper |
| scientific article; zbMATH DE number 432806 (Why is no real title available?) | 1993-10-20 | Paper |
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
International Journal of Computational Geometry & Applications | 1993-08-22 | Paper |
Sublinear merging and natural mergesort
Algorithmica | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177562 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176513 (Why is no real title available?) | 1993-05-18 | Paper |
A general approach to dominance in the plane
Journal of Algorithms | 1992-06-28 | Paper |
An optimal parallel adaptive sorting algorithm
Information Processing Letters | 1992-06-27 | Paper |
On partitions and presortedness of sequences
Acta Informatica | 1992-01-01 | Paper |
An optimal algorithm for deleting the root of a heap
Information Processing Letters | 1991-01-01 | Paper |
A note on the construction of the data structure ``deap
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4062572 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4062609 (Why is no real title available?) | 1988-01-01 | Paper |
Average-case results on heapsort
BIT | 1987-01-01 | Paper |
A variant of heapsort with almost optimal number of comparisons
Information Processing Letters | 1987-01-01 | Paper |
Improving worst-case behavior of heaps
BIT | 1984-01-01 | Paper |
