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. 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, is a Fellow of the ACM, 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.“ 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. 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.
^ Leonidas John (Ioannis) Guibas at the Mathematics Genealogy Project..
^ Program Committees from the Symposium on Computational Geometry, Computational Geometry Steering Committee.
^ ACM Fellow award citation.
^ ACM/AAAI Allen Newell Award Recognizes Leonidas Guibas for Algorithms Advancing CS Fields, ACM, 2008; "Guibas Receives ACM/AAAI Award for Algorithm Development", Dr. Dobb's, March 4, 2008.
^ Erdos number project.
Medieval Greece / Byzantine Empire
From Wikipedia, All text is available under the terms of the GNU Free Documentation License