| Publication | Date of Publication | Type |
|---|
| The dynamics of influence systems | 2025-05-05 | Paper |
Decomposing the boundary of a nonconvex polyhedron
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Extracting Semantic Information from Dynamic Graphs of Geometric Data
Complex Networks & Their Applications X | 2022-11-15 | Paper |
| scientific article; zbMATH DE number 7529165 (Why is no real title available?) | 2022-05-18 | Paper |
Toward a theory of Markov influence systems and their renormalization
(available as arXiv preprint) | 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
IEEE Transactions on Automatic Control | 2020-01-28 | Paper |
Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
| Natural algorithms | 2019-05-06 | Paper |
| Iterated learning in dynamic social networks | 2019-05-02 | Paper |
The power of nonmonotonicity in geometric searching
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
| scientific article; zbMATH DE number 6876082 (Why is no real title available?) | 2018-05-29 | Paper |
Self-Sustaining Iterated Learning
(available as arXiv preprint) | 2018-05-03 | Paper |
Inertial Hegselmann-Krause Systems
IEEE Transactions on Automatic Control | 2017-11-10 | Paper |
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
A trace bound for the hereditary discrepancy
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Noisy Hegselmann-Krause systems: phase transition and the \(2R\)-conjecture
Journal of Statistical Physics | 2017-06-02 | Paper |
On the convergence of the Hegselmann-Krause system
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Well-posedness of the limiting equation of a noisy consensus model in opinion dynamics
Journal of Differential Equations | 2017-05-08 | Paper |
A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
| Gaussian Learning-Without-Recall in a Dynamic Social Network | 2016-09-19 | Paper |
Computational geometry: a retrospective
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Diffusive influence systems
SIAM Journal on Computing | 2015-11-04 | Paper |
Communication, dynamics, and renormalization
Lecture Notes in Computer Science | 2015-09-21 | Paper |
The Convergence of Bird Flocking
Journal of the ACM | 2015-08-14 | Paper |
| scientific article; zbMATH DE number 6469129 (Why is no real title available?) | 2015-08-03 | Paper |
Data structures on event graphs
Algorithmica | 2015-06-25 | Paper |
An algorithmic approach to collective behavior
Journal of Statistical Physics | 2015-05-08 | Paper |
Improved bounds on weak ε-nets for convex sets
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Lower bounds for intersection searching and fractional cascading in higher dimension
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
How many bits can a flock of birds compute?
Theory of Computing | 2015-02-03 | Paper |
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
A geometric approach to collective motion
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
The geometry of flocking
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Online geometric reconstruction
Journal of the ACM | 2014-02-17 | Paper |
Data structures on event graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
A semidefinite programming approach to side chain positioning with new rounding strategies
INFORMS Journal on Computing | 2012-06-08 | Paper |
The total \(s\)-energy of a multiagent system
SIAM Journal on Control and Optimization | 2011-11-10 | Paper |
Self-improving algorithms
SIAM Journal on Computing | 2011-07-29 | Paper |
Computing hereditary convex structures
Discrete & Computational Geometry | 2011-06-03 | Paper |
Self-improving algorithms
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Sublinear geometric algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Lower bounds for linear degeneracy testing
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
SIAM Journal on Computing | 2010-03-17 | Paper |
Markov incremental constructions
Discrete & Computational Geometry | 2009-08-27 | Paper |
| scientific article; zbMATH DE number 5528957 (Why is no real title available?) | 2009-03-16 | Paper |
Markov incremental constructions
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5506230 (Why is no real title available?) | 2009-02-10 | Paper |
Lower bounds for linear degeneracy testing
Journal of the ACM | 2008-12-21 | Paper |
Shape distributions
ACM Transactions on Graphics | 2008-12-21 | Paper |
Property-preserving data reconstruction
Algorithmica | 2008-07-01 | Paper |
Strategies for polyhedral surface decomposition: an experimental study.
Computational Geometry | 2008-04-25 | Paper |
Estimating the distance to a monotone function
Random Structures & Algorithms | 2008-01-08 | Paper |
Approximate range searching in higher dimension
Computational Geometry | 2007-10-19 | Paper |
Information theory in property testing and monotonicity testing in higher dimension
Information and Computation | 2007-01-22 | Paper |
Sublinear Geometric Algorithms
SIAM Journal on Computing | 2006-06-01 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
| scientific article; zbMATH DE number 2209721 (Why is no real title available?) | 2005-09-28 | Paper |
Approximating the Minimum Spanning Tree Weight in Sublinear Time
SIAM Journal on Computing | 2005-09-16 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2134849 (Why is no real title available?) | 2005-02-18 | Paper |
| scientific article; zbMATH DE number 2134849 (Why is no real title available?) | 2005-02-18 | Paper |
A reflective symmetry descriptor for 3D models
Algorithmica | 2004-12-02 | Paper |
Lower bounds for intersection searching and fractional cascading in higher dimension
Journal of Computer and System Sciences | 2004-11-22 | Paper |
| scientific article; zbMATH DE number 2080190 (Why is no real title available?) | 2004-08-04 | Paper |
The power of nonmonotonicity in geometric searching
Discrete & Computational Geometry | 2004-03-11 | Paper |
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM | 2003-06-25 | Paper |
The soft heap
Journal of the ACM | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1875425 (Why is no real title available?) | 2003-03-02 | Paper |
Splitting a Delaunay triangulation in linear time
Algorithmica | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1756011 (Why is no real title available?) | 2002-06-25 | Paper |
The discrepancy of boxes in higher dimension
Discrete & Computational Geometry | 2002-05-14 | Paper |
A trace bound for the hereditary discrepancy
Discrete & Computational Geometry | 2002-05-05 | Paper |
| scientific article; zbMATH DE number 1263252 (Why is no real title available?) | 2002-01-24 | Paper |
| scientific article; zbMATH DE number 1528185 (Why is no real title available?) | 2000-11-12 | Paper |
| scientific article; zbMATH DE number 1405797 (Why is no real title available?) | 2000-02-23 | Paper |
Product Range Spaces, Sensitive Sampling, and Derandomization
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1241856 (Why is no real title available?) | 1999-01-01 | Paper |
Optimal slope selection via cuttings
Computational Geometry | 1998-10-11 | Paper |
A Spectral Approach to Lower Bounds with Applications to Geometric Searching
SIAM Journal on Computing | 1998-05-10 | Paper |
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
Journal of Algorithms | 1997-07-08 | Paper |
Decomposing the boundary of a nonconvex polyhedron
Algorithmica | 1997-06-30 | Paper |
Lower bounds for off-line range searching
Discrete & Computational Geometry | 1997-01-22 | Paper |
Simplex range reporting on a pointer machine
Computational Geometry | 1996-07-14 | Paper |
Lines in space: Combinatorics and algorithms
Algorithmica | 1996-05-27 | Paper |
Bounds on the size of tetrahedralizations
Discrete & Computational Geometry | 1996-02-06 | Paper |
Algorithms for bichromatic line-segment problems and polyhedral terrains
Algorithmica | 1995-08-20 | Paper |
An elementary approach to lower bounds in geometric discrepancy
Discrete & Computational Geometry | 1995-07-02 | Paper |
Point location among hyperplanes and unidirectional ray-shooting
Computational Geometry | 1995-06-30 | Paper |
TRIANGULATING DISJOINT JORDAN CHAINS
International Journal of Computational Geometry & Applications | 1995-04-06 | Paper |
Selecting Heavily Covered Points
SIAM Journal on Computing | 1995-04-06 | Paper |
Improved bounds on weak \(\varepsilon\)-nets for convex sets
Discrete & Computational Geometry | 1995-04-03 | Paper |
| scientific article; zbMATH DE number 437553 (Why is no real title available?) | 1995-03-27 | Paper |
Derandomizing an output-sensitive convex hull algorithm in three dimensions
Computational Geometry | 1995-03-22 | Paper |
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM | 1994-11-13 | Paper |
| scientific article; zbMATH DE number 686900 (Why is no real title available?) | 1994-11-10 | Paper |
Ray shooting in polygons using geodesic triangulations
Algorithmica | 1994-08-10 | Paper |
| scientific article; zbMATH DE number 589122 (Why is no real title available?) | 1994-06-14 | Paper |
An optimal convex hull algorithm in any fixed dimension
Discrete & Computational Geometry | 1994-05-15 | Paper |
Computing a Face in an Arrangement of Line Segments and Related Problems
SIAM Journal on Computing | 1994-02-24 | Paper |
| scientific article; zbMATH DE number 432847 (Why is no real title available?) | 1993-10-20 | Paper |
How hard is half-space range searching?
Discrete & Computational Geometry | 1993-09-30 | Paper |
Diameter, width, closest line pair, and parametric searching
Discrete & Computational Geometry | 1993-09-30 | Paper |
| scientific article; zbMATH DE number 403950 (Why is no real title available?) | 1993-09-06 | Paper |
| scientific article; zbMATH DE number 176772 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176774 (Why is no real title available?) | 1993-05-18 | Paper |
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry | 1993-05-16 | Paper |
Quasi-optimal upper bounds for simplex range searching and new zone theorems
Algorithmica | 1993-01-17 | Paper |
An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
SIAM Journal on Computing | 1993-01-16 | Paper |
Counting and cutting cycles of lines and rods in space
Computational Geometry | 1992-09-27 | Paper |
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science | 1992-06-26 | Paper |
Triangulating a simple polygon in linear time
Discrete & Computational Geometry | 1992-06-25 | Paper |
Points and triangles in the plane and halving planes in space
Discrete & Computational Geometry | 1992-06-25 | Paper |
THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
International Journal of Computational Geometry & Applications | 1991-01-01 | Paper |
A deterministic view of random sampling and its use in geometry
Combinatorica | 1990-01-01 | Paper |
Triangulating a nonconvex polytope
Discrete & Computational Geometry | 1990-01-01 | Paper |
Lower bounds for orthogonal range searching: I. The reporting case
Journal of the ACM | 1990-01-01 | Paper |
Lower bounds for orthogonal range searching: part II. The arithmetic model
Journal of the ACM | 1990-01-01 | Paper |
An algorithm for generalized point location and its applications
Journal of Symbolic Computation | 1990-01-01 | Paper |
| Lower Bounds on the Complexity of Polytope Range Searching | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4151829 (Why is no real title available?) | 1989-01-01 | Paper |
The complexity of cutting complexes
Discrete & Computational Geometry | 1989-01-01 | Paper |
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry | 1989-01-01 | Paper |
Quasi-optimal range searching in spaces of finite VC-dimension
Discrete & Computational Geometry | 1989-01-01 | Paper |
A Functional Approach to Data Structures and Its Use in Multidimensional Searching
SIAM Journal on Computing | 1988-01-01 | Paper |
Parallel computational geometry
Algorithmica | 1988-01-01 | Paper |
An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
IEEE Transactions on Computers | 1987-01-01 | Paper |
Computing on a free tree via complexity-preserving mappings
Algorithmica | 1987-01-01 | Paper |
Linear space data structures for two types of range search
Discrete & Computational Geometry | 1987-01-01 | Paper |
Some techniques for geometric searching with implicit set representations
Acta Informatica | 1987-01-01 | Paper |
New upper bounds for neighbor searching
Information and Control | 1986-01-01 | Paper |
Filtering Search: A New Approach to Query-Answering
SIAM Journal on Computing | 1986-01-01 | Paper |
Fractional cascading. I: A data structuring technique
Algorithmica | 1986-01-01 | Paper |
Halfspace range search: An algorithmic application of k-sets
Discrete & Computational Geometry | 1986-01-01 | Paper |
Fractional cascading. II: Applications
Algorithmica | 1986-01-01 | Paper |
Reporting and counting segment intersections
Journal of Computer and System Sciences | 1986-01-01 | Paper |
How to search in history
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3986641 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3978403 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3911764 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3911763 (Why is no real title available?) | 1985-01-01 | Paper |
On the convex layers of a planar set
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
Optimal solutions for a class of point retrieval problems
Journal of Symbolic Computation | 1985-01-01 | Paper |
A model of computation for VLSI with related complexity results
Journal of the ACM | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3883607 (Why is no real title available?) | 1984-01-01 | Paper |
Triangulation and shape-complexity
ACM Transactions on Graphics | 1984-01-01 | Paper |
Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
SIAM Journal on Computing | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3829267 (Why is no real title available?) | 1983-01-01 | Paper |
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers | 1983-01-01 | Paper |
Unbounded hardware is equivalent to deterministic Turing machines
Theoretical Computer Science | 1983-01-01 | Paper |
A decision procedure for optimal polyhedron partitioning
Information Processing Letters | 1983-01-01 | Paper |
