Leonidas J. Guibas

Leonidas John Guibas (Greek: Λεωνίδας Γκίμπας) is the Paul Pigott Professor of Computer Science and Electrical Engineering at Stanford University, where he heads the geometric computation group and is a member of the computer graphics and artificial intelligence laboratories.

Leonidas Guibas
Leonidas Guibas
NationalityGreek-American
Scientific career
FieldsComputer Science
InstitutionsStanford University
Doctoral advisorDonald Knuth

Education and career

Guibas was a student of Donald Knuth at Stanford, where he received his Ph.D. in 1976.[1] He has worked for several industrial research laboratories, and joined the Stanford faculty in 1984. He was program chair for the ACM Symposium on Computational Geometry in 1996.[2]

Research

The research contributions Guibas is known for include finger trees, red-black trees, fractional cascading, the Guibas–Stolfi algorithm for Delaunay triangulation, an optimal data structure for point location, the quad-edge data structure for representing planar subdivisions, Metropolis light transport, and kinetic data structures for keeping track of objects in motion.

He has Erdős number 2 due to his collaborations with Boris Aronov, Andrew Odlyzko, János Pach, Richard M. Pollack, Endre Szemerédi, and Frances Yao.[3]

Awards and honors

Guibas is a Fellow of the ACM[4] and the IEEE,[5] and was awarded the ACM - AAAI Allen Newell Award for 2007 "for his pioneering contributions in applying algorithms to a wide range of computer science disciplines."[6] In 2017 he was elected to the National Academy of Engineering.[7] In 2018 he was elected to the American Academy of Arts and Sciences.[8]

gollark: I mean, mine does, given that it's a cheap Wileyfox one, but I don't actually have an SD card.
gollark: Sounds like I can't actually be bothered.
gollark: <@!111569489971159040>
gollark: Can you go around testing it without wiping an existing actual android installation?
gollark: Meh.Edit: it looks a bit interesting

References

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.