Justin Thaler
Artificial Intelligence · 2011–2018
A researcher in the Science corpus: 9 papers; trusts 69 researchers and is trusted by 76 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 140 citations into it; #2,204 of 35,345 by trust here, #5,059 by citations
- Computational Theory and Mathematics — 75 citations into it; #405 of 12,182 by trust here, #1,269 by citations
- Privacy & Security — 42 citations into it; #623 of 709 by trust here, #608 by citations
- Information Systems — 29 citations into it
- Computer Networks and Communications — 27 citations into it; #1,165 of 9,886 by trust here, #2,099 by citations
- Algorithms & Complexity — 24 citations into it
- Program Analysis & Verification — 15 citations into it; #264 of 301 by trust here, #196 by citations
- Computer Vision and Pattern Recognition — 13 citations into it
Whom Justin Thaler trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Srinath T. V. Setty
- Jens Groth
- Graham Cormode
- Shafi Goldwasser
- Helger Lipmaa
- Victor Vu
- Bryan Parno
- Cynthia Dwork
- Craig Gentry
- Rosario Gennaro
Who trusts Justin Thaler overall
- Riad S. Wahby
- Eli Ben-Sasson
- Srinath T. V. Setty
- Michael Walfish
- Arjun Narayan
- Andrew Justin Blumberg
- Alessandro Chiesa
- Zahra Ghodsi
- Florian Tramèr
- Graham Cormode
Papers from Justin Thaler's perspective
Ordered by how strongly the researchers Justin Thaler trusts endorse each paper. Same corpus, a different order for every researcher.
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- The Knowledge Complexity of Interactive Proof Systems
- ImageNet classification with deep convolutional neural networks
- Deep Residual Learning for Image Recognition (Computer Vision and Pattern Recognition)
- A note on efficient zero-knowledge proofs and arguments (extended abstract)
- Gradient-based learning applied to document recognition
- Checking computations in polylogarithmic time
- How to Prove Yourself: Practical Solutions to Identification and Signature Problems
- Random oracles are practical: a paradigm for designing efficient protocols
- Learning Multiple Layers of Features from Tiny Images
Their papers
- Reliably Learning the ReLU in Polynomial Time (2016) — 131 citations
- Time-Optimal Interactive Proofs for Circuit Evaluation (2013) — 256 citations
- Doubly-Efficient zkSNARKs Without Trusted Setup (2018) — 362 citations
- Verifiable Computation with Massively Parallel Interactive Proofs (2012) — 80 citations
- Faster Algorithms for Privately Releasing Marginals (2012) — 103 citations
- Full Accounting for Verifiable Outsourcing (2017) — 80 citations
- Improved Bounds on the Sign-Rank of AC^0 (2016) — 17 citations
- Practical verified computation with streaming interactive proofs (2011) — 273 citations
- Verifying Computations with Streaming Interactive Proofs (2011) — 90 citations