Leonidas J. Guibas: Difference between revisions

Revision as of 11:40, 11 March 2013 editAddbot (talk \| contribs)Bots2,838,809 editsm Bot: Migrating 2 interwiki links, now provided by Wikidata on d:q3229792 ← Previous edit		Revision as of 21:07, 10 July 2014 edit undoWaacstats (talk \| contribs)Autopatrolled, Extended confirmed users, Pending changes reviewers1,348,587 edits →External links: add persondata short description using AWB Next edit →
Line 30:		Line 30:
	\| NAME = Guibas, Leonidas J.		\| NAME = Guibas, Leonidas J.
	\| ALTERNATIVE NAMES =		\| ALTERNATIVE NAMES =
	\| SHORT DESCRIPTION =		\| SHORT DESCRIPTION = American computer scientist
	\| DATE OF BIRTH =		\| DATE OF BIRTH =
	\| PLACE OF BIRTH =		\| PLACE OF BIRTH =

Revision as of 21:07, 10 July 2014

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.