Ketan Mulmuley

56 papers A* 14A 2B 1Journal 29Unranked 7

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