|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 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.
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. He serves as the director of the Center for Mathematics of Information at Caltech and also participates in the Institute for Quantum Information and Matter.
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.