Ketan Mulmuley

Publication Activity (10 Years)

Years Active: 1984-2012
Publications (10 Years): 0

Top Topics

Computer Graphics

Geometric Structure

Complexity Theory

Johnson Lindenstrauss

Top Venues

Publications

Ketan Mulmuley
Geometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether's Normalization Lemma CoRR (2012)
Ketan Mulmuley
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma. FOCS (2012)
Ketan Mulmuley
problem. Commun. ACM 55 (6) (2012)
Ketan Mulmuley
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna. J. ACM 58 (2) (2011)
Ketan Mulmuley
Explicit Proofs and The Flip CoRR (2010)
Ketan Mulmuley
On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis CoRR (2009)
Ketan Mulmuley
On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier CoRR (2009)
Ketan Mulmuley, Milind A. Sohoni
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties. SIAM J. Comput. 38 (3) (2008)
Ketan Mulmuley
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups CoRR (2007)
Ketan Mulmuley, Milind A. Sohoni
Geometric Complexity Theory: Introduction CoRR (2007)
Ketan Mulmuley
Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry CoRR (2007)
Ketan Mulmuley
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem CoRR (2007)
Ketan Mulmuley, Milind A. Sohoni
Geometric Complexity Theory IV: quantum group for the Kronecker problem CoRR (2007)
Ketan Mulmuley
On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view CoRR (2007)
Ketan Mulmuley, Milind A. Sohoni
Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties CoRR (2006)
Ketan Mulmuley, Milind A. Sohoni
Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients CoRR (2005)
Ketan Mulmuley, Milind A. Sohoni
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems. SIAM J. Comput. 31 (2) (2001)
Ketan Mulmuley, Pradyut Shah
A Lower Bound for the Shortest Path Problem. J. Comput. Syst. Sci. 63 (2) (2001)
Ketan Mulmuley, Pradyut Shah
A Lower Bound for the Shortest Path Problem. Computational Complexity Conference (2000)
Ketan Mulmuley
Lower Bounds in a Parallel Model without Bit Operations. SIAM J. Comput. 28 (4) (1999)
Ketan Mulmuley
? (Extended Abstract). STOC (1997)
Ketan Mulmuley
Parallel vs. Parametric Complexity (Abstract). WADS (1997)
Ketan Mulmuley
Randomized Geometric Algorithms and Pseudorandom Generators. Algorithmica 16 (4/5) (1996)
Ketan Mulmuley
An Efficient Algorithm for Hidden Surface Removal, II. J. Comput. Syst. Sci. 49 (3) (1994)
Ketan Mulmuley
Lower bounds for parallel linear programming and other problems. STOC (1994)
Ketan Mulmuley
Randomized Geometric Algorithms (Abstract). SWAT (1994)
Ketan Mulmuley
Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements. J. Comput. Syst. Sci. 47 (3) (1993)
Ketan Mulmuley
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. Discret. Comput. Geom. 9 (1993)
Ketan Mulmuley
Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements. SCG (1993)
Ketan Mulmuley
A lOwer Bound for Solvability of Polynomial Equations. FSTTCS (1993)
Ketan Mulmuley
Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract) FOCS (1992)
Ketan Mulmuley, Sandeep Sen
Dynamic Point Location in Arrangement of Hyperplanes. Discret. Comput. Geom. 8 (1992)
Ketan Mulmuley
A Fast Planar Partition Algorithm, II. J. ACM 38 (1) (1991)
Ketan Mulmuley
Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract). SCG (1991)
Ketan Mulmuley
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. SCG (1991)
Ketan Mulmuley
Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract) FOCS (1991)
Ketan Mulmuley
Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract) FOCS (1991)
Ketan Mulmuley
On Levels in Arrangement and Voronoi Diagrams. Discret. Comput. Geom. 6 (1991)
Ketan Mulmuley
Hidden Surface Removal with Respect to a Moving View Point STOC (1991)
Ketan Mulmuley, Sandeep Sen
Dynamic Point Location in Arrangements of Hyperplanes. SCG (1991)
Ketan Mulmuley
Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k STOC (1990)
Ketan Mulmuley
A Fast Planar Partition Algorithm, I. J. Symb. Comput. 10 (3/4) (1990)
Ketan Mulmuley
A Fast Planar Partition Algorithm, II. SCG (1989)
Ketan Mulmuley
On Obstructions in Relation to a Fixed Viewpoint FOCS (1989)
Ketan Mulmuley
An efficient algorithm for hidden surface removal. SIGGRAPH (1989)
Ketan Mulmuley
A Fast Planar Partition Algorithm, I (Extended Abstract) FOCS (1988)
Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani
Matching is as easy as matrix inversion. Comb. 7 (1) (1987)
Ketan Mulmuley
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Comb. 7 (1) (1987)
Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani
Matching Is as Easy as Matrix Inversion STOC (1987)
Ketan Mulmuley
A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field STOC (1986)
Ketan Mulmuley
Fully Abstract Submodels of Typed Lambda Calculi. J. Comput. Syst. Sci. 33 (1) (1986)
Ketan Mulmuley
The Mechanization of Existence Proofs of Recursive Predicates. CADE (1984)
Ketan Mulmuley
A Semantic Characterization of Full Abstraction for Typed Lambda Calculi FOCS (1984)