| Publication | Date of Publication | Type |
|---|
Boundaries of VP and VNP
(available as arXiv preprint) | 2017-12-19 | Paper |
On vanishing of Kronecker coefficients
Computational Complexity | 2017-12-18 | Paper |
Membership in moment polytopes is in NP and coNP
SIAM Journal on Computing | 2017-06-28 | Paper |
Geometric complexity theory. V: Efficient algorithms for Noether normalization
Journal of the American Mathematical Society | 2016-10-18 | Paper |
Lower bounds for parallel linear programming and other problems
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
Journal of Algebraic Combinatorics | 2012-07-31 | Paper |
On P vs. NP and geometric complexity theory: dedicated to Sri Ramakrishna
Journal of the ACM | 2011-07-14 | Paper |
A lower bound for the shortest path problem
Journal of Computer and System Sciences | 2002-07-22 | Paper |
Geometric complexity theory. I: An approach to the P vs. NP and related problems
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1559536 (Why is no real title available?) | 2001-02-28 | Paper |
An efficient algorithm for hidden surface removal. II
Journal of Computer and System Sciences | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1424304 (Why is no real title available?) | 2000-03-23 | Paper |
| scientific article; zbMATH DE number 1354139 (Why is no real title available?) | 1999-10-31 | Paper |
Lower Bounds in a Parallel Model without Bit Operations
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1256644 (Why is no real title available?) | 1999-04-22 | Paper |
| scientific article; zbMATH DE number 1182927 (Why is no real title available?) | 1998-08-02 | Paper |
Randomized geometric algorithms and pseudorandom generators
Algorithmica | 1996-10-13 | Paper |
A fast planar partition algorithm, II
Journal of the ACM | 1994-11-13 | Paper |
Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements
Journal of Computer and System Sciences | 1994-03-24 | Paper |
| scientific article; zbMATH DE number 410386 (Why is no real title available?) | 1993-09-06 | Paper |
Dynamic point location in arrangements of hyperplanes
Discrete & Computational Geometry | 1993-01-16 | Paper |
A generalization of Dehn-Sommerville relations to simple stratified spaces
Discrete & Computational Geometry | 1992-12-14 | Paper |
On levels in arrangements and Voronoi diagrams
Discrete & Computational Geometry | 1991-01-01 | Paper |
A fast planar partition algorithm. I
Journal of Symbolic Computation | 1990-01-01 | Paper |
Matching is as easy as matrix inversion
Combinatorica | 1987-01-01 | Paper |
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
Combinatorica | 1987-01-01 | Paper |
Fully abstract submodels of typed lambda calculi
Journal of Computer and System Sciences | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3870631 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3896333 (Why is no real title available?) | 1984-01-01 | Paper |
