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="Clarkson, K.L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combinatorial complexity bounds for arrangements of curves and surfaces
K.L. Clarkson
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
,
E. Welzl
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 568-579
A Las Vegas algorithm for linear programming when the dimension is small
K.L. Clarkson
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 452-456
Further applications of random sampling to computational geometry
K.L. Clarkson
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 414-423
Linear programming in
O(n\cdot 3^{d^2})
time
K.L. Clarkson
Information Processing Letters
22
(1), 1986, January, pp. 21-24
Fast algorithms for the all nearest neighbors problem
K.L. Clarkson
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 226-232