Johan Håstad
About
In The Last Decade
Johan Håstad
109 papers receiving 4.1k citations
Hit Papers
Peers
Comparison fields: 5 of 92
- Computational Theory and Mathematics 2.7k
- Artificial Intelligence 2.4k
- Computer Networks and Communications 1.2k
- Electrical and Electronic Engineering 519
- Computer Vision and Pattern Recognition 432
Countries citing papers authored by Johan Håstad
This map shows the geographic impact of Johan Håstad's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Johan Håstad with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Johan Håstad more than expected).
Fields of papers citing papers by Johan Håstad
This network shows the impact of papers produced by Johan Håstad. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Johan Håstad. The network helps show where Johan Håstad may publish in the future.
Co-authorship network of co-authors of Johan Håstad
This figure shows the co-authorship network connecting the top 25 collaborators of Johan Håstad. A scholar is included among the top collaborators of Johan Håstad based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Johan Håstad. Johan Håstad is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 32 | |
| 3 | 3 | |
| 4 | On the correlation of parity and small-depth circuits. | 3 |
| 5 | 6 | |
| 6 | Towards an Optimal Separation of Space and Length in Resolution. | 1 |
| 7 | 26 | |
| 8 | 9 | |
| 9 | 19 | |
| 10 | A new way to use semidefinite programming with applications to linear equations mod p | 9 |
| 11 | Clique is hard to approximate within n 1-epsilon | 76 |
| 12 | On the Message Complexity of Interactive Proof Systems | 1 |
| 13 | 8 | |
| 14 | 30 | |
| 15 | 51 | |
| 16 | 1 | |
| 17 | Fast Computation Using Faulty Hypercubes (Extended Abstract) | 9 |
| 18 | 96 | |
| 19 | 53 | |
| 20 | Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract) | 1 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.