| Revision as of 15:15, 1 July 2008 editGiftlite (talk | contribs)Autopatrolled, Extended confirmed users, Pending changes reviewers39,617 edits J.→John← Previous edit | Revision as of 17:03, 1 July 2008 edit undoDavid Eppstein (talk | contribs)Autopatrolled, Administrators226,365 edits source for socg96Next edit → | ||
| Line 1: | Line 1: | ||
| '''Leonidas John Guibas''' 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 ] Symposium on Computational Geometry in 1996, is a ] of the ACM,<ref>.</ref> and was awarded the ACM–] ] award for 2007 “for his pioneering contributions in applying algorithms to a wide range of computer science disciplines.“<ref>, ACM, 2008.</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''' 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 ] Symposium on Computational Geometry in 1996,<ref>, Computational Geometry Steering Committee.</ref> is a ] of the ACM,<ref>.</ref> and was awarded the ACM–] ] award for 2007 “for his pioneering contributions in applying algorithms to a wide range of computer science disciplines.“<ref>, ACM, 2008.</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. | ||
| ==References== | ==References== | ||
Revision as of 17:03, 1 July 2008
Leonidas John Guibas 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.“ 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
- 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.
External links
 | This biography of an academic is a stub. You can help Misplaced Pages by expanding it. |