| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6187022 | 2024-02-05 | Paper |
| Fractional cascading simplified | 2022-12-09 | Paper |
| Selection in monotone matrices and computing k th nearest neighbors | 2022-12-09 | Paper |
| Distribution-sensitive algorithms | 2022-12-09 | Paper |
| A unified approach to tail estimates for randomized incremental construction | 2022-07-18 | Paper |
| Design and Analysis of Algorithms | 2019-01-21 | Paper |
| Faster coreset construction for projective clustering via low-rank approximation | 2018-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643865 | 2018-05-29 | Paper |
| Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Corrected Version) | 2018-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635993 | 2018-04-23 | Paper |
| Optimal and Practical Algorithms for Sorting on the PDM | 2017-11-10 | Paper |
| On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model | 2017-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957502 | 2017-01-26 | Paper |
| The robust knapsack problem with queries | 2016-11-10 | Paper |
| The update complexity of selection and related problems | 2016-09-21 | Paper |
| Towards a theory of cache-efficient algorithms | 2015-12-07 | Paper |
| Approximate distance oracles for unweighted graphs in expected O ( n 2 ) time | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501268 | 2015-08-03 | Paper |
| Fully Dynamic Maximal Matching in $O(\log n)$ Update Time | 2015-06-02 | Paper |
| A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems | 2015-01-19 | Paper |
| Fully Dynamic Maximal Matching in O (log n) Update Time | 2014-07-30 | Paper |
| Approximation Algorithms for the Weight-Reducible Knapsack Problem | 2014-04-16 | Paper |
| A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems | 2012-09-25 | Paper |
| The update complexity of selection and related problems | 2012-08-31 | Paper |
| Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths | 2010-08-05 | Paper |
| Linear-time approximation schemes for clustering problems in any dimensions | 2010-07-14 | Paper |
| A linear time deterministic algorithm to find a small subset that approximates the centroid | 2010-03-24 | Paper |
| The Covert Set-Cover Problem with Application to Network Discovery | 2010-02-09 | Paper |
| A generalization of the 0-1 principle for sorting | 2009-12-04 | Paper |
| Improvements on the Johnson bound for Reed-Solomon codes | 2009-06-30 | Paper |
| Approximating Shortest Paths in Graphs | 2009-02-24 | Paper |
| All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time | 2009-02-19 | Paper |
| Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error | 2008-08-28 | Paper |
| A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography | 2008-04-11 | Paper |
| A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs | 2007-07-18 | Paper |
| Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths | 2007-06-08 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions | 2006-10-05 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| A linear time algorithm for approximate 2-means clustering | 2005-11-07 | Paper |
| Fair adaptive bandwidth allocation: a rate control based active queue management discipline | 2004-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3045149 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472449 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474217 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471322 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470505 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449190 | 2004-02-08 | Paper |
| Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima. | 2003-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415266 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788601 | 2003-06-02 | Paper |
| Planar graph blocking for external searching | 2002-12-01 | Paper |
| Improved algorithms for uniform partitions of points | 2002-05-21 | Paper |
| An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945519 | 2001-10-07 | Paper |
| Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511241 | 2001-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788598 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4719335 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952707 | 2000-05-10 | Paper |
| On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm | 1998-09-27 | Paper |
| Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems | 1998-06-30 | Paper |
| Parallel searching in generalized Monge arrays | 1998-05-24 | Paper |
| Optimal, output-sensitive algorithms for constructing planar hulls in parallel | 1998-02-16 | Paper |
| Selection in Monotone Matrices and Computingkth Nearest Neighbors | 1996-09-15 | Paper |
| Fractional Cascading Revisited | 1996-06-25 | Paper |
| An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains | 1995-08-15 | Paper |
| Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications | 1994-08-14 | Paper |
| Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems | 1994-07-28 | Paper |
| IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS | 1993-10-24 | Paper |
| Dynamic point location in arrangements of hyperplanes | 1993-01-16 | Paper |
| Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems | 1993-01-16 | Paper |
| Optimal randomized parallel algorithms for computational geometry | 1992-06-28 | Paper |
| Some observations on skip-lists | 1992-06-27 | Paper |
| On parallel integer sorting | 1992-01-01 | Paper |
| Finding an approximate median with high probability in constant parallel time | 1990-01-01 | Paper |
| Parallel sorting in two-dimensional VLSI models of computation | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3484356 | 1989-01-01 | Paper |
