Person:1686839

Available identifiers

zbMath Open mulmuley.ketan-dMaRDI QIDQ1686839

List of research outcomes

Publication	Date of Publication	Type
Boundaries of VP and VNP	2017-12-19	Paper
On vanishing of Kronecker coefficients	2017-12-18	Paper
Membership in Moment Polytopes is in NP and coNP	2017-06-28	Paper
Geometric complexity theory V: Efficient algorithms for Noether normalization	2016-10-18	Paper
Lower bounds for parallel linear programming and other problems	2016-09-01	Paper
On P vs. NP and geometric complexity theory	2011-07-14	Paper
A lower bound for the shortest path problem	2002-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q4526984	2001-02-28	Paper
An efficient algorithm for hidden surface removal. II	2000-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4945517	2000-03-23	Paper
https://portal.mardi4nfdi.de/entity/Q4268453	1999-10-31	Paper
Lower Bounds in a Parallel Model without Bit Operations	1999-10-28	Paper
https://portal.mardi4nfdi.de/entity/Q4230330	1999-04-22	Paper
https://portal.mardi4nfdi.de/entity/Q4401024	1998-08-02	Paper
Randomized geometric algorithms and pseudorandom generators	1996-10-13	Paper
A fast planar partition algorithm, II	1994-11-13	Paper
Output sensitive and dynamic constructions of higher order Voronoi diagrams and levels in arrangements	1994-03-24	Paper
https://portal.mardi4nfdi.de/entity/Q3134498	1993-09-06	Paper
Dynamic point location in arrangements of hyperplanes	1993-01-16	Paper
A generalization of Dehn-Sommerville relations to simple stratified spaces	1992-12-14	Paper
On levels in arrangements and Voronoi diagrams	1991-01-01	Paper
A fast planar partition algorithm. I	1990-01-01	Paper
Matching is as easy as matrix inversion	1987-01-01	Paper
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field	1987-01-01	Paper
Fully abstract submodels of typed lambda calculi	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3336725	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3675549	1984-01-01	Paper

Research outcomes over time

This page was built for person: Ketan D. Mulmuley