Misplaced Pages

Leonidas J. Guibas: Difference between revisions

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.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 05:08, 17 December 2016 editDavid Eppstein (talk | contribs)Autopatrolled, Administrators226,315 edits Undid revision 755280587 by Frontierjustice (talk) very clear pass of WP:PROF#C1← Previous edit Revision as of 03:37, 4 May 2017 edit undoDavid Eppstein (talk | contribs)Autopatrolled, Administrators226,315 edits naeNext edit →
Line 17: Line 17:


'''Leonidas John Guibas''' ({{lang-el|Λεωνίδας Γκίμπας}}) is a professor of ] at ], where he heads the geometric computation group and is a member of the computer graphics and artificial intelligence laboratories. Guibas was a student of ] at Stanford, where he received his Ph.D. in 1976.<ref name="mathgen">{{mathgenealogy|name=Leonidas John (Ioannis) Guibas|id=39940}}.</ref> He has worked for several industrial research laboratories, and joined the Stanford faculty in 1984. He was program chair for the ] ] in 1996,<ref>, Computational Geometry Steering Committee.</ref> is a ] of the ACM<ref>] award citation].</ref> and the ],<ref>, IEEE, accessed 2011-12-10.</ref> and was awarded the ] for 2007 “for his pioneering contributions in applying algorithms to a wide range of computer science disciplines.“<ref>, ACM, 2008; {{citation|title=Guibas Receives ACM/AAAI Award for Algorithm Development|journal=Dr. Dobb's|date=March 4, 2008|url=http://www.ddj.com/hpc-high-performance-computing/206901618}}.</ref> He has ] 2 due to his collaborations with Boris Aronov, ], ], Richard M. Pollack, ], and ].<ref>.</ref> The research contributions he is known for include ]s, ]s, ], the Guibas–] algorithm for ], an optimal data structure for ], the ] data structure for representing planar subdivisions, ], and ]s for keeping track of objects in motion. '''Leonidas John Guibas''' ({{lang-el|Λεωνίδας Γκίμπας}}) is a professor of ] at ], where he heads the geometric computation group and is a member of the computer graphics and artificial intelligence laboratories. Guibas was a student of ] at Stanford, where he received his Ph.D. in 1976.<ref name="mathgen">{{mathgenealogy|name=Leonidas John (Ioannis) Guibas|id=39940}}.</ref> He has worked for several industrial research laboratories, and joined the Stanford faculty in 1984. He was program chair for the ] ] in 1996,<ref>, Computational Geometry Steering Committee.</ref> is a ] of the ACM<ref>] award citation].</ref> and the ],<ref>, IEEE, accessed 2011-12-10.</ref> and was awarded the ] for 2007 “for his pioneering contributions in applying algorithms to a wide range of computer science disciplines.“<ref>, ACM, 2008; {{citation|title=Guibas Receives ACM/AAAI Award for Algorithm Development|journal=Dr. Dobb's|date=March 4, 2008|url=http://www.ddj.com/hpc-high-performance-computing/206901618}}.</ref> He has ] 2 due to his collaborations with Boris Aronov, ], ], Richard M. Pollack, ], and ].<ref>.</ref> The research contributions he is known for include ]s, ]s, ], the Guibas–] algorithm for ], an optimal data structure for ], the ] data structure for representing planar subdivisions, ], and ]s for keeping track of objects in motion.

In 2017 he was elected to the ].<ref>, February 8, 2017, retrieved 2017-05-02.</ref>


==References== ==References==
Line 38: Line 40:
] ]
] ]
]

Revision as of 03:37, 4 May 2017

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.

In 2017 he was elected to the National Academy of Engineering.

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.
  7. National Academy of Engineering Elects 84 Members and 22 Foreign Members, February 8, 2017, retrieved 2017-05-02.

External links

Categories: