Leonidas J. Guibas

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Leonidas Guibas
Leonidas Guibas 2010 06 29.png
Leonidas Guibas
Residence U.S.
Nationality Greek-American
Fields Computer Science
Institutions Stanford University
Doctoral advisor Donald Knuth

Leonidas John Guibas (Greek: Λεωνίδας Γκίμπας) is a professor of computer science at Stanford University, where he heads the geometric computation group and is a member of the computer graphics and artificial intelligence laboratories. 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] is a Fellow of the ACM[3] and the IEEE,[4] 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.“[5] 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.[6] The research contributions he 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.

References[edit]

External links[edit]