Leonard Schulman

Last updated
Leonard Schulman
BornSeptember 14, 1963 (1963-09-14) (age 59)
Princeton, New Jersey
Nationality American, Israeli
Alma mater Massachusetts Institute of Technology
Known for Algorithms, information theory, coding theory, quantum computation
Scientific career
Fields Computer science, applied mathematics
Institutions California Institute of Technology
Doctoral advisor Michael Sipser

Leonard J. Y. 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.

Contents

Personal biography

Schulman is the son of theoretical physicist Lawrence Schulman.

Academic biography

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 to 2000 before joining the faculty of the California Institute of Technology. [1] From 2003-2017, he served as the director of the Center for Mathematics of Information [2] at Caltech. He also participates in the Institute for Quantum Information and Matter. [3] In 2017-2018, he was a EURIAS Senior Fellow at the Israel Institute for Advanced Studies at the Hebrew University in Jerusalem.

Research

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. In coding theory he proved the Interactive Coding Theorem (a generalization of the Shannon Coding Theorem.) In clustering, his work on quantifying the effectiveness of Lloyd-type methods for the k-means problem, was named a Computing Reviews "Notable Paper" in 2012. [4] In quantum computation, he is known for his work on the non-abelian hidden subgroup problem, and for his work on noise thresholds for ensemble quantum computing.

Awards and honors

Schulman received the MIT Bucsela Prize in 1988, an NSF Mathematical Sciences Postdoctoral Fellowship in 1992 and an NSF CAREER award in 1999. His work received the IEEE S.A. Schelkunoff Prize in 2005. [5] Schulman was also recognized for the ACM Notable Paper in 2012. In 2022 he was awarded the FOCS Test of Time Award [6] for his work on error correction in the setting of interactive communication. He was the editor-in-chief of the SIAM Journal on Computing for two terms (2013-2018.) He was elected as a Fellow of the Society for Industrial and Applied Mathematics, in the 2022 Class of SIAM Fellows, "for seminal contributions to coding theory, quantum computing and matrix analysis, and outstanding service". [7]

Related Research Articles

<span class="mw-page-title-main">Peter Shor</span> American mathematician

Peter Williston Shor is an American professor of applied mathematics at MIT. He is known for his work on quantum computation, in particular for devising Shor's algorithm, a quantum algorithm for factoring exponentially faster than the best currently-known algorithm running on a classical computer.

<span class="mw-page-title-main">Richard M. Karp</span> American mathematician

Richard Manning Karp is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.

<span class="mw-page-title-main">Juris Hartmanis</span> American computer scientist (1928–2022)

Juris Hartmanis was a Latvian-born American computer scientist and computational theorist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".

<span class="mw-page-title-main">Theoretical computer science</span> Subfield of computer science and mathematics

Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory.

<span class="mw-page-title-main">Leonid Levin</span> Soviet-American mathematician

Leonid Anatolievich Levin is a Soviet-American mathematician and computer scientist.

<span class="mw-page-title-main">John Preskill</span>

John Phillip Preskill is an American theoretical physicist and the Richard P. Feynman Professor of Theoretical Physics at the California Institute of Technology, where he is also the Director of the Institute for Quantum Information and Matter.

In computational complexity theory, the PCP theorem states that every decision problem in the NP complexity class has probabilistically checkable proofs of constant query complexity and logarithmic randomness complexity.

<span class="mw-page-title-main">Michael Sipser</span> American theoretical computer scientist (born 1954)

Michael Fredric Sipser is an American theoretical computer scientist who has made early contributions to computational complexity theory. He is a professor of applied mathematics and was the Dean of Science at the Massachusetts Institute of Technology.

<span class="mw-page-title-main">Michael Luby</span> Information theorist and cryptographer

