| Publication | Date of Publication | Type |
|---|
| On range summary queries | 2024-11-14 | Paper |
| Lower bounds for intersection reporting among flat objects | 2024-10-16 | Paper |
| Hierarchical categories in colored searching | 2024-09-11 | Paper |
| Hierarchical categories in colored searching | 2024-07-23 | Paper |
| An optimal lower bound for simplex range reporting | 2024-05-14 | Paper |
| On cyclic solutions to the min-max latency multi-robot patrolling problem | 2024-05-14 | Paper |
| On semialgebraic range reporting | 2024-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147389 | 2024-01-15 | Paper |
| On semialgebraic range reporting | 2024-01-09 | Paper |
| Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions | 2023-06-20 | Paper |
| Lower Bounds for Multiplication via Network Coding | 2022-07-21 | Paper |
| A New Lower Bound for Semigroup Orthogonal Range Searching | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088929 | 2022-07-18 | Paper |
| Fragile complexity of comparison-based algorithms | 2022-05-11 | Paper |
| A Lower Bound for Jumbled Indexing | 2021-02-02 | Paper |
| Permuting and Batched Geometric Lower Bounds in the I/O Model | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111686 | 2020-05-27 | Paper |
| An Efficient Algorithm for the 1D Total Visibility-Index Problem | 2019-09-12 | Paper |
| Optimal Deterministic Shallow Cuttings for 3D Dominance Ranges | 2019-06-20 | Paper |
| Concurrent Range Reporting in Two-Dimensional Space | 2019-06-20 | Paper |
| Fast Computation of Output-Sensitive Maxima in a Word RAM | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633824 | 2019-05-06 | Paper |
| The query complexity of a permutation-based variant of mastermind | 2019-05-03 | Paper |
| Optimal deterministic shallow cuttings for 3-d dominance ranges | 2019-01-11 | Paper |
| An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization | 2018-11-20 | Paper |
| Instance-Optimal Geometric Algorithms | 2018-08-02 | Paper |
| Cross-Referenced Dictionaries and the Limits of Write Optimization | 2018-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4607940 | 2018-03-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3132896 | 2018-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4598234 | 2017-12-19 | Paper |
| A general approach for cache-oblivious range reporting and approximate range counting | 2017-10-20 | Paper |
| Cache-oblivious range reporting with optimal queries requires superlinear space | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365152 | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365050 | 2017-09-29 | Paper |
| Sorting and Permuting without Bank Conflicts on GPUs | 2015-11-19 | Paper |
| Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls | 2015-09-30 | Paper |
| I/O-Efficient Range Minima Queries | 2014-09-02 | Paper |
| Improved pointer machine and I/O lower bounds for simplex range reporting and related problems | 2014-08-11 | Paper |
| Improved pointer machine and I/O lower bounds for simplex range reporting and related problems | 2014-08-07 | Paper |
| Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model | 2014-08-07 | Paper |
| Orthogonal Range Reporting in Three and Higher Dimensions | 2014-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5171169 | 2014-07-25 | Paper |
| Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM | 2014-07-01 | Paper |
| Orthogonal range reporting | 2014-04-03 | Paper |
| The Query Complexity of Finding a Hidden Permutation | 2013-09-13 | Paper |
| (Approximate) uncertain skylines | 2013-08-23 | Paper |
| Lower Bounds for Sorted Geometric Queries in the I/O Model | 2012-09-25 | Paper |
| Cache-oblivious range reporting with optimal queries requires superlinear space | 2011-06-03 | Paper |
| A general approach for cache-oblivious range reporting and approximate range counting | 2010-09-02 | Paper |
| Approximation and inapproximability results for maximum clique of disc graphs in high dimensions | 2010-03-24 | Paper |
| On approximate range counting and depth | 2009-07-06 | Paper |
| Dynamic connectivity for axis-parallel rectangles | 2009-05-06 | Paper |
| On the Complexity of Finding an Unknown Cut Via Vertex Queries | 2009-03-06 | Paper |
| On approximate range counting and depth | 2009-02-12 | Paper |
| On Dominance Reporting in 3D | 2008-11-25 | Paper |
| Dynamic Connectivity for Axis-Parallel Rectangles | 2008-03-11 | Paper |
| Circular chromatic index of graphs of maximum degree 3 | 2005-08-29 | Paper |
| On the spectrum of the forced matching number of graphs | 2004-10-15 | Paper |
