Constructing arrangements of lines and hyperplanes with applications
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Lower bound arguments with “inaccessible" numbers
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Topologically sweeping an arrangement
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Lower bounds for sorting of sums
Theoretical Computer Science
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
ACM Transactions on Graphics (TOG)
A geometric consistency theorem for a symbolic perturbation scheme
Journal of Computer and System Sciences
A general approach to removing degeneracies
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Linear decision trees: volume estimates and topological bounds
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the zone theorem for hyperplane arrangements
SIAM Journal on Computing
Decision tree complexity and Betti numbers
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A Polynomial Linear Search Algorithm for the n-Dimensional Knapsack Problem
Journal of the ACM (JACM)
Computing Roadmaps of General Semi-Algebraic Sets
AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Finding submasses in weighted strings with Fast Fourier Transform
Discrete Applied Mathematics
Green's conjecture and testing linear-invariant properties
Proceedings of the forty-first annual ACM symposium on Theory of computing
Lower bounds for linear decision trees via an energy complexity argument
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On noise-tolerant learning of sparse parities and related problems
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Exact weight subgraphs and the k-sum conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |