Leonidas J. Guibas

Leonidas John Guibas (Greek: Λεωνίδας Γκίμπας) is the Paul Pigott Professor of Computer Science and Electrical Engineering at Stanford University. He heads the Geometric Computation group in the Computer Science Department.

Leonidas Guibas
Leonidas Guibas
NationalityGreekAmerican
Alma materCalifornia Institute of Technology (BS)
Stanford University (PhD)
AwardsACM AAAI Allen Newell Award
National Academy of Engineering
American Academy of Arts and Sciences
ACM Fellow
IEEE Fellow
ICCV Helmholtz Prize
Hertz Fellowship
DoD Vennevar Bush Faculty Fellowship
National Academy of Sciences
Scientific career
FieldsComputer Science
InstitutionsStanford University
Doctoral advisorDonald Knuth

Guibas obtained his Ph.D. from Stanford University in 1976.[1] That same year, he was program chair for the ACM Symposium on Computational Geometry in 1996.[2] In 2017 he was elected to the National Academy of Engineering.[3] 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 2018 he was elected to the American Academy of Arts and Sciences.[7] In 2022 he was elected to the National Academy of Sciences.[8]

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. More recently, he has focused on shape analysis and computer vision using deep neural networks. 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.[9]

References

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