Johan Håstad
Johan Håstad publishes mostly in Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications, on topics such as Complexity and Algorithms in Graphs, Advanced Graph Theory Research and Cryptography and Data Security.
- World rank
- #226,540 of 7,710,434 ranked researchers
- Rank in Sweden
- #2,499 of 71,437
- Works
- 170
- Citations
- 11k
- Citations per work
- 62.6
What does Johan Håstad research?
Johan Håstad's work is mostly in Computer Science (76%), Mathematics (4%), Engineering (4%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences14183.1%
- Computer Science12975.9%
- Mathematics63.7%
- Engineering63.5%
- Everything else2916.9%
- 1Computational Theory and Mathematics41% of their works
- 2Artificial Intelligence23% of their works
- 3Computer Networks and Communications7% of their works
- 4Computer Graphics and Computer-Aided Design5% of their works
- 5Discrete Mathematics and Combinatorics4% of their works
- 6Electrical and Electronic Engineering4% of their works
Research topics
Which keywords describe Johan Håstad's research?
The keywords of their largest research topics: Approximation Algorithms, Algorithmic Applications, Combinatorial Optimization, Complexity Theory, Graph Theory, Parameterized Complexity, Homomorphic Encryption and Identity-Based Encryption.
- Szemerédi's Theorem
- Error-Correcting Codes
- Machine Learning
- Formal Languages
- Mesh Generation
- Identity-Based Encryption
- Parameterized Complexity
- Complexity Theory
- Algorithmic Applications
- Approximation Algorithms
- Combinatorial Optimization
- Graph Theory
- Homomorphic Encryption
- Delaunay Triangulations
- Automata
- Active Learning
- Cryptography
- Graph Limits
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 18 words, with their numbers
- Approximation Algorithms1713 topics
- Algorithmic Applications1452 topics
- Combinatorial Optimization971 topic
- Complexity Theory971 topic
- Graph Theory481 topic
- Parameterized Complexity481 topic
- Homomorphic Encryption361 topic
- Identity-Based Encryption361 topic
- Delaunay Triangulations261 topic
- Mesh Generation261 topic
- Automata191 topic
- Formal Languages191 topic
- Active Learning171 topic
- Machine Learning171 topic
- Cryptography161 topic
- Error-Correcting Codes161 topic
- Graph Limits161 topic
- Szemerédi's Theorem161 topic
Where does Johan Håstad work?
Johan Håstad's main affiliation in the publication record is KTH Royal Institute of Technology, Sweden.
How many publications and citations does Johan Håstad have?
OpenAlex counts 170 works and 10,643 citations for Johan Håstad, an h-index of 44, ranking #226,540 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Johan Håstad. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.