BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
8 × USA
Collaborated with:
D.P.Woodruff
Talks about:
algorithm (3) approxim (3) time (2) probabilist (1) triangul (1) sparsiti (1) shortest (1) neighbor (1) geometri (1) regress (1)

Person: Kenneth L. Clarkson

DBLP DBLP: Clarkson:Kenneth_L=

Contributed to:

STOC 20132013
STOC 20092009
STOC 20062006
STOC 19971997
STOC 19871987
STOC 19861986
STOC 19851985
STOC 19841984

Wrote 8 papers:

STOC-2013-ClarksonW #approximate #rank
Low rank approximation and regression in input sparsity time (KLC, DPW), pp. 81–90.
STOC-2009-ClarksonW #algebra #linear #streaming
Numerical linear algebra in the streaming model (KLC, DPW), pp. 205–214.
STOC-2006-Clarkson #using
Building triangulations using epsilon-nets (KLC), pp. 326–335.
STOC-1997-Clarkson #metric #nearest neighbour #query
Nearest Neighbor Queries in Metric Spaces (KLC), pp. 609–617.
STOC-1987-Clarkson #algorithm #approximate
Approximation Algorithms for Shortest Path Motion Planning (KLC), pp. 56–65.
STOC-1986-Clarkson #geometry #random
Further Applications of Random Sampling to Computational Geometry (KLC), pp. 414–423.
STOC-1985-Clarkson #algorithm #probability #problem
A Probabilistic Algorithm for the Post Office Problem (KLC), pp. 175–184.
STOC-1984-Clarkson #algorithm #approximate #geometry #performance
Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (KLC), pp. 342–348.

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.