views: 138

# Kenneth L. Clarkson

Technical Lead

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

ACM_Citations

USA-2008

For contributions to computational geometry.

Experience

Sign in to view more

Education

Sign in to view more

Bio

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.

## Papers97 papers

Sort

By YearBy Citation

international conference on machine learning, (2019): 1262-1271

MICCAI, pp.543-551, (2018)

Journal of the ACM (JACM), no. 6 (2017)

international workshop and international workshop on approximation randomization and combinatorial o..., (2017): 27:1-27:22

SIAM J. Matrix Analysis Applications, no. 4 (2017)

SODA, pp.2061-2072, (2017)

SODA '17: Symposium on Discrete Algorithms
Barcelona
Spain
January, 2017, pp.2061-2072, (2017)

arXiv: Data Structures and Algorithms, (2016)

Discrete & Computational Geometry, no. 4 (2016): 745-747

SIAM J. Comput., no. 3 (2016): 763-810

IEEE Symposium on Foundations of Computer Science, (2015)

(2014)

Cited by

**1**BibtexSIAM Journal on Computing, no. 2 (2014): 617-653

Proceedings of the forty-fifth annual ACM symposium on Theory of computing, (2013)

Yoshiyuki Nishizeki,Alfred V Aho, John E Hopcroft,Jeffrey D Ullman,Kenneth L Clarkson,Shiv G Kapoor,Pravin M Vaidya, Elmer G Gilbert, D W Johnson, Distance Functions

(2013)

Bibtex

Proceedings of the twenty-eighth annual symposium on Computational geometry, (2012)

Symposium on Computational Geometry 2013, no. 1 (2012): ArticleNo.9-ArticleNo.9

Kenneth L. Clarkson,Petros Drineas, Malik Magdon-Ismail,Michael W. Mahoney,Xiangrui Meng,David P. Woodruff

CoRR, (2012)

Journal of the ACM, no. 5 (2012): ArticleNo.23-ArticleNo.23

Computer Physics Communications, no. 8 (2012): 1803-1812

SIAM J. Comput., no. 2 (2011): 350-375

(2010)

SODA, pp.1546-1565, (2010)

ACM Transactions on Algorithms, no. 4 (2010): 922-931

STOC, pp.205-214, (2009)

Clinical Orthopaedics and Related Research, (2009)

Cited by

**44**BibtexComput. Geom., no. 1 (2008): 14-22

Symposium on Computational Geometry 2013, pp.39-48, (2008)

Symposium on Computational Geometry 2013, pp.305-305, (2008)

Symposium on Computational Geometry 2013, pp.148-155, (2008)

Discrete & Computational Geometry, no. 1 (2007): 135-141

VTC Fall, pp.905-909, (2007)

(2007)

Cited by

**29**BibtexVTC Fall, pp.799-803, (2007)

STOC, pp.326-335, (2006)

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp.326-335, (2006)

symposium on discrete algorithms, pp.257-266, (2005)

Cited by

**15**BibtexSODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.257-266, (2005)

Cited by

**16**EIBibtexvehicular technology conference, (2004)

(2004)

Cited by

**14**Bibtex (2003)

Cited by

**43**Bibtex (2003)

Cited by

**19**BibtexSODA, pp.801-802, (2003)

Bell Labs Technical Journal, no. 2 (2003): 33-47

Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th, (2003): 927-932Vol.2

IEEE Transactions on Communications, no. 2 (2000): 253-261

Discrete & Computational Geometry, no. 1 (1999): 63-93

International Journal of Computational Geometry and Applications, no. 3 (1996): 357-377

Journal of the ACM (JACM), no. 2 (1995): 488-499

(1995)

Cited by

**28**BibtexSymposium on Computational Geometry 2013, pp.160-164, (1994)

Workshop on Algorithms and Data Structures, (1993)

Cited by

**27**BibtexDiscrete & Computational Geometry, no. 1 (1993): 427-433

Symposium on Theoretical Aspects of Computer Science, no. 4 (1993): 185-212

WADS, pp.246-252, (1993)

Int. J. Comput. Geometry Appl., no. 2 (1992): 117-133

IEEE Symposium on Foundations of Computer Science, (1992)

Cited by

**4**BibtexInt. J. Comput. Geometry Appl., no. 3 (1992): 341-343

SODA, pp.17-23, (1991)

Discrete & Computational Geometry, no. 2 (1990): 99-160

Algorithmica, no. 2 (1990): 179-187

Discrete & Computational Geometry, no. 1 (1989): 387-421

Algorithmica, no. 4 (1989): 461-469

SIAM J. Comput., no. 4 (1988): 830-847

Symposium on Computational Geometry 2013, pp.12-17, (1988)

SCG '87 Proceedings of the third annual symposium on Computational geometry, pp.251-257, (1987)

Symposium on Computational Geometry, (1987)

Cited by

**6**BibtexSTOC, pp.56-65, (1987)

Discrete & Computational Geometry, no. 1 (1987): 195-222

Information Processing Letters, no. 1 (1986): 21-24

Cited by

**27**EIBibtexInf. Process. Lett., no. 1 (1986): 21-24

Information Processing Letters, (1986)

STOC, pp.175-184, (1985)

Algorithms for closest-point problems (computational geometry), (1985)

EIBibtex

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing, pp.342-348, (1984)

STOC, pp.342-348, (1984)

Tucson, AZ, USA, pp.226-232, (1983)

Inf. Process. Lett., no. 1 (1983): 23-25

View All