Kenneth L. Clarkson
Encyclopedia
Kenneth Lee Clarkson is a researcher at the IBM Almaden Research Center, and co-editor-in-chief of the Journal of Computational Geometry. He received his Ph.D. from Stanford University
in 1984, under the supervision of Andrew Yao
; and until 2007 worked for Bell Labs
. Clarkson is known for his work with Peter Shor
on applications of random sampling in geometric algorithms
and for related work on randomized geometric algorithms for linear programming
and nearest neighbor
data structure
s. In 1998 he was co-chair of the ACM
Symposium on Computational Geometry, and in 2008 he was elected a Fellow
of the ACM for his “contributions to computational geometry.”
Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is a private research university on an campus located near Palo Alto, California. It is situated in the northwestern Santa Clara Valley on the San Francisco Peninsula, approximately northwest of San...
in 1984, under the supervision of Andrew Yao
Andrew Yao
Andrew Chi-Chih Yao is a prominent computer scientist and computational theorist. Yao used the minimax theorem to prove what is now known as Yao's Principle.Yao was born in Shanghai, China...
; and until 2007 worked for Bell Labs
Bell Labs
Bell Laboratories is the research and development subsidiary of the French-owned Alcatel-Lucent and previously of the American Telephone & Telegraph Company , half-owned through its Western Electric manufacturing subsidiary.Bell Laboratories operates its...
. Clarkson is known for his work with Peter Shor
Peter Shor
Peter Williston Shor is an American professor of applied mathematics at MIT, most famous for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical...
on applications of random sampling in geometric algorithms
Computational geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational...
and for related work on randomized geometric algorithms for linear programming
Linear programming
Linear programming is a mathematical method for determining a way to achieve the best outcome in a given mathematical model for some list of requirements represented as linear relationships...
and nearest neighbor
Nearest neighbor
Nearest neighbor may refer to:* Nearest neighbor search in pattern recognition and in computational geometry* Nearest-neighbor interpolation for interpolating data* Nearest neighbor graph in geometry...
data structure
Data structure
In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks...
s. In 1998 he was co-chair of the ACM
Association for Computing Machinery
The Association for Computing Machinery is a learned society for computing. It was founded in 1947 as the world's first scientific and educational computing society. Its membership is more than 92,000 as of 2009...
Symposium on Computational Geometry, and in 2008 he was elected a Fellow
Fellow
A fellow in the broadest sense is someone who is an equal or a comrade. The term fellow is also used to describe a person, particularly by those in the upper social classes. It is most often used in an academic context: a fellow is often part of an elite group of learned people who are awarded...
of the ACM for his “contributions to computational geometry.”