| Publication | Date of Publication | Type |
|---|
| Decomposing the boundary of a nonconvex polyhedron | 2022-12-09 | Paper |
| Extracting Semantic Information from Dynamic Graphs of Geometric Data | 2022-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5077659 | 2022-05-18 | Paper |
| Toward a Theory of Markov Influence Systems and their Renormalization | 2021-06-15 | Paper |
| Some observations on dynamic random walks and network renormalization | 2020-01-30 | Paper |
| A Sharp Bound on the $s$-Energy and Its Applications to Averaging Systems | 2020-01-28 | Paper |
| Lower bounds on the complexity of simplex range reporting on a pointer machine | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633851 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633038 | 2019-05-02 | Paper |
| The power of nonmonotonicity in geometric searching | 2018-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643852 | 2018-05-29 | Paper |
| Self-Sustaining Iterated Learning | 2018-05-03 | Paper |
| Inertial Hegselmann-Krause Systems | 2017-11-10 | Paper |
| Computing hereditary convex structures | 2017-10-20 | Paper |
| A trace bound for the hereditary discrepancy | 2017-09-29 | Paper |
| Noisy Hegselmann-Krause systems: phase transition and the \(2R\)-conjecture | 2017-06-02 | Paper |
| On the convergence of the Hegselmann-Krause system | 2017-05-16 | Paper |
| Well-posedness of the limiting equation of a noisy consensus model in opinion dynamics | 2017-05-08 | Paper |
| A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube | 2016-09-29 | Paper |
| Gaussian Learning-Without-Recall in a Dynamic Social Network | 2016-09-19 | Paper |
| Computational geometry | 2016-09-01 | Paper |
| Diffusive Influence Systems | 2015-11-04 | Paper |
| Communication, Dynamics, and Renormalization | 2015-09-21 | Paper |
| The Convergence of Bird Flocking | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501239 | 2015-08-03 | Paper |
| Data structures on event graphs | 2015-06-25 | Paper |
| An algorithmic approach to collective behavior | 2015-05-08 | Paper |
| Improved bounds on weak ε-nets for convex sets | 2015-05-07 | Paper |
| Lower bounds for intersection searching and fractional cascading in higher dimension | 2015-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5497119 | 2015-02-03 | Paper |
| Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform | 2014-11-25 | Paper |
| The geometry of flocking | 2014-04-03 | Paper |
| A geometric approach to collective motion | 2014-04-03 | Paper |
| Online geometric reconstruction | 2014-02-17 | Paper |
| Data structures on event graphs | 2012-09-25 | Paper |
| A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies | 2012-06-08 | Paper |
| The Total s-Energy of a Multiagent System | 2011-11-10 | Paper |
| Self-Improving Algorithms | 2011-07-29 | Paper |
| Computing hereditary convex structures | 2011-06-03 | Paper |
| Sublinear geometric algorithms | 2010-08-16 | Paper |
| Self-improving algorithms | 2010-08-16 | Paper |
| Lower bounds for linear degeneracy testing | 2010-08-15 | Paper |
| The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors | 2010-03-17 | Paper |
| Markov incremental constructions | 2009-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3613906 | 2009-03-16 | Paper |
| Markov incremental constructions | 2009-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3601563 | 2009-02-10 | Paper |
| Lower bounds for linear degeneracy testing | 2008-12-21 | Paper |
| Shape distributions | 2008-12-21 | Paper |
| Property-preserving data reconstruction | 2008-07-01 | Paper |
| Strategies for polyhedral surface decomposition: an experimental study. | 2008-04-25 | Paper |
| Estimating the distance to a monotone function | 2008-01-08 | Paper |
| Approximate range searching in higher dimension | 2007-10-19 | Paper |
| Information theory in property testing and monotonicity testing in higher dimension | 2007-01-22 | Paper |
| Sublinear Geometric Algorithms | 2006-06-01 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692703 | 2005-09-28 | Paper |
| Approximating the Minimum Spanning Tree Weight in Sublinear Time | 2005-09-16 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4650527 | 2005-02-18 | Paper |
| A reflective symmetry descriptor for 3D models | 2004-12-02 | Paper |
| Lower bounds for intersection searching and fractional cascading in higher dimension | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472432 | 2004-08-04 | Paper |
| The power of nonmonotonicity in geometric searching | 2004-03-11 | Paper |
| The soft heap | 2003-06-25 | Paper |
| A minimum spanning tree algorithm with inverse-Ackermann type complexity | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4796184 | 2003-03-02 | Paper |
| Splitting a Delaunay triangulation in linear time | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535797 | 2002-06-25 | Paper |
| The discrepancy of boxes in higher dimension | 2002-05-14 | Paper |
| A trace bound for the hereditary discrepancy | 2002-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234124 | 2002-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515159 | 2000-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938782 | 2000-02-23 | Paper |
| Product Range Spaces, Sensitive Sampling, and Derandomization | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4225320 | 1999-01-01 | Paper |
| Optimal slope selection via cuttings | 1998-10-11 | Paper |
| A Spectral Approach to Lower Bounds with Applications to Geometric Searching | 1998-05-10 | Paper |
| On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension | 1997-07-08 | Paper |
| Decomposing the boundary of a nonconvex polyhedron | 1997-06-30 | Paper |
| Lower bounds for off-line range searching | 1997-01-22 | Paper |
| Simplex range reporting on a pointer machine | 1996-07-14 | Paper |
| Lines in space: Combinatorics and algorithms | 1996-05-27 | Paper |
| Bounds on the size of tetrahedralizations | 1996-02-06 | Paper |
| Algorithms for bichromatic line-segment problems and polyhedral terrains | 1995-08-20 | Paper |
| An elementary approach to lower bounds in geometric discrepancy | 1995-07-02 | Paper |
| Point location among hyperplanes and unidirectional ray-shooting | 1995-06-30 | Paper |
| TRIANGULATING DISJOINT JORDAN CHAINS | 1995-04-06 | Paper |
| Selecting Heavily Covered Points | 1995-04-06 | Paper |
| Improved bounds on weak \(\varepsilon\)-nets for convex sets | 1995-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140430 | 1995-03-27 | Paper |
| Derandomizing an output-sensitive convex hull algorithm in three dimensions | 1995-03-22 | Paper |
| An optimal algorithm for intersecting line segments in the plane | 1994-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4312984 | 1994-11-10 | Paper |
| Ray shooting in polygons using geodesic triangulations | 1994-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4295431 | 1994-06-14 | Paper |
| An optimal convex hull algorithm in any fixed dimension | 1994-05-15 | Paper |
| Computing a Face in an Arrangement of Line Segments and Related Problems | 1994-02-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138981 | 1993-10-20 | Paper |
| How hard is half-space range searching? | 1993-09-30 | Paper |
| Diameter, width, closest line pair, and parametric searching | 1993-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201934 | 1993-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036602 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036604 | 1993-05-18 | Paper |
| Cutting hyperplanes for divide-and-conquer | 1993-05-16 | Paper |
| Quasi-optimal upper bounds for simplex range searching and new zone theorems | 1993-01-17 | Paper |
| An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra | 1993-01-16 | Paper |
| Counting and cutting cycles of lines and rods in space | 1992-09-27 | Paper |
| A singly exponential stratification scheme for real semi-algebraic varieties and its applications | 1992-06-26 | Paper |
| Points and triangles in the plane and halving planes in space | 1992-06-25 | Paper |
| Triangulating a simple polygon in linear time | 1992-06-25 | Paper |
| THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE | 1991-01-01 | Paper |
| A deterministic view of random sampling and its use in geometry | 1990-01-01 | Paper |
| Triangulating a nonconvex polytope | 1990-01-01 | Paper |
| An algorithm for generalized point location and its applications | 1990-01-01 | Paper |
| Lower bounds for orthogonal range searching: I. The reporting case | 1990-01-01 | Paper |
| Lower bounds for orthogonal range searching: part II. The arithmetic model | 1990-01-01 | Paper |
| Visibility and intersection problems in plane geometry | 1989-01-01 | Paper |
| The complexity of cutting complexes | 1989-01-01 | Paper |
| Quasi-optimal range searching in spaces of finite VC-dimension | 1989-01-01 | Paper |
| Lower Bounds on the Complexity of Polytope Range Searching | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3481216 | 1989-01-01 | Paper |
| A Functional Approach to Data Structures and Its Use in Multidimensional Searching | 1988-01-01 | Paper |
| Parallel computational geometry | 1988-01-01 | Paper |
| Linear space data structures for two types of range search | 1987-01-01 | Paper |
| Computing on a free tree via complexity-preserving mappings | 1987-01-01 | Paper |
| Some techniques for geometric searching with implicit set representations | 1987-01-01 | Paper |
| An Improved Algorithm for Constructing kth-Order Voronoi Diagrams | 1987-01-01 | Paper |
| Halfspace range search: An algorithmic application of k-sets | 1986-01-01 | Paper |
| Fractional cascading. I: A data structuring technique | 1986-01-01 | Paper |
| Fractional cascading. II: Applications | 1986-01-01 | Paper |
| Reporting and counting segment intersections | 1986-01-01 | Paper |
| New upper bounds for neighbor searching | 1986-01-01 | Paper |
| Filtering Search: A New Approach to Query-Answering | 1986-01-01 | Paper |
| Optimal solutions for a class of point retrieval problems | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687755 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687756 | 1985-01-01 | Paper |
| On the convex layers of a planar set | 1985-01-01 | Paper |
| How to search in history | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742730 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3750120 | 1985-01-01 | Paper |
| A model of computation for VLSI with related complexity results | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217599 | 1984-01-01 | Paper |
| Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm | 1984-01-01 | Paper |
| Triangulation and shape-complexity | 1984-01-01 | Paper |
| Unbounded hardware is equivalent to deterministic Turing machines | 1983-01-01 | Paper |
| A decision procedure for optimal polyhedron partitioning | 1983-01-01 | Paper |
| The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674070 | 1983-01-01 | Paper |
