| 2008 |
|---|
| 47 | EE | Ketan Mulmuley,
Milind A. Sohoni:
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties.
SIAM J. Comput. 38(3): 1175-1206 (2008) |
| 2007 |
|---|
| 46 | EE | Ketan Mulmuley,
Hariharan Narayanan:
Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient
CoRR abs/0704.0213: (2007) |
| 45 | EE | Ketan Mulmuley:
Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry
CoRR abs/0704.0229: (2007) |
| 44 | EE | Ketan Mulmuley,
Milind A. Sohoni:
Geometric Complexity Theory: Introduction
CoRR abs/0709.0746: (2007) |
| 43 | EE | Ketan Mulmuley:
On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view
CoRR abs/0709.0748: (2007) |
| 42 | EE | Ketan Mulmuley:
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
CoRR abs/0709.0749: (2007) |
| 41 | EE | Ketan Mulmuley:
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups
CoRR abs/0709.0751: (2007) |
| 40 | EE | Ketan Mulmuley,
Milind A. Sohoni:
Geometric Complexity Theory IV: quantum group for the Kronecker problem
CoRR abs/cs/0703110: (2007) |
| 2006 |
|---|
| 39 | EE | Ketan Mulmuley,
Milind A. Sohoni:
Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties
CoRR abs/cs/0612134: (2006) |
| 2005 |
|---|
| 38 | EE | Ketan Mulmuley,
Milind A. Sohoni:
Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients
CoRR abs/cs/0501076: (2005) |
| 2001 |
|---|
| 37 | | Ketan Mulmuley,
Pradyut Shah:
A Lower Bound for the Shortest Path Problem.
J. Comput. Syst. Sci. 63(2): 253-267 (2001) |
| 36 | EE | Ketan Mulmuley,
Milind A. Sohoni:
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems.
SIAM J. Comput. 31(2): 496-526 (2001) |
| 2000 |
|---|
| 35 | EE | Ketan Mulmuley,
Pradyut Shah:
A Lower Bound for the Shortest Path Problem.
IEEE Conference on Computational Complexity 2000: 14-21 |
| 1999 |
|---|
| 34 | | Ketan Mulmuley:
Lower Bounds in a Parallel Model without Bit Operations.
SIAM J. Comput. 28(4): 1460-1509 (1999) |
| 1997 |
|---|
| 33 | EE | Ketan Mulmuley:
Is There an Algebraic Proof for P != NC? (Extended Abstract).
STOC 1997: 210-219 |
| 32 | | Ketan Mulmuley:
Parallel vs. Parametric Complexity (Abstract).
WADS 1997: 282-283 |
| 1996 |
|---|
| 31 | | Ketan Mulmuley:
Randomized Geometric Algorithms and Pseudorandom Generators.
Algorithmica 16(4/5): 450-463 (1996) |
| 1994 |
|---|
| 30 | EE | Ketan Mulmuley:
Lower bounds for parallel linear programming and other problems.
STOC 1994: 603-614 |
| 29 | | Ketan Mulmuley:
Randomized Geometric Algorithms (Abstract).
SWAT 1994: 252-254 |
| 28 | | Ketan Mulmuley:
An Efficient Algorithm for Hidden Surface Removal, II.
J. Comput. Syst. Sci. 49(3): 427-453 (1994) |
| 1993 |
|---|
| 27 | | Ketan Mulmuley:
A lOwer Bound for Solvability of Polynomial Equations.
FSTTCS 1993: 268-283 |
| 26 | EE | Ketan Mulmuley:
Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements.
Symposium on Computational Geometry 1993: 240-246 |
| 25 | | Ketan Mulmuley:
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.
Discrete & Computational Geometry 9: 47-55 (1993) |
| 24 | | Ketan Mulmuley:
Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements.
J. Comput. Syst. Sci. 47(3): 437-458 (1993) |
| 1992 |
|---|
| 23 | | Ketan Mulmuley:
Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract)
FOCS 1992: 90-100 |
| 22 | | Ketan Mulmuley,
Sandeep Sen:
Dynamic Point Location in Arrangement of Hyperplanes.
Discrete & Computational Geometry 8: 335-360 (1992) |
| 1991 |
|---|
| 21 | | Ketan Mulmuley:
Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract)
FOCS 1991: 180-196 |
| 20 | | Ketan Mulmuley:
Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract)
FOCS 1991: 216-227 |
| 19 | | Ketan Mulmuley:
Hidden Surface Removal with Respect to a Moving View Point
STOC 1991: 512-522 |
| 18 | EE | Ketan Mulmuley:
A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.
Symposium on Computational Geometry 1991: 115-120 |
| 17 | EE | Ketan Mulmuley:
Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract).
Symposium on Computational Geometry 1991: 121-131 |
| 16 | EE | Ketan Mulmuley,
Sandeep Sen:
Dynamic Point Location in Arrangements of Hyperplanes.
Symposium on Computational Geometry 1991: 132-141 |
| 15 | | Ketan Mulmuley:
On Levels in Arrangement and Voronoi Diagrams.
Discrete & Computational Geometry 6: 307-338 (1991) |
| 14 | EE | Ketan Mulmuley:
A Fast Planar Partition Algorithm, II.
J. ACM 38(1): 74-103 (1991) |
| 1990 |
|---|
| 13 | | Ketan Mulmuley:
Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k
STOC 1990: 322-330 |
| 12 | | Ketan Mulmuley:
A Fast Planar Partition Algorithm, I.
J. Symb. Comput. 10(3/4): 253-280 (1990) |
| 1989 |
|---|
| 11 | | Ketan Mulmuley:
On Obstructions in Relation to a Fixed Viewpoint
FOCS 1989: 592-597 |
| 10 | EE | Ketan Mulmuley:
An efficient algorithm for hidden surface removal.
SIGGRAPH 1989: 379-388 |
| 9 | EE | Ketan Mulmuley:
A Fast Planar Partition Algorithm, II.
Symposium on Computational Geometry 1989: 33-43 |
| 1988 |
|---|
| 8 | | Ketan Mulmuley:
A Fast Planar Partition Algorithm, I (Extended Abstract)
FOCS 1988: 580-589 |
| 1987 |
|---|
| 7 | | Ketan Mulmuley,
Umesh V. Vazirani,
Vijay V. Vazirani:
Matching Is as Easy as Matrix Inversion
STOC 1987: 345-354 |
| 6 | | Ketan Mulmuley:
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field.
Combinatorica 7(1): 101-104 (1987) |
| 5 | | Ketan Mulmuley,
Umesh V. Vazirani,
Vijay V. Vazirani:
Matching is as easy as matrix inversion.
Combinatorica 7(1): 105-113 (1987) |
| 1986 |
|---|
| 4 | | Ketan Mulmuley:
A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field
STOC 1986: 338-339 |
| 3 | | Ketan Mulmuley:
Fully Abstract Submodels of Typed Lambda Calculi.
J. Comput. Syst. Sci. 33(1): 2-46 (1986) |
| 1984 |
|---|
| 2 | | Ketan Mulmuley:
The Mechanization of Existence Proofs of Recursive Predicates.
CADE 1984: 460-475 |
| 1 | | Ketan Mulmuley:
A Semantic Characterization of Full Abstraction for Typed Lambda Calculi
FOCS 1984: 279-288 |
