Leonard Schulman

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Leonard Schulman
Born September 14, 1963 (1963-09-14) (age 53)
Princeton, New Jersey
Nationality American
Fields Computer Science, Applied mathematics
Institutions California Institute of Technology
Alma mater Massachusetts Institute of Technology
Doctoral advisor Michael Sipser
Known for Algorithms, Information Theory, Coding Theory, Quantum Computation

Leonard Schulman (born September 14, 1963) is Professor of Computer Science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, information theory, coding theory, and quantum computation.

Personal Biography[edit]

Schulman is the son of theoretical physicist Lawrence Schulman.

Academic Biography[edit]

Schulman studied at the Massachusetts Institute of Technology, where he completed a BS degree in Mathematics in 1988 and a PhD degree in Applied Mathematics in 1992. He was a faculty member in the College of Computing at the Georgia Institute of Technology from 1995-2000 before joining the faculty of the California Institute of Technology in 2000.[1] He serves as the director of the Center for Mathematics of Information[2] at Caltech and also participates in the Institute for Quantum Information and Matter.[3]


Schulman's research centers broadly around algorithms and information. He has made notable contributions to varied areas within this space including clustering, derandomization, quantum information theory, and coding theory. One example, which was named a Computing Reviews "Notable Paper" in 2012, is his work on quantifying the effectiveness of Lloyd-type methods for the k-means problem.[4]

Awards and Honors[edit]

Schulman received an NSF CAREER award in 1999. His work received the IEEE S.A. Schelkunoff Prize in 2005.[5] He was named the editor-in-chief of the SIAM Journal on Computing in 2013.


External links[edit]