Ketan Mulmuley

Q: What Schools Are Affiliated With Ketan Mulmuley

Ketan Mulmuley is affiliated with the following schools: Northwestern University , Rutgers University, University of Chicago, Carnegie Mellon University

Ketan Mulmuley's AcademicInfluence.com Rankings

Ketan Mulmuley

Computer Science

#1591

World Rank

#1646

Historical Rank

Database

#8383

World Rank

#8772

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Ketan Mulmuley Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ketan Mulmuley is a professor in the Department of Computer Science at the University of Chicago, and a sometime visiting professor at IIT Bombay. He specializes in theoretical computer science, especially computational complexity theory, and in recent years has been working on "geometric complexity theory", an approach to the P versus NP problem through the techniques of algebraic geometry, with Milind Sohoni of IIT Bombay. He is also known for his result with Umesh Vazirani and Vijay Vazirani that showed that "Matching is as easy as matrix inversion", in a paper that introduced the isolation lemma.

(See a Problem?)

Ketan Mulmuley's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Matching is as easy as matrix inversion (1987) (770)
Computational geometry - an introduction through randomized algorithms (1994) (612)
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems (2002) (240)
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field (1986) (207)
A fast planar partition algorithm. I (1988) (193)
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties (2006) (127)
An efficient algorithm for hidden surface removal (1989) (82)
On levels in arrangements and voronoi diagrams (1991) (74)
Full Abstraction and Semantic Equivalence (1987) (63)
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma (2012) (59)
The GCT program toward the P vs. NP problem (2012) (54)
On vanishing of Kronecker coefficients (2015) (53)
On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna (2011) (51)
Geometric complexity theory III: on deciding nonvanishing of a Littlewood–Richardson coefficient (2012) (48)
Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry (2007) (44)
Geometric Complexity Theory V: Efficient algorithms for Noether Normalization (2012) (42)
A fast planar partition algorithm, II (1989) (42)
Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract) (1991) (40)
Randomized multidimensional search trees: lazy balancing and dynamic shuffling (1991) (37)
Randomized geometric algorithms and pseudorandom generators (1992) (34)
Geometric Complexity Theory, P vs. NP and Explicit Obstructions (2003) (33)
Hidden surface removal with respect to a moving view point (1991) (33)
A lower bound for the shortest path problem (2000) (33)
Geometric Complexity Theory IV: Nonstandard Quantum Group for the Kronecker Problem (2007) (31)
Lower Bounds in a Parallel Model without Bit Operations (1999) (30)
Randomized multidimensional search trees: further results in dynamic sampling (1991) (29)
Boundaries of VP and VNP (2016) (28)
Geometric Complexity Theory VI : The flip via positivity Dedicated to Sri (2010) (26)
Randomized multidimensional search trees (extended abstract): dynamic sampling (1991) (23)
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem (2007) (23)
Geometric Complexity Theory IV: quantum group for the Kronecker problem (2007) (22)
Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients (2005) (22)
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups (2007) (21)
Membership in Moment Polytopes is in NP and coNP (2015) (19)
A fast planar partition algorithm, II (1991) (19)
Dynamic point location in arrangements of hyperplanes (1991) (17)
An Efficient Algorithm for Hidden Surface Removal, II (1994) (16)
On obstructions in relation to a fixed viewpoint (1989) (14)
Symmetry and equivalence relations in classical and geometric complexity theory (2012) (14)
Output sensitive construction of levels and Voronoi diagrams in Rd of order 1 to k (1990) (13)
On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view (2007) (12)
Fully Abstract Submodels of Typed Lambda Calculi (1986) (12)
Dehn-Sommerville relations, upper bound theorem, and levels in arrangements (1993) (12)
Rapidly Mixing Markov Chains (1996) (12)
Explicit Proofs and The Flip (2010) (12)
Randomized Algorithms in Computational Geometry (2000) (9)
Randomized algorithms (1997) (7)
Explicit Polynomial Sequences with Maximal Spaces of Partial Derivatives and a Question of K. (2019) (7)
A fast planar partition algorithm: Part I (1988) (7)
On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis (2009) (6)
A Semantic Characterization of Full Abstraction for Typed Lambda Calculi (1984) (6)
Lower bounds for parallel linear programming and other problems (1994) (5)
Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements (1993) (5)
The Mechanization of Existence Proofs of Recursive Predicates (1984) (5)
A Fast Planar Partition Algorithm, I (Extended Abstract) (1988) (4)
Is there an algebraic proof for P ≠ NC? (extended abstract) (1997) (3)
Geometric Complexity Theory: Introduction (2007) (3)
A generalization of dehn-sommerville relations to simple stratified spaces (1991) (3)
Randomization and derandomization (2004) (3)
Computational Geometry (1993) (3)
Geometric Complexity Theory III: on deciding positivity of Littlewood-Richardson coefficients (2021) (2)
A lOwer Bound for Solvability of Polynomial Equations (1993) (2)
On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier (2009) (1)
Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract) (1992) (1)
Lower bounds for parallel algorithms (2001) (1)
Parallel vs. Parametric Complexity (Abstract) (1997) (1)
A mechanizable theory for existence proofs of inclusive predicates (2015) (1)
Geometric Complexity Theory , and the Riemann Hypothesis Dedicated to Sri Ramakrishna (2009) (1)
A semantic characterization of full abstraction (1984) (1)
Lattice based algorithms (1984) (0)
44 RANDOMIZATION AND DERANDOMIZATION (2016) (0)
Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
A Lower Bound on Computing Blocking Flows in Graphs (2001) (0)
On Vanishing of Kronecker Coefficients ; On Vanishing of {K}ronecker Coefficients (2015) (0)
Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
Lecture 1 : Geometric Complexity Theory Overview (2003) (0)
Geometric complexity theory III: on deciding nonvanishing of a Littlewood–Richardson coefficient (2011) (0)
A simple online algorithm for constructing Voronoi diagrams (Revised March 8, 1991) (1991) (0)
Randomized Geometric Algorithms (Abstract) (1994) (0)
Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)

This paper list is powered by the following services:

Other Resources About Ketan Mulmuley

en.wikipedia.org

What Schools Are Affiliated With Ketan Mulmuley?

Ketan Mulmuley is affiliated with the following schools: