| Publication | Date of Publication | Type |
|---|
| Optimal offline ORAM with perfect security via simple oblivious priority queues | 2026-06-08 | Paper |
Adaptive approximation of persistent homology
Journal of Applied and Computational Topology | 2025-01-22 | Paper |
Klee's measure problem made oblivious
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
| Approximate shortest distances among smooth obstacles in 3D | 2020-01-13 | Paper |
| Approximate shortest distances among smooth obstacles in 3D | 2018-04-19 | Paper |
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Terracost: computing least-cost-path surfaces for massive grid terrains
ACM Journal of Experimental Algorithmics | 2017-06-15 | Paper |
| Subquadratic medial-axis approximation in \(\mathbb{R}^3\) | 2017-03-30 | Paper |
Approximating geodesic distances on 2-manifolds in \(\mathbb{R}^3\): The weighted case
Computational Geometry | 2014-06-27 | Paper |
Approximating geodesic distances on 2-manifolds in image R^3
Computational Geometry | 2014-01-22 | Paper |
Resilient \(k\)-d trees: \(k\)-means in space revisited
Frontiers of Computer Science | 2012-11-15 | Paper |
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
Journal of Discrete Algorithms | 2010-08-18 | Paper |
In-place algorithms for computing (Layers of) maxima
Algorithmica | 2010-03-04 | Paper |
An in-place algorithm for Klee's measure problem in two dimensions
Information Processing Letters | 2010-01-29 | Paper |
I/O-Efficiently Pruning Dense Spanners
Discrete and Computational Geometry | 2008-03-18 | Paper |
Line-segment intersection made in-place
Computational Geometry | 2007-10-12 | Paper |
In-Place Algorithms for Computing (Layers of) Maxima
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry | 2007-06-04 | Paper |
In-Place Randomized Slope Selection
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Planar point location for large data sets
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
I/O-efficient dynamic planar point location
Computational Geometry | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 1984683 (Why is no real title available?) | 2003-09-22 | Paper |
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry | 2003-03-10 | Paper |
| scientific article; zbMATH DE number 1830721 (Why is no real title available?) | 2002-11-18 | Paper |
Efficient bulk operations on dynamic \(R\)-trees
Algorithmica | 2002-06-17 | Paper |
| scientific article; zbMATH DE number 1452526 (Why is no real title available?) | 2000-05-25 | Paper |
