2026 Leslie G. Valiant: Mathematics Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Mathematics	57	661	561	331	262	91	35424
Computer Science	66	2248	2181	1121	1080	120	46322

Leslie G. Valiant publication distribution in Mathematics in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Mathematics in 2026. The highlighted bar marks where Leslie G. Valiant sits on this spectrum.

42 publications 537+

This scientist: 91 publications — 7th percentile

7% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 537 publications or more.

Leslie G. Valiant D-index placement in Mathematics in 2026

The chart shows the D-index (discipline H-index) distribution of Mathematics scientists ranked by Research.com in 2026. The highlighted bar marks where Leslie G. Valiant sits on this spectrum.

30 D-Index 86+

This scientist: 57 D-Index — 82nd percentile

82% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 86 D-Index or more.

Research.com Recognitions

2019 - Member of Academia Europaea
2012 - ACM Fellow For transformative contributions to the theory of computation.
2010 - A. M. Turing Award For transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.
2008 - Fellow of the American Association for the Advancement of Science (AAAS)
2001 - Member of the National Academy of Sciences
1992 - Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) For the development of computational learning theory, and providing a scientific basis for research in machine learning.
1991 - Fellow of the Royal Society, United Kingdom
1986 - Rolf Nevanlinna Prize "Valiant has contributed in a decisive way to the growth of almost every branch of the fast growing young tree of theoretical computer science, his theory of counting problems being perhaps his most important and mature work."[9]
1985 - Fellow of John Simon Guggenheim Memorial Foundation
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model
Fellow of the International Federation for Information Processing (IFIP) for introducing the concept of the learning machine (theoretical foundation of programming by example) and bulk-synchronous parallel (BSP) model

Overview

Leslie G. Valiant is affiliated with Harvard University in the United States. Their research spans the field of artificial intelligence, with a focus on intelligent tutoring systems and adaptive learning.

Recent papers authored by Leslie G. Valiant include:

How to Augment Learning with Reasoning?, 2021, IEEE/WIC/ACM International Conference on Web Intelligence
Index, 2024, Princeton University Press eBooks

Publication venues frequently featuring Valiant's work are:

IEEE/WIC/ACM International Conference on Web Intelligence
Princeton University Press eBooks

The scientist has also published books with Princeton University Press. One notable book is The Importance of Being Educable, published in 2024.

Valiant's research topics concentrate on intelligent tutoring systems and adaptive learning.

Intelligent Tutoring Systems and Adaptive Learning

Throughout their career, Leslie G. Valiant has received multiple awards and honors, including:

Member of Academia Europaea (2019)
ACM Fellow (2012), for transformative contributions to the theory of computation
A. M. Turing Award (2010), for transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing
Fellow of the American Association for the Advancement of Science (AAAS) (2008)
Member of the National Academy of Sciences (2001)
Fellow of the Association for the Advancement of Artificial Intelligence (AAAI) (1992), for the development of computational learning theory and providing a scientific basis for research in machine learning
Fellow of the Royal Society, United Kingdom (1991)
Rolf Nevanlinna Prize (1986), recognized for contributions to theoretical computer science, especially the theory of counting problems
Fellow of John Simon Guggenheim Memorial Foundation (1985)
Fellow of the International Federation for Information Processing (IFIP), for introducing the concept of the learning machine and the bulk-synchronous parallel (BSP) model

Best Publications

A theory of the learnable

L. G. Valiant

8427
Citations
A bridging model for parallel computation

Leslie G. Valiant

5442
Citations
The complexity of computing the permanent

Leslie G. Valiant

3536
Citations
A theory of the learnable

Unknown

2675
Citations
THE COMPLEXITY OF ENUMERATION AND RELIABILITY PROBLEMS

Leslie G. Valiant

2636
Citations
NP is as easy as detecting unique solutions

L. G. Valiant;V. V. Vazirani

1857
Citations
Cryptographic limitations on learning Boolean formulae and finite automata

Michael Kearns;Leslie Valiant

1341
Citations
Random generation of combinatorial structures from a uniform distribution

Mark R. Jerrum;Leslie G. Valiant;Vijay V. Vazirani

1250
Citations
Fast probabilistic algorithms for hamiltonian circuits and matchings

Dana Angluin;Leslie G. Valiant

1043
Citations
Universal schemes for parallel communication

L. G. Valiant;G. J. Brebner

911
Citations
A SCHEME FOR FAST PARALLEL COMMUNICATION

Leslie G. Valiant

879
Citations
General purpose parallel architectures

L. G. Valiant

781
Citations
Computational limitations on learning from examples

Leonard Pitt;Leslie G. Valiant

686
Citations
A general lower bound on the number of examples needed for learning

Andrzej Ehrenfeucht;David Haussler

645
Citations
Completeness classes in algebra

L. G. Valiant

626
Citations
Evolvability

Unknown

572
Citations
Parallelism in Comparison Problems

Leslie G. Valiant

535
Citations
Universality considerations in VLSI circuits

L. G. Valiant

531
Citations
Learning disjunction of conjunctions

L. G. Valiant

480
Citations
Quantum Circuits That Can Be Simulated Classically in Polynomial Time

Leslie G. Valiant

461
Citations
General context-free recognition in less than cubic time

Leslie G. Valiant

444
Citations
Random generation of combinatorial structures from a uniform

M R Jerrum;L G Valiant;V V Vazirani

421
Citations

Frequent Co-Authors

Michael Kearns University of Pennsylvania

Leonard Pitt University of Illinois at Urbana-Champaign

Vitaly Feldman Apple (United States)

Vijay V. Vazirani University of California, Irvine

Mike Paterson University of Warwick

John H. Reif Duke University

Nicholas Pippenger Harvey Mudd College

John E. Hopcroft Cornell University

Pinyan Lu Shanghai University of Finance and Economics

Dana Angluin Yale University

External Links

Wikipedia of Leslie G. Valiant Personal website of Leslie G. Valiant

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, expanding their skills through related online degrees can open diverse career opportunities. Many graduates explore data analytics masters programs to leverage their quantitative skills in high-demand fields like business intelligence and technology.

When considering further education, ease of admission and program flexibility are often important factors. Prospective students might find value in looking into easy mba programs to get into that still offer robust coursework to enhance leadership skills.

For those balancing work and study, online options can offer flexibility along with academic rigor. Exploring the easiest mba program options online helps students find suitable pathways that align with their career goals without overwhelming commitments.

Additionally, for students transferring between programs, understanding how to can you transfer mba programs is crucial to making informed decisions that save time and resources.