Search results for "Ketan Mulmuley"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Ketan Mulmuley	On P vs. NP and geometric complexity theory: Dedicated to Sri Ramakrishna.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Explicit Proofs and The Flip	CoRR	2010	DBLP BibTeX RDF
1	Ketan Mulmuley	On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier	CoRR	2009	DBLP BibTeX RDF
1	Ketan Mulmuley	On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis	CoRR	2009	DBLP BibTeX RDF
1	Ketan Mulmuley, Milind A. Sohoni	Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups	CoRR	2007	DBLP BibTeX RDF
1	Ketan Mulmuley	Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem	CoRR	2007	DBLP BibTeX RDF
1	Ketan Mulmuley, Hariharan Narayanan	Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient	CoRR	2007	DBLP BibTeX RDF
1	Ketan Mulmuley, Milind A. Sohoni	Geometric Complexity Theory IV: quantum group for the Kronecker problem	CoRR	2007	DBLP BibTeX RDF
1	Ketan Mulmuley, Milind A. Sohoni	Geometric Complexity Theory: Introduction	CoRR	2007	DBLP BibTeX RDF
1	Ketan Mulmuley	On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view	CoRR	2007	DBLP BibTeX RDF
1	Ketan Mulmuley	Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry	CoRR	2007	DBLP BibTeX RDF
1	Ketan Mulmuley, Milind A. Sohoni	Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties	CoRR	2006	DBLP BibTeX RDF
1	Ketan Mulmuley, Milind A. Sohoni	Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients	CoRR	2005	DBLP BibTeX RDF
1	Ketan Mulmuley, Pradyut Shah	A Lower Bound for the Shortest Path Problem.	J. Comput. Syst. Sci.	2001	DBLP DOI BibTeX RDF
1	Ketan Mulmuley, Milind A. Sohoni	Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems.	SIAM J. Comput.	2001	DBLP DOI BibTeX RDF
1	Ketan Mulmuley, Pradyut Shah	A Lower Bound for the Shortest Path Problem. (PDF / PS)	IEEE Conference on Computational Complexity	2000	DBLP DOI BibTeX RDF	parallel, lower bound, shortest path problem
1	Ketan Mulmuley	Lower Bounds in a Parallel Model without Bit Operations.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Parallel vs. Parametric Complexity (Abstract).	WADS	1997	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Is There an Algebraic Proof for P != NC? (Extended Abstract).	STOC	1997	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Randomized Geometric Algorithms and Pseudorandom Generators.	Algorithmica	1996	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	An Efficient Algorithm for Hidden Surface Removal, II.	J. Comput. Syst. Sci.	1994	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Computational geometry - an introduction through randomized algorithms.		1994	RDF
1	Ketan Mulmuley	Randomized Geometric Algorithms (Abstract).	SWAT	1994	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Lower bounds for parallel linear programming and other problems.	STOC	1994	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.	Discrete & Computational Geometry	1993	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Output Sensitive and Dynamic Constructions of Higher Order Voronoi Diagrams and Levels in Arrangements.	J. Comput. Syst. Sci.	1993	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Dehn-Sommerville Relations, Upper Bound Theorem, and Levels in Arrangements.	Symposium on Computational Geometry	1993	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A lOwer Bound for Solvability of Polynomial Equations.	FSTTCS	1993	DBLP DOI BibTeX RDF
1	Ketan Mulmuley, Sandeep Sen	Dynamic Point Location in Arrangement of Hyperplanes.	Discrete & Computational Geometry	1992	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Randomized Geometric Algorithms and Pseudo-Random Generators (Extended Abstract)	FOCS	1992	DBLP DOI BibTeX RDF	expected running times, computational geometry, Voronoi diagram, pseudo-random generators, convex polytope, Quicksort, randomized incremental algorithms
1	Ketan Mulmuley	A Fast Planar Partition Algorithm, II.	J. ACM	1991	DBLP DOI BibTeX RDF	randomized geometric algorithms, computational complexity, computational geometry, hidden surface removal, planar subdivision
1	Ketan Mulmuley	On Levels in Arrangement and Voronoi Diagrams.	Discrete & Computational Geometry	1991	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A Generalization of Dehn-Sommerville Relations to Simple Stratified Spaces.	Symposium on Computational Geometry	1991	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract).	Symposium on Computational Geometry	1991	DBLP DOI BibTeX RDF
1	Ketan Mulmuley, Sandeep Sen	Dynamic Point Location in Arrangements of Hyperplanes.	Symposium on Computational Geometry	1991	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Randomized Multidimensional Search Trees: Lazy Balancing and Dynamic Shuffling (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	randomised multidimensional search trees, lazy balancing, dynamic shuffling, sorted lists, rotation operation, imaginary sequence, computational geometry
1	Ketan Mulmuley	Randomized Multidimensional Search Trees: Further Results in Dynamic Sampling (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	half space range queries, randomized multidimensional search trees, dynamic sampling, dynamic search structures, 3-D partitions, possibly interesting polygons, dynamic nearest-k-neighbor queries, algorithm, running time, random sequence
1	Ketan Mulmuley	Hidden Surface Removal with Respect to a Moving View Point	STOC	1991	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A Fast Planar Partition Algorithm, I.	J. Symb. Comput.	1990	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k	STOC	1990	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	An efficient algorithm for hidden surface removal.	SIGGRAPH	1989	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A Fast Planar Partition Algorithm, II.	Symposium on Computational Geometry	1989	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	On Obstructions in Relation to a Fixed Viewpoint	FOCS	1989	DBLP DOI BibTeX RDF	obstructions, fixed viewpoint, combinatorial tool, mathematical series, complexity, randomized algorithms, Voronoi diagrams, hyperplanes, hidden surface removal, geometric problems
1	Ketan Mulmuley	A Fast Planar Partition Algorithm, I (Extended Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	global evolution, fast planar partition algorithm, fast randomized algorithm, linear segments, input segments, points of intersection, plane
1	Ketan Mulmuley	A fast parallel algorithm to compute the rank of a matrix over an arbitrary field.	Combinatorica	1987	DBLP DOI BibTeX RDF
1	Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani	Matching is as easy as matrix inversion.	Combinatorica	1987	DBLP DOI BibTeX RDF
1	Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani	Matching Is as Easy as Matrix Inversion	STOC	1987	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	Fully Abstract Submodels of Typed Lambda Calculi.	J. Comput. Syst. Sci.	1986	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field	STOC	1986	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	The Mechanization of Existence Proofs of Recursive Predicates.	CADE	1984	DBLP DOI BibTeX RDF
1	Ketan Mulmuley	A Semantic Characterization of Full Abstraction for Typed Lambda Calculi	FOCS	1984	DBLP DOI BibTeX RDF

Publications of "Ketan Mulmuley" ( http://dblp.L3S.de/Authors/Ketan_Mulmuley )