Leslie Valiant

Leslie Valiant
FRS
Leslie Valiant FRS
	Valiant in 2012
Born	Leslie Gabriel Valiant; 28 March 1949 (age 75); Budapest, Hungarian Republic
Nationality	British
Alma mater	University of Cambridge (BA); Imperial College London (MS); University of Warwick (PhD);
Known for	Valiant–Vazirani theorem; Counting problem; Probably approximately correct learning;
Awards	Turing Award (2010); EATCS Award (2008); Member of the National Academy of Sciences (2001); Knuth Prize (1997); AAAI Fellow (1992); Nevanlinna Prize (1986);
	Scientific career
Fields	Mathematics; Theoretical computer science; Computational learning theory; Theoretical neuroscience
Institutions	Harvard University; University of Edinburgh;
Thesis	Decision Procedures for Families of Deterministic Pushdown Automata (1974)
Doctoral advisor	Mike Paterson
Doctoral students	Mark Jerrum; Michael Kearns; Dan Roth;
Website	people.seas.harvard.edu/~valiant

Leslie Gabriel Valiant FRS^[4]^[5] (born 28 March 1949) is a British American^[6] computer scientist and computational theorist.^[7]^[8] He was born to a chemical engineer father and a translator mother.^[9] He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University.^[10]^[11]^[12]^[13] Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".^[6]

^ ^a ^b Leslie Valiant at the Mathematics Genealogy Project
^ Valiant, L.; Vazirani, V. (1986). "NP is as easy as detecting unique solutions" (PDF). Theoretical Computer Science. 47: 85–93. doi:10.1016/0304-3975(86)90135-0.
^ Valiant, L. G. (1979). "The Complexity of Enumeration and Reliability Problems". SIAM Journal on Computing. 8 (3): 410–421. doi:10.1137/0208032.
^ "Leslie Valiant FRS". London: Royal Society. 1991.
^ DServe Archive Catalog Show
^ ^a ^b Cite error: The named reference turingAward was invoked but never defined (see the help page).
^ Hoffmann, L. (2011). "Q&A: Leslie Valiant discusses machine learning, parallel computing, and computational neuroscience". Communications of the ACM. 54 (6): 128. doi:10.1145/1953122.1953152.
^ Anon (2017). "Valiant, Prof. Leslie Gabriel". Who's Who (online Oxford University Press ed.). Oxford: A & C Black. doi:10.1093/ww/9780199540884.013.U40928. (Subscription or UK public library membership required.)
^ "A. M. Turing Award Oral History Interview with Leslie Gabriel Valiant" (PDF).
^ Leslie Valiant author profile page at the ACM Digital Library
^ Wigderson, A. (2009). "The work of Leslie Valiant". Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09. pp. 1–2. doi:10.1145/1536414.1536415. ISBN 9781605585062. S2CID 15370663.
^ Leslie G. Valiant at DBLP Bibliography Server
^ Valiant, Leslie (1984). "A theory of the learnable" (PDF). Communications of the ACM. 27 (11): 1134–1142. doi:10.1145/1968.1972. S2CID 12837541.

[mathgene-1] Leslie Valiant at the Mathematics Genealogy Project

[2] Valiant, L.; Vazirani, V. (1986). "NP is as easy as detecting unique solutions" (PDF). Theoretical Computer Science. 47: 85–93. doi:10.1016/0304-3975(86)90135-0.

[3] Valiant, L. G. (1979). "The Complexity of Enumeration and Reliability Problems". SIAM Journal on Computing. 8 (3): 410–421. doi:10.1137/0208032.

[frs-4] "Leslie Valiant FRS". London: Royal Society. 1991.

[royal-5] DServe Archive Catalog Show

[turingAward-6] Cite error: The named reference turingAward was invoked but never defined (see the help page).

[7] Hoffmann, L. (2011). "Q&A: Leslie Valiant discusses machine learning, parallel computing, and computational neuroscience". Communications of the ACM. 54 (6): 128. doi:10.1145/1953122.1953152.

[whoswho-8] Anon (2017). "Valiant, Prof. Leslie Gabriel". Who's Who (online Oxford University Press ed.). Oxford: A & C Black. doi:10.1093/ww/9780199540884.013.U40928. (Subscription or UK public library membership required.)

[9] "A. M. Turing Award Oral History Interview with Leslie Gabriel Valiant" (PDF).

[acm-10] Leslie Valiant author profile page at the ACM Digital Library

[11] Wigderson, A. (2009). "The work of Leslie Valiant". Proceedings of the 41st annual ACM symposium on Symposium on theory of computing - STOC '09. pp. 1–2. doi:10.1145/1536414.1536415. ISBN 9781605585062. S2CID 15370663.

[dblp-12] Leslie G. Valiant at DBLP Bibliography Server

[13] Valiant, Leslie (1984). "A theory of the learnable" (PDF). Communications of the ACM. 27 (11): 1134–1142. doi:10.1145/1968.1972. S2CID 12837541.

[2]

[3]

[1]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

Leslie Valiant FRS
Valiant in 2012
Born	Leslie Gabriel Valiant (1949-03-28) 28 March 1949 (age 75) Budapest, Hungarian Republic
Nationality	British
Alma mater	University of Cambridge (BA) Imperial College London (MS) University of Warwick (PhD)
Known for	Valiant–Vazirani theorem^[2] Counting problem^[3] Probably approximately correct learning
Awards	Turing Award (2010) EATCS Award (2008) Member of the National Academy of Sciences (2001) Knuth Prize (1997) AAAI Fellow (1992) Nevanlinna Prize (1986)
Scientific career
Fields	Mathematics Theoretical computer science Computational learning theory Theoretical neuroscience
Institutions	Harvard University University of Edinburgh
Thesis	Decision Procedures for Families of Deterministic Pushdown Automata (1974)
Doctoral advisor	Mike Paterson^[1]
Doctoral students	Mark Jerrum Michael Kearns Dan Roth^[1]

Website	people.seas.harvard.edu/~valiant