J. Håstad
IEEE Transactions on Information Theory · 1986–2014
A researcher in the Science corpus: 7 papers; trusts 2 researchers and is trusted by 56 researchers here, as inferred from the citation graph.
Whom J. Håstad trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts J. Håstad overall
- Yoshua Bengio
- Subhash Khot
- Matus Telgarsky
- Prasad Raghavendra
- R. Beigel
- Hrushikesh Narhar Mhaskar
- Aaron C. Courville
- Sergey Levine
- Tomaso A. Poggio
- Quoc V. Le
Papers from J. Håstad's perspective
Ordered by how strongly the researchers J. Håstad trusts endorse each paper. Same corpus, a different order for every researcher.
- Probabilistic checking of proofs: a new characterization of NP
- A threshold of ln n for approximating set cover (preliminary version)
- Proof verification and hardness of approximation problems
- Almost optimal lower bounds for small depth circuits
- Computational limitations of small-depth circuits
- ImageNet classification with deep convolutional neural networks
- Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
- Gradient-based learning applied to document recognition
- Learning Multiple Layers of Features from Tiny Images
- Attention is All you Need (Neural Information Processing Systems)
Their papers
- On the Correlation of Parity and Small-Depth Circuits (2014) — 79 citations
- On the List-Decodability of Random Linear Codes (2010) — 462 citations
- Some optimal inapproximability results (2001) — 1,973 citations
- On the Complexity of Interactive Proofs with Bounded Communication (1998)
- On the power of small-depth threshold circuits (1990)
- Computational limitations of small-depth circuits (1987)
- Almost optimal lower bounds for small depth circuits (1986)