Kenneth L Clarkson

Overview

Kenneth L Clarkson

Title

Manager, Theory of Computation & Information; Distinguished Research Scientist

Location

IBM Research - Almaden San Jose, CA USA

Bio

My older Papers and Talks.

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 also work recognized here, and a (somewhat dated) survey on randomized geometric algorithms.

I've also worked on randomized numerical linear algebra, for example work recognized here

My data structure for nearest neighbor searching (named SB after Sam * and Becky *): please see here

Sadly, I have not managed to:

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

This page not under construction.