Misplaced Pages

Leonidas J. Guibas

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

This is an old revision of this page, as edited by Frontierjustice (talk | contribs) at 04:43, 17 December 2016 (questionable notability). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Revision as of 04:43, 17 December 2016 by Frontierjustice (talk | contribs) (questionable notability)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
The topic of this article may not meet Misplaced Pages's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.
Find sources: "Leonidas J. Guibas" – news · newspapers · books · scholar · JSTOR (December 2016) (Learn how and when to remove this message)
Leonidas Guibas
Leonidas Guibas
NationalityGreek-American
Scientific career
FieldsComputer Science
InstitutionsStanford University
Doctoral advisorDonald Knuth

Leonidas John Guibas (Template:Lang-el) 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 the IEEE, 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.

References

  1. Leonidas John (Ioannis) Guibas at the Mathematics Genealogy Project.
  2. Program Committees from the Symposium on Computational Geometry, Computational Geometry Steering Committee.
  3. ACM Fellow award citation.
  4. 2012 Newly Elevated Fellows, IEEE, accessed 2011-12-10.
  5. 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.
  6. Erdős number project.

External links

Categories: