Ken Clarkson  Ken Clarkson photo         

contact information

Kenneth L. Clarkson
Manager, Theory of Computation & Information; Distinguished Research Scientist
Room B2-310, IBM Research, 650 Harry Road, San Jose, CA 95120


Professional Associations

Professional Associations:  ACM  |  IEEE   |  Society for Industrial and Applied Mathematics

more information

More information:  Papers and Talks  |  Journal of Computational Geometry  |  compgeom-announce mailing list  |  Journal of Discrete & Computational Geometry


My Papers and Talks. (Somewhat dated, please see public sources for more recent.)

My work has mainly been on geometric algorithms, and in particular on algorithms that have provable properties, but are relatively simple. Randomization is quite useful for this, whether via the Vapnik-Chervonenkis dimension, or using the general framework I introduced here. See, for example, a (somewhat dated) survey on randomized geometric algorithms.

I've also worked on randomized numerical linear algebra (see link at right).

My data structure for nearest neighbor searching (named SB after Sam * and Becky *): click the green triangle.




Sadly, I have not managed to:

And finally: sometimes we must bite the bull by the horns.


This page not under construction.