2026 Johan Håstad: Mathematics Researcher – H-Index, Publications & Awards

D-Index & Metrics

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	53	4689	4557	18	18	145	20934
Mathematics	53	875	747	7	6	139	20889

Discipline name

D-Index

World Ranking

Current World Ranking

National Ranking

Current National Ranking

Publications

Citations

Computer Science

4689

4557

145

20934

Mathematics

875

747

139

20889

Computer Science

D-Index

Citations

20934

World Ranking

4689

National Ranking

Mathematics

D-Index

Citations

20889

World Ranking

875

National Ranking

Research.com Recognitions

2026 - Research.com Mathematics in Sweden Leader Award
2025 - Research.com Mathematics in Sweden Leader Award
2018 - ACM Fellow For contributions in circuit complexity, approximability and inapproximability, and foundations of pseudorandomness
2013 - Fellow of the American Mathematical Society
2007 - Member of Academia Europaea

Overview

Johan Håstad is affiliated with the Royal Institute of Technology in Sweden and works primarily in the fields of Computer Science and Biochemistry, Genetics and Molecular Biology. Their research spans multiple subfields including Computational Theory and Mathematics, Molecular Biology, Computer Networks and Communications, Artificial Intelligence, and Industrial and Manufacturing Engineering.

The scientist's research interests focus on several topics such as:

Complexity and Algorithms in Graphs
Semigroups and Automata Theory
DNA and Biological Computing
Advanced Biosensing and Bioanalysis Techniques
Advanced Graph Theory Research
Algorithms and Data Compression
Constraint Satisfaction and Optimization

Recent publications illustrate the breadth of their work and include:

"Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound" (2021), published in IEEE Transactions on Information Theory
"On Small-depth Frege Proofs for Tseitin for Grids" (2020), published in Journal of the ACM
"Randomness Efficient Noise Stability and Generalized Small Bias Sets" (2020), published by Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
"On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited" (2022), published at the 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
"Optimal Inapproximability with Universal Factor Graphs" (2023), published in ACM Transactions on Algorithms

Frequent coauthors collaborating with Johan Håstad include:

Venkatesan Guruswami
Kilian Risse
Per Austrin
Jonah Brown-Cohen
Boaz Barak

In terms of venues for publication, they have published multiple papers in:

arXiv (Cornell University)
IEEE Transactions on Information Theory
Journal of the ACM
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
ACM Transactions on Algorithms

Johan Håstad has been recognized with awards including being named an ACM Fellow in 2018 for contributions in circuit complexity, approximability and inapproximability, and foundations of pseudorandomness. They were also made a Fellow of the American Mathematical Society in 2013 and became a member of Academia Europaea in 2007.

Best Publications

Some optimal inapproximability results

Johan Håstad

2917
Citations
A Pseudorandom Generator from any One-way Function

Johan HÅstad;Russell Impagliazzo;Leonid A. Levin;Michael Luby

2490
Citations
Clique is hard to approximate within n/sup 1-/spl epsiv//

J. Hastad

1859
Citations
Clique is hard to approximate within n1−ε

Johan Håstad

1853
Citations
Almost optimal lower bounds for small depth circuits

J Hastad

1021
Citations
Tensor rank is NP-complete

Johan Håstad

810
Citations
Simple Constructions of Almost k-wise Independent Random Variables

Noga Alon;Oded Goldreich;Johan Håstad;René Peralta

810
Citations
Computational limitations of small-depth circuits

Johan Torkel Håstad

605
Citations
The bit extraction problem or t-resilient functions

Benny Chor;Oded Goldreich;Johan Hasted;Joel Freidmann

531
Citations
Does co-NP have short interactive proofs?

R. B. Boppana;J. Hastad;S. Zachos

517
Citations
On the power of small-depth threshold circuits

Johan Håstad;Mikael Goldmann

410
Citations
Everything provable is provable in zero-knowledge

Michael Ben-Or;Oded Goldreich;Shafi Goldwasser;Johan Håstad

343
Citations
Solving simultaneous modular equations of low degree

Johan Hastad

322
Citations
Optimal bounds for decision problems on the CRCW PRAM

Paul Beame;Johan Hastad

308
Citations
Majority gates vs. general weighted threshold gates

M. Goldmann;J. Hastad;A. Razborov

307
Citations
Linearity testing in characteristic two

M. Bellare;D. Coppersmith;J. Hastad;M. Kiwi

254
Citations
Clique is hard to approximate within n 1-epsilon

Johan Håstad

247
Citations
Simple construction of almost k-wise independent random variables

N. Alon;O. Goldreich;J. Hastad;R. Peralta

231
Citations
Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes

Yevgeniy Dodis;Rosario Gennaro;Johan Håstad;Hugo Krawczyk

211
Citations
Statistical zero-knowledge languages can be recognized in two rounds

William Aiello;Johan Hastad

190
Citations
Analysis of backoff protocols for multiple access channels

J. Hastad;T. Leighton;B. Rogoff

90
Citations

Frequent Co-Authors

Venkatesan Guruswami University of California, Berkeley

Madhu Sudan Harvard University

Oded Goldreich Weizmann Institute of Science

Jeffrey C. Lagarias University of Michigan–Ann Arbor

Prasad Raghavendra University of California, Berkeley

William Aiello University of British Columbia

Avi Wigderson Institute for Advanced Study

Rafael Pass Cornell University

Frank Tom Leighton MIT

Shafi Goldwasser University of California, Berkeley

External Links

Wikipedia of Johan Håstad Personal website of Johan Håstad Google Scholar page

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

Related Online Degrees & Career Pathways

For students interested in Mathematics, exploring related online degrees can open diverse career pathways. Many professionals leverage quantitative skills by pursuing business-focused qualifications such as an MBA. Those seeking flexible options may consider the easiest mba programs, which offer accessible admission processes without compromising quality.

Online education has expanded opportunities further, with some institutions offering easiest online mba programs that accommodate busy schedules and remote learners. These programs often combine leadership training with analytical coursework, ideal for math graduates entering management roles.

For those aiming to advance into research or high-level consulting, pursuing a Doctor of Business Administration can be advantageous. Finding affordable options is key, and the cheapest online dba programs provide cost-effective routes to doctoral credentials without sacrificing rigor.

Additionally, careers in finance align closely with mathematical expertise. Students can explore online masters in finance programs that blend theory and practical skills, preparing graduates for roles in investment, analysis, and risk management.