Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Mulmuley, K."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Randomized geometric algorithms and pseudorandom generators
K. Mulmuley
Algorithmica
16
, 1996, pp. 450-463
A fast planar partition algorithm, II
K. Mulmuley
Journal of the ACM
38
(1), 1991, January, pp. 74-103
Output sensitive construction of levels and Voronoi diagrams in
R^d
of order
l
to
k
K. Mulmuley
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 322-330
On obstructions in relation to a fixed viewpoint
K. Mulmuley
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 592-597
A fast planar partition algorithm, I
K. Mulmuley
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 580-589
Matching is as easy as matrix inversion
K. Mulmuley
,
U.V. Vazirani
,
V.V. Vazirani
Combinatorica
7
(1), 1987, pp. 105-120
Matching is as easy as matrix inversion
K. Mulmuley
,
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 345-354
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
K. Mulmuley
Combinatorica
7
(1), 1987, pp. 101-104
Fully abstract submodels of typed lambda calculi
K. Mulmuley
Journal of Computer and System Sciences
33
(1), 1986, August, pp. 2-46
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
K. Mulmuley
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 338-339
A semantic characterization of full abstraction for typed lambda calculi
K. Mulmuley
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 279-288
A parallel algorithm for matching
K. Mulmuley
,
U. Vazirani
,
V. Vazirani
misc
Matching is as easy as matrix inversion
K. Mulmuley
,
U. Vazirani
,
V. Vazirani
misc