The Mechanization of Existence Proofs of Recursive Predicates. - Ketan Mulmuley (CADE, 1984)

A Semantic Characterization of Full Abstraction for Typed Lambda Calculi - Ketan Mulmuley (FOCS, 1984)

A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field - Ketan Mulmuley (STOC, 1986)

Fully Abstract Submodels of Typed Lambda Calculi. - Ketan Mulmuley (J. Comput. Syst. Sci., 1986)

Matching Is as Easy as Matrix Inversion - Ketan Mulmuley; Umesh V. Vazirani; Vijay V. Vazirani (STOC, 1987)

A Fast Planar Partition Algorithm, I (Extended Abstract) - Ketan Mulmuley (FOCS, 1988)

A Fast Planar Partition Algorithm, II. - Ketan Mulmuley (SCG, 1989)

On Obstructions in Relation to a Fixed Viewpoint - Ketan Mulmuley (FOCS, 1989)

An efficient algorithm for hidden surface removal. - Ketan Mulmuley (SIGGRAPH, 1989)

Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k - Ketan Mulmuley (STOC, 1990)

A Fast Planar Partition Algorithm, I. - Ketan Mulmuley (J. Symb. Comput., 1990)

A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces. - Ketan Mulmuley (SCG, 1991)

Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract). - Ketan Mulmuley (SCG, 1991)

Dynamic Point Location in Arrangements of Hyperplanes. - Ketan Mulmuley; Sandeep Sen (SCG, 1991)

Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract) - Ketan Mulmuley (FOCS, 1991)

Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract) - Ketan Mulmuley (FOCS, 1991)

Hidden Surface Removal with Respect to a Moving View Point - Ketan Mulmuley (STOC, 1991)

On Levels in Arrangement and Voronoi Diagrams. - Ketan Mulmuley (Discret. Comput. Geom., 1991)

Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract) - Ketan Mulmuley (FOCS, 1992)

Dynamic Point Location in Arrangement of Hyperplanes. - Ketan Mulmuley; Sandeep Sen (Discret. Comput. Geom., 1992)

Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements. - Ketan Mulmuley (SCG, 1993)

A lOwer Bound for Solvability of Polynomial Equations. - Ketan Mulmuley (FSTTCS, 1993)

Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements. - Ketan Mulmuley (J. Comput. Syst. Sci., 1993)

Computational geometry - an introduction through randomized algorithms. - Ketan Mulmuley (Prentice Hall, 1994)

Lower bounds for parallel linear programming and other problems. - Ketan Mulmuley (STOC, 1994)

Randomized Geometric Algorithms (Abstract). - Ketan Mulmuley (SWAT, 1994)

An Efficient Algorithm for Hidden Surface Removal, II. - Ketan Mulmuley (J. Comput. Syst. Sci., 1994)

Randomized Geometric Algorithms and Pseudorandom Generators. - Ketan Mulmuley (Algorithmica, 1996)

Is There an Algebraic Proof for P != NC? (Extended Abstract). - Ketan Mulmuley (STOC, 1997)

Parallel vs. Parametric Complexity (Abstract). - Ketan Mulmuley (WADS, 1997)

Lower Bounds in a Parallel Model without Bit Operations. - Ketan Mulmuley (SIAM J. Comput., 1999)

Randomized Algorithms in Computational Geometry. - Ketan Mulmuley (Handbook of Computational Geometry, 2000)

A Lower Bound for the Shortest Path Problem. - Ketan Mulmuley; Pradyut Shah (CCC, 2000)

Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems. - Ketan Mulmuley; Milind A. Sohoni (SIAM J. Comput., 2001)

Randomization and derandomization. - Otfried Cheong; Ketan Mulmuley; Edgar Ramos (Handbook of Discrete and Computational Geometry, 2nd Ed., 2004)

Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients - Ketan Mulmuley; Milind A. Sohoni (CoRR, 2005)

Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry - Ketan Mulmuley (CoRR, 2007)

Geometric Complexity Theory: Introduction - Ketan Mulmuley; Milind A. Sohoni (CoRR, 2007)

On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view - Ketan Mulmuley (CoRR, 2007)

Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem - Ketan Mulmuley (CoRR, 2007)

Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups - Ketan Mulmuley (CoRR, 2007)

Geometric Complexity Theory IV: quantum group for the Kronecker problem - Ketan Mulmuley; Milind A. Sohoni (CoRR, 2007)

Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties. - Ketan Mulmuley; Milind A. Sohoni (SIAM J. Comput., 2008)

On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier - Ketan Mulmuley (CoRR, 2009)

On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis - Ketan Mulmuley (CoRR, 2009)

Explicit Proofs and The Flip - Ketan Mulmuley (CoRR, 2010)

On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna. - Ketan Mulmuley (J. ACM, 2011)

Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma. - Ketan Mulmuley (FOCS, 2012)

The GCT program toward the P vs. NP problem. - Ketan Mulmuley (Commun. ACM, 2012)

Boundaries of VP and VNP. - Joshua A. Grochow; Ketan D. Mulmuley; Youming Qiao (ICALP, 2016)

On vanishing of Kronecker coefficients. - Christian Ikenmeyer; Ketan D. Mulmuley; Michael Walter 005 (Comput. Complex., 2017)

Membership in Moment Polytopes is in NP and coNP. - Peter Bürgisser; Matthias Christandl; Ketan D. Mulmuley; Michael Walter 005 (SIAM J. Comput., 2017)