The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ketan Mulmuley: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  47. On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier [Citation Graph (, )][DBLP]


  48. On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis [Citation Graph (, )][DBLP]


Search in 0.095secs, Finished in 0.097secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002