Timothy Law Snyder | |
---|---|
Born | Toledo, Ohio, U.S. |
Alma mater |
University of Toledo Princeton University |
Occupation | Mathematician, academic administrator, musician |
Employer | Loyola Marymount University |
Known for | 16th President of Loyola Marymount University |
Timothy Law Snyder is an American educator, mathematician, academic administrator and musician. He serves as the 16th President of Loyola Marymount University (LMU) in Los Angeles, California.
Snyder is well known for his academic research, publications and speeches on computational mathematics, data structures, combinatorial optimization, geometric probability, computer music, HIV diagnosis and prevention, and airline flight safety. He has lectured widely about the Millennial Generation and how to educate them.
Timothy Law Snyder was born in Ohio. He graduated from the University of Toledo, where he earned a bachelor of arts in psychology and a bachelor of science in mathematics in 1981, followed by a master of science degree in mathematics in 1983. He earned a master of arts degree in 1985 and a Ph.D. in 1987 in applied and computational mathematics from Princeton University, under the supervision of J. Michael Steele.
Snyder's higher education career began as a graduate student and teacher at the University of Toledo in the Department of Mathematics from 1981–83. From 1984-87, Snyder taught in the Program in Statistics and Operations research at Princeton University, then he taught in the Department of Civil Engineering, 1986–87.
Snyder began teaching at Georgetown University in Washington, D.C. in 1987 as an assistant professor of computer science. He served as adjunct associate dean for science education in the College of Arts and Sciences from 1993–95. He was chair of Georgetown’s Department of Computer Science from 1994–95, and from 1995-99 he was the first dean of science at Georgetown University. Snyder was the Wright Family Distinguished Professor in the Department of Computer Science from 1997–2001. His mathematical research has concerned problems in computational geometry, including Steiner trees, convex hulls, and worst-case analysis of total length and individual lengths geometric graphs.