BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
6 × USA
Collaborated with:
U.V.Vazirani V.V.Vazirani
Talks about:
parallel (2) matrix (2) proof (2) construct (1) arbitrari (1) algorithm (1) voronoi (1) respect (1) program (1) problem (1)

Person: Ketan Mulmuley

DBLP DBLP: Mulmuley:Ketan

Contributed to:

STOC 19971997
STOC 19941994
STOC 19911991
STOC 19901990
STOC 19871987
STOC 19861986
CADE 19841984

Wrote 7 papers:

STOC-1997-Mulmuley #algebra #exclamation #proving #question
Is There an Algebraic Proof for P != NC? (KM), pp. 210–219.
STOC-1994-Mulmuley #bound #linear #parallel #problem #programming
Lower bounds for parallel linear programming and other problems (KM), pp. 603–614.
Hidden Surface Removal with Respect to a Moving View Point (KM), pp. 512–522.
STOC-1990-Mulmuley #diagrams #order
Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k (KM), pp. 322–330.
STOC-1987-MulmuleyVV #matrix
Matching Is as Easy as Matrix Inversion (KM, UVV, VVV), pp. 345–354.
STOC-1986-Mulmuley #algorithm #matrix #parallel #performance #rank
A Fast Parallel Algorithm to Compute the Rank of a Matrix over an Arbitrary Field (KM), pp. 338–339.
CADE-1984-Mulmuley #proving #recursion
The Mechanization of Existence Proofs of Recursive Predicates (KM), pp. 460–475.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.