Guibas, Leonidas J.
Enlarge text Shrink text-
Personality
- Edelsbrunner, H. Topologically sweeping an arrangement, 1986:t.p. (Leonidas J. Guibas) abstract p. (DEC/SRC and Stanford Univ.)
- Chazelle, B. The complexity of cutting complexes, 1987:t.p. (L.J. Guibas) p. 1 (Leonidas J. Guibas; Dept. of Computer Science, Stanford Univ./DEC-SRC, Palo Alto, CA)
Leonidas John Guibas (Greek: Λεωνίδας Γκίμπας) is the Paul Pigott Professor of Computer Science and Electrical Engineering at Stanford University. He heads the Geometric Computation group in the Computer Science Department. Guibas obtained his Ph.D. from Stanford University in 1976. He was program chair for the ACM Symposium on Computational Geometry in 1996. In 2017 he was elected to the National Academy of Engineering. Guibas 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." In 2018 he was elected to the American Academy of Arts and Sciences. In 2022 he was elected to the National Academy of Sciences.
Read more on Wikipedia >