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 15:45, 22 February 2009 editYobot (talk | contribs)Bots4,733,870 editsm substituting BD using AWB← Previous edit Revision as of 19:13, 28 January 2010 edit undoOmnipaedista (talk | contribs)Autopatrolled, Extended confirmed users, Pending changes reviewers242,203 edits lang-elNext 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 ] ] 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; {{citation|title=Guibas Receives ACM/AAAI Award for Algorithm Development|journal=Dr. Dobb's|date=March 04, 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>.</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; {{citation|title=Guibas Receives ACM/AAAI Award for Algorithm Development|journal=Dr. Dobb's|date=March 04, 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.


==References== ==References==
Line 13: Line 13:
] ]
] ]

] ]
] ]

Revision as of 19:13, 28 January 2010

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 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. 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 04, 2008 {{citation}}: Check date values in: |date= (help).
  5. Erdos number project.

External links


Stub icon

This article about a Greek scientist is a stub. You can help Misplaced Pages by expanding it.

P ≟ NP 

This biographical article relating to a computer scientist is a stub. You can help Misplaced Pages by expanding it.

Categories: