CUFinder

Johan Håstad

Johan Håstad

Kungliga Tekniska högskolan

H-index: 50

Europe-Sweden

About Johan Håstad

Johan Håstad, With an exceptional h-index of 50 and a recent h-index of 29 (since 2020), a distinguished researcher at Kungliga Tekniska högskolan, specializes in the field of complexity theory, efficient algorithms, cryptography.

His recent articles reflect a diverse array of research interests and contributions to the field:

On small-depth Frege proofs for PHP

On bounded depth proofs for tseitin formulas on the grid; revisited

Computation Theory

Explicit two-deletion codes with redundancy matching the existential bound

On small-depth Frege proofs for Tseitin for grids

Johan Håstad Information

University

Position

Professor i teoretisk datalogi

Citations(all)

17820

Citations(since 2020)

3701

Cited By

15251

hIndex(all)

50

hIndex(since 2020)

29

i10Index(all)

94

i10Index(since 2020)

47

Email

Access Email

University Profile Page

Kungliga Tekniska högskolan

Google Scholar

View Google Scholar Profile

Johan Håstad Skills & Research Interests

complexity theory

efficient algorithms

cryptography

Top articles of Johan Håstad

Title

Journal

Author(s)

Publication Date

On small-depth Frege proofs for PHP

Johan Håstad

2023/11/6

On bounded depth proofs for tseitin formulas on the grid; revisited

Johan Håstad

Kilian Risse

2022/10/31

Computation Theory

ACM Transactions on

Ryan O’Donnell

Vikraman Arvind

Albert Atserias

Andrej Bogdanov

Harry Buhrman

...

2022

Explicit two-deletion codes with redundancy matching the existential bound

IEEE Transactions on Information Theory

Venkatesan Guruswami

Johan Håstad

2021/3/29

On small-depth Frege proofs for Tseitin for grids

Journal of the ACM (JACM)

Johan Håstad

2020/11/17

See List of Professors in Johan Håstad University(Kungliga Tekniska högskolan)