Michael George Luby is a mathematician and computer scientist, CEO of BitRipple, Senior Research Scientist at the International Computer Science Institute (ICSI), former VP Technology at Qualcomm, co-founder and former Chief Technology Officer of Digital Fountain. In coding theory he is known for leading the invention of the Tornado codes and the LT codes. In cryptography he is known for his contributions showing that any one-way function can be used as the basis for private cryptography, and for his analysis, in collaboration with Charles Rackoff, of the Feistel cipher construction. His distributed algorithm to find a maximal independent set in a computer network has also been influential.

Piotr Indyk is Thomas D. and Virginia W. Cabot Professor in the Theory of Computation Group at the Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology.

<span class="mw-page-title-main">Tony F. Chan</span> Chinese American mathematician

Tony Fan-Cheong Chan is a Chinese American mathematician who has been serving as President of the King Abdullah University of Science and Technology (KAUST) since 2018. Prior that, he was President of the Hong Kong University of Science and Technology from 2009 to 2018.

<span class="mw-page-title-main">Alan Edelman</span> American mathematician

Alan Stuart Edelman is an American mathematician and computer scientist. He is a professor of applied mathematics at the Massachusetts Institute of Technology (MIT) and a Principal Investigator at the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL) where he leads a group in applied computing. In 2004 he founded a business, Interactive Supercomputing, which was later acquired by Microsoft. Edelman is a fellow of American Mathematical Society (AMS), Society for Industrial and Applied Mathematics (SIAM), Institute of Electrical and Electronics Engineers (IEEE), and Association for Computing Machinery (ACM), for his contributions in numerical linear algebra, computational science, parallel computing, and random matrix theory, and he is one of the cocreators of the technical programming language Julia.

George V. Cybenko is the Dorothy and Walter Gramm Professor of Engineering at Dartmouth and a fellow of the IEEE and SIAM.

<span class="mw-page-title-main">Joel Tropp</span>

Joel Aaron Tropp is the Steele Family Professor of Applied and Computational Mathematics in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on sparse approximation, numerical linear algebra, and random matrix theory.

Christopher Umans is a professor of Computer Science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, computational complexity, algebraic complexity, and hardness of approximation.

<span class="mw-page-title-main">Mohammad Hajiaghayi</span> American computer scientist

Mohammad Taghi Hajiaghayi is a computer scientist known for his work in algorithms, game theory, social networks, network design, graph theory, and big data. He has over 200 publications with over 185 collaborators and 10 issued patents.

Andrew MacGregor Childs is an American computer scientist and physicist known for his work on quantum computing. He is currently a Professor in the Department of Computer Science and Institute for Advanced Computer Studies at the University of Maryland. He also co-directs the Joint Center for Quantum Information and Computer Science, a partnership between the University of Maryland and the National Institute of Standards and Technology.

<span class="mw-page-title-main">Inderjit Dhillon</span>

Inderjit S. Dhillon is the Gottesman Family Centennial Professor of Computer Science and Mathematics at the University of Texas at Austin, where he is also the Director of the ICES Center for Big Data Analytics. His main research interests are in machine learning, data analysis, parallel computing, network analysis, linear algebra and optimization.

Benjamin E. Rossman is an American mathematician and theoretical computer scientist, specializing in computational complexity theory. He is currently an associate professor of computer science and mathematics at Duke University.

Mark McMahon Wilde is an American quantum information scientist. He is an Associate Professor in the School of Electrical and Computer Engineering at Cornell University, and he is also a Fields Member in the School of Applied and Engineering Physics and the Department of Computer Science at Cornell.

References

  1. ↑ Leonard Schulman at the Caltech Directory
  2. ↑ The Center for the Mathematics of Information at Caltech
  3. ↑ Institute for Quantum Information and Matter at Caltech
  4. ↑ Computing Reviews Notable Papers and Books of 2012
  5. ↑ IEEE Schelkunoff Prize Recipients
  6. ↑ FOCS (Foundations of Computer Science) Test of Time Award
  7. ↑ "SIAM Announces Class of 2022 Fellows". SIAM News. March 31, 2022. Retrieved 2022-03-31.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.