Ketan Mulmuley
Affiliations: | University of Chicago, Chicago, IL |
Area:
Computer ScienceGoogle:
"Ketan Mulmuley"Parents
Sign in to add mentor| Dana Stewart Scott | grad student | 1985 | Carnegie Mellon (Philosophy Tree) | |
| (Full Abstraction and Semantic Equivalence) | ||||
Children
Sign in to add trainee| Pradyut Shah | grad student | 2001 | Chicago |
| Joshua A. Grochow | grad student | 2012 | Chicago |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Mulmuley K, Shah P. (2001) A Lower Bound for the Shortest Path Problem Journal of Computer and System Sciences. 63: 253-267 |
| Mulmuley K. (1999) Lower bounds in a parallel model without bit operations Siam Journal On Computing. 28: 1460-1509 |
| Mulmuley K. (1997) Parallel vs. parametric complexity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1272: 282-283 |
| Mulmuley K. (1996) Randomized Geometric Algorithms and Pseudorandom Generators Algorithmica (New York). 16: 450-463 |
| Mulmuley K. (1993) Output sensitive and dynamic constructions of higher order voronoi diagrams and levels in arrangements Journal of Computer and System Sciences. 47: 437-458 |
| Mulmuley K, Sen S. (1992) Dynamic point location in arrangements of hyperplanes Discrete &Amp; Computational Geometry. 8: 335-360 |
| Mulmuley K. (1991) A Fast Planar Partition Algorithm, II Journal of the Acm (Jacm). 38: 74-103 |
| Mulmuley K. (1991) On levels in arrangements and voronoi diagrams Discrete &Amp; Computational Geometry. 6: 307-338 |
| Mulmuley K, Vazirani UV, Vazirani VV. (1987) Matching is as easy as matrix inversion Combinatorica. 7: 105-113 |
| Mulmuley K. (1987) A fast parallel algorithm to compute the rank of a matrix over an arbitrary field Combinatorica. 7: 101-104 |