| Publication | Date of Publication | Type |
|---|
Novel range functions via Taylor expansions and recursive Lagrange interpolation with application to real root isolation
| 2025-01-20 | Paper |
Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition)
| 2024-05-14 | Paper |
Erratum for “Global Identifiability of Differential Models”
Communications on Pure and Applied Mathematics | 2024-01-23 | Paper |
SIAN
ACM Communications in Computer Algebra | 2023-03-03 | Paper |
Combinatorial complexity of signed discs
Lecture Notes in Computer Science | 2023-01-18 | Paper |
On \(\mu\)-symmetric polynomials
Journal of Algebra and its Applications | 2022-10-27 | Paper |
An algorithmic approach to small limit cycles of nonlinear differential systems: the averaging method revisited
Journal of Symbolic Computation | 2022-09-22 | Paper |
Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
| 2022-07-18 | Paper |
Clustering complex zeros of triangular systems of polynomials
Mathematics in Computer Science | 2021-06-25 | Paper |
Global identifiability of differential models
Communications on Pure and Applied Mathematics | 2020-11-13 | Paper |
An algorithmic approach to limit cycles of nonlinear differential systems. The averaging method revisited
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation | 2020-09-10 | Paper |
Towards soft exact computation (invited talk)
| 2020-04-29 | Paper |
Root-finding with implicit deflation
| 2020-04-29 | Paper |
Pseudo approximation algorithms, with applications to optimal motion planning
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Amortized analysis of smooth quadtrees in all dimensions
Computational Geometry | 2018-11-01 | Paper |
Implementation of a near-optimal complex root clustering algorithm
| 2018-08-17 | Paper |
On \(\mu\)-symmetric polynomials and D-plus
| 2018-08-17 | Paper |
Path Planning for Simple Robots using Soft Subdivision Search
| 2018-01-30 | Paper |
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
Journal of Symbolic Computation | 2017-11-22 | Paper |
Shortest path amidst disc obstacles is computable
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
Adaptive isotopic approximation of nonsingular curves: the parametrizability and nonlocal isotopy approach
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Constructive root bound for <tt> k </tt>-ary rational input numbers
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Almost tight recursion tree bounds for the Descartes method
Proceedings of the 2006 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Empirical study of an evaluation-based subdivision algorithm for complex root isolation
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation | 2016-09-29 | Paper |
Certified computation of planar Morse-Smale complexes
Journal of Symbolic Computation | 2016-08-18 | Paper |
Soft subdivision search in motion planning. II: Axiomatics
Frontiers in Algorithmics | 2015-11-12 | Paper |
On soft predicates in subdivision motion planning
Computational Geometry | 2015-07-27 | Paper |
A simple but exact and efficient algorithm for complex root isolation
Proceedings of the 36th international symposium on Symbolic and algebraic computation | 2015-06-09 | Paper |
Near optimal tree size bounds on a simple real root isolation algorithm
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation | 2015-03-27 | Paper |
On soft predicates in subdivision motion planning
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision
Mathematical Software – ICMS 2014 | 2014-09-08 | Paper |
Amortized Analysis of Smooth Quadtrees in All Dimensions
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Certified computation of planar Morse-Smale complexes
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
On formulating simultaneity for studying parallelism and synchronization
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
Analytic root clustering: a complete algorithm using soft zero tests
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Hypergeometric functions in exact geometric computation
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
Lower bounds for zero-dimensional projections
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
A real elementary approach to the master recurrence and generalizations
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach
Discrete & Computational Geometry | 2011-06-03 | Paper |
The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
Mathematical Software – ICMS 2010 | 2010-09-14 | Paper |
An experimental study of weighted \(k\)-link shortest path algorithms
Springer Tracts in Advanced Robotics | 2010-06-02 | Paper |
In Praise of Numerical Computation
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Complete numerical isolation of real roots in zero-dimensional triangular systems
Journal of Symbolic Computation | 2009-06-18 | Paper |
Foundations of Exact Rounding
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
scientific article; zbMATH DE number 5506244 (Why is no real title available?)
| 2009-02-10 | Paper |
scientific article; zbMATH DE number 5506211 (Why is no real title available?)
| 2009-02-10 | Paper |
Reply to “Backward Error Analysis ...”
Computational Science and Its Applications - ICCSA 2006 | 2009-01-27 | Paper |
scientific article; zbMATH DE number 5494027 (Why is no real title available?)
| 2009-01-20 | Paper |
Complete subdivision algorithms, II
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation | 2009-01-20 | Paper |
Theory of Real Computation According to EGC
Reliable Implementation of Real Number Algorithms: Theory and Practice | 2009-01-13 | Paper |
OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS
International Journal of Computational Geometry & Applications | 2008-05-20 | Paper |
Classroom examples of robustness problems in geometric computations
Computational Geometry | 2008-03-26 | Paper |
Competitive on-line scheduling with level of service
Journal of Scheduling | 2007-12-20 | Paper |
Amortized bound for root isolation via Sturm sequences
| 2007-06-28 | Paper |
SHORTEST PATH AMIDST DISC OBSTACLES IS COMPUTABLE
International Journal of Computational Geometry & Applications | 2007-02-09 | Paper |
Constructive root bound for \(k\)-ary rational input numbers
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
scientific article; zbMATH DE number 2247480 (Why is no real title available?)
| 2006-01-16 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Recent progress in exact geometric computation
The Journal of Logic and Algebraic Programming | 2005-06-01 | Paper |
Pseudo approximation algorithms with applications to optimal motion planning
Discrete & Computational Geometry | 2004-03-11 | Paper |
scientific article; zbMATH DE number 1796988 (Why is no real title available?)
| 2002-09-05 | Paper |
A new constructive root bound for algebraic expressions. (Extended abstract)
| 2002-07-22 | Paper |
scientific article; zbMATH DE number 1746666 (Why is no real title available?)
| 2002-06-09 | Paper |
Wavelet foveation
Applied and Computational Harmonic Analysis | 2001-05-07 | Paper |
scientific article; zbMATH DE number 1446863 (Why is no real title available?)
| 2000-05-15 | Paper |
Precision-Sensitive Euclidean Shortest Path in 3-Space
SIAM Journal on Computing | 2000-03-19 | Paper |
A simultaneous search problem
Algorithmica | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1256681 (Why is no real title available?)
| 1999-08-16 | Paper |
scientific article; zbMATH DE number 1182928 (Why is no real title available?)
| 1999-03-02 | Paper |
Combinatorial complexity of translating a box in polyhedral 3-space
Computational Geometry | 1998-08-30 | Paper |
Primal dividing and dual pruning: Output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams
Discrete & Computational Geometry | 1998-07-27 | Paper |
Approximate Euclidean Shortest Paths in 3-Space
International Journal of Computational Geometry & Applications | 1998-03-16 | Paper |
Towards exact geometric computation
Computational Geometry | 1997-03-18 | Paper |
Combinatorial complexity of signed discs
Computational Geometry | 1996-11-10 | Paper |
scientific article; zbMATH DE number 910884 (Why is no real title available?)
| 1996-08-22 | Paper |
The Habicht approach to subresultants
Journal of Symbolic Computation | 1996-07-18 | Paper |
Shortest paths for line segments
Algorithmica | 1993-10-13 | Paper |
Constructing the Voronoi diagram of a set of line segments in parallel
Algorithmica | 1993-04-01 | Paper |
scientific article; zbMATH DE number 140455 (Why is no real title available?)
| 1993-03-28 | Paper |
scientific article; zbMATH DE number 140482 (Why is no real title available?)
| 1993-03-28 | Paper |
Simultaneous inner and outer approximation of shapes
Algorithmica | 1993-01-17 | Paper |
Refinement methods for geometric bounds in constructive solid geometry
ACM Transactions on Graphics | 1992-06-28 | Paper |
Quantitative Steinitz's theorems with applications to multifingered grasping
Discrete & Computational Geometry | 1992-06-28 | Paper |
New Upper Bounds in Klee’s Measure Problem
SIAM Journal on Computing | 1992-06-27 | Paper |
Reversal Complexity
SIAM Journal on Computing | 1992-06-25 | Paper |
Constructive Whitney–Graustein Theorem: Or How to Untangle Closed Planar Curves
SIAM Journal on Computing | 1992-06-25 | Paper |
A new lower bound construction for commutative Thue systems with applications
Journal of Symbolic Computation | 1991-01-01 | Paper |
A geometric consistency theorem for a symbolic perturbation scheme
Journal of Computer and System Sciences | 1990-01-01 | Paper |
Symbolic treatment of geometric degeneracies
Journal of Symbolic Computation | 1990-01-01 | Paper |
Mountain Climbing, Ladder Moving, and the Ring-Width of a Polygon
The American Mathematical Monthly | 1989-01-01 | Paper |
Finding minimal convex nested polygons
Information and Computation | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4079447 (Why is no real title available?)
| 1988-01-01 | Paper |
The orthogonal convex skull problem
Discrete & Computational Geometry | 1988-01-01 | Paper |
Computing the link center of a simple polygon
Discrete & Computational Geometry | 1988-01-01 | Paper |
Parallel computational geometry
Algorithmica | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4123136 (Why is no real title available?)
| 1988-01-01 | Paper |
Parallel triangulation of a polygon in two calls to the trapezoidal map
Algorithmica | 1988-01-01 | Paper |
An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
Discrete & Computational Geometry | 1987-01-01 | Paper |
Shape from probing
Journal of Algorithms | 1987-01-01 | Paper |
On k-Hulls and Related Problems
SIAM Journal on Computing | 1987-01-01 | Paper |
Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
Algorithmica | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4016210 (Why is no real title available?)
| 1987-01-01 | Paper |
Generalized voronoi diagrams for moving a ladder. I: Topological analysis
Communications on Pure and Applied Mathematics | 1986-01-01 | Paper |
New upper bounds for neighbor searching
Information and Control | 1986-01-01 | Paper |
A parallel median algorithm
Information Processing Letters | 1985-01-01 | Paper |
A “retraction” method for planning the motion of a disc
Journal of Algorithms | 1985-01-01 | Paper |
Geometric retrieval problems
Information and Control | 1984-01-01 | Paper |
The Format Model
Journal of the ACM | 1984-01-01 | Paper |
Strong NP-hardness of moving many discs
Information Processing Letters | 1984-01-01 | Paper |
Some consequences of non-uniform conditions on uniform classes
Theoretical Computer Science | 1983-01-01 | Paper |
A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs
Information Processing Letters | 1983-01-01 | Paper |
On formulating simultaneity for studying parallelism and synchronization
Journal of Computer and System Sciences | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3628369 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3551937 (Why is no real title available?)
| 1977-01-01 | Paper |
New upper bounds for selection
Communications of the ACM | 1976-01-01 | Paper |
