Ketan Mulmuley - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 41 from 41

2012

NP problemKetan Mulmuley. CACM, 55(6):98-107, 2012. [doi]

Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether's Normalization LemmaKetan Mulmuley. focs 2012: 629-638 [doi]

2008

Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class VarietiesKetan Mulmuley, Milind A. Sohoni. SICOMP, 38(3):1175-1206, 2008. [doi]

2001

A Lower Bound for the Shortest Path ProblemKetan Mulmuley, Pradyut Shah. jcss, 63(2):253-267, 2001.

Geometric Complexity Theory I: An Approach to the P vs. NP and Related ProblemsKetan Mulmuley, Milind A. Sohoni. SICOMP, 31(2):496-526, 2001. [doi]

2000

A Lower Bound for the Shortest Path ProblemKetan Mulmuley, Pradyut Shah. cocoon 2000: 14-21 [doi]

Randomized Algorithms in Computational GeometryKetan Mulmuley. In Jörg-Rüdiger Sack, Jorge Urrutia, editors, Handbook of Computational Geometry. pages 703-724, North Holland / Elsevier, 2000. [doi]

1999

Lower Bounds in a Parallel Model without Bit OperationsKetan Mulmuley. SICOMP, 28(4):1460-1509, 1999.

1997

Is There an Algebraic Proof for ::::P != NC::::? (Extended Abstract)Ketan Mulmuley. stoc 1997: 210-219 [doi]

Parallel vs. Parametric Complexity (Abstract)Ketan Mulmuley. wads 1997: 282-283

1996

Randomized Geometric Algorithms and Pseudorandom GeneratorsKetan Mulmuley. algorithmica, 16(4/5):450-463, 1996.

1994

Lower bounds for parallel linear programming and other problemsKetan Mulmuley. stoc 1994: 603-614 [doi]

Randomized Geometric Algorithms (Abstract)Ketan Mulmuley. swat 1994: 252-254

An Efficient Algorithm for Hidden Surface Removal, IIKetan Mulmuley. jcss, 49(3):427-453, 1994.

1993

A lOwer Bound for Solvability of Polynomial EquationsKetan Mulmuley. fsttcs 1993: 268-283

A Generalization of Dehn-Sommerville Relations to Simple Stratified SpacesKetan Mulmuley. dcg, 9:47-55, 1993.

Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in ArrangementsKetan Mulmuley. jcss, 47(3):437-458, 1993.

Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in ArrangementsKetan Mulmuley. compgeom 1993: 240-246 [doi]

1992

Dynamic Point Location in Arrangement of HyperplanesKetan Mulmuley, Sandeep Sen. dcg, 8:335-360, 1992.

Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract)Ketan Mulmuley. focs 1992: 90-100

1991

A Fast Planar Partition Algorithm, IIKetan Mulmuley. JACM, 38(1):74-103, 1991. [doi]

Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract)Ketan Mulmuley. focs 1991: 216-227

On Levels in Arrangement and Voronoi DiagramsKetan Mulmuley. dcg, 6:307-338, 1991.

Dynamic Point Location in Arrangements of HyperplanesKetan Mulmuley, Sandeep Sen. compgeom 1991: 132-141 [doi]

Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract)Ketan Mulmuley. focs 1991: 180-196

Hidden Surface Removal with Respect to a Moving View PointKetan Mulmuley. stoc 1991: 512-522

Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract)Ketan Mulmuley. compgeom 1991: 121-131 [doi]

A Generalization of Dehn-Sommerville Relations to Simple Stratified SpacesKetan Mulmuley. compgeom 1991: 115-120 [doi]

1990

Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to kKetan Mulmuley. stoc 1990: 322-330

A Fast Planar Partition Algorithm, IKetan Mulmuley. JSC, 10(3/4):253-280, 1990.

1989

An efficient algorithm for hidden surface removalKetan Mulmuley. siggraph 1989: 379-388 [doi]

On Obstructions in Relation to a Fixed ViewpointKetan Mulmuley. focs 1989: 592-597

A Fast Planar Partition Algorithm, IIKetan Mulmuley. compgeom 1989: 33-43 [doi]

1988

A Fast Planar Partition Algorithm, I (Extended Abstract)Ketan Mulmuley. focs 1988: 580-589

1987

A fast parallel algorithm to compute the rank of a matrix over an arbitrary fieldKetan Mulmuley. combinatorica, 7(1):101-104, 1987.

Matching Is as Easy as Matrix InversionKetan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani. stoc 1987: 345-354

Matching is as easy as matrix inversionKetan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani. combinatorica, 7(1):105-113, 1987.

1986

Fully Abstract Submodels of Typed Lambda CalculiKetan Mulmuley. jcss, 33(1):2-46, 1986.

A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary FieldKetan Mulmuley. stoc 1986: 338-339

1984

A Semantic Characterization of Full Abstraction for Typed Lambda CalculiKetan Mulmuley. focs 1984: 279-288

The Mechanization of Existence Proofs of Recursive PredicatesKetan Mulmuley. cade 1984: 460-475

Sign in or sign up to see more results.

runs on WebDSL