Ketan Mulmuley
According to our database^{1},
Ketan Mulmuley
authored at least 52 papers
between 1984 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at id.loc.gov

at dl.acm.org
On csauthors.net:
Bibliography
2017
SIAM J. Comput., 2017
Comput. Complex., 2017
2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
2012
Commun. ACM, 2012
Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization Lemma.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
J. ACM, 2011
2010
CoRR, 2010
2009
CoRR, 2009
On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier
CoRR, 2009
2008
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties.
SIAM J. Comput., 2008
2007
CoRR, 2007
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups
CoRR, 2007
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
CoRR, 2007
CoRR, 2007
CoRR, 2007
Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry
CoRR, 2007
2005
Geometric Complexity III: on deciding positivity of LittlewoodRichardson coefficients
CoRR, 2005
2004
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004
2001
SIAM J. Comput., 2001
J. Comput. Syst. Sci., 2001
2000
Proceedings of the Handbook of Computational Geometry, 2000
1999
SIAM J. Comput., 1999
1997
Proceedings of the Algorithms and Data Structures, 5th International Workshop, 1997
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
1996
Algorithmica, 1996
1994
J. Comput. Syst. Sci., 1994
Proceedings of the Algorithm Theory, 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Computational geometry  an introduction through randomized algorithms.
Prentice Hall, ISBN: 9780133363630, 1994
1993
Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements.
J. Comput. Syst. Sci., 1993
Discret. Comput. Geom., 1993
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993
1992
Discret. Comput. Geom., 1992
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992
1991
J. ACM, 1991
Discret. Comput. Geom., 1991
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract)
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991
1990
J. Symb. Comput., 1990
Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990
1989
Proceedings of the 16th Annual Conference on Computer Graphics and Interactive Techniques, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1987
Comb., 1987
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field.
Comb., 1987
1986
J. Comput. Syst. Sci., 1986
1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
Proceedings of the 7th International Conference on Automated Deduction, 1984