Prati
Justin Thaler
Justin Thaler
Potvrđena adresa e-pošte na georgetown.edu - Početna stranica
Naslov
Citirano
Citirano
Godina
Practical verified computation with streaming interactive proofs
G Cormode, M Mitzenmacher, J Thaler
Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012
2372012
Doubly-efficient zkSNARKs without trusted setup
RS Wahby, I Tzialla, A Shelat, J Thaler, M Walfish
2018 IEEE Symposium on Security and Privacy (SP), 926-943, 2018
1832018
Time-optimal interactive proofs for circuit evaluation
J Thaler
Annual Cryptology Conference, 71-89, 2013
1752013
Reliably learning the relu in polynomial time
S Goel, V Kanade, A Klivans, J Thaler
Conference on Learning Theory, 1004-1042, 2017
1062017
{Verifiable} Computation with Massively Parallel Interactive Proofs
J Thaler, M Roberts, M Mitzenmacher, H Pfister
4th USENIX Workshop on Hot Topics in Cloud Computing (HotCloud 12), 2012
892012
Faster algorithms for privately releasing marginals
J Thaler, J Ullman, S Vadhan
International Colloquium on Automata, Languages, and Programming, 810-821, 2012
832012
Verifying computations with streaming interactive proofs
G Cormode, J Thaler, K Yi
arXiv preprint arXiv:1109.6882, 2011
692011
Full accounting for verifiable outsourcing
RS Wahby, Y Ji, AJ Blumberg, A Shelat, J Thaler, M Walfish, T Wies
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
682017
Dual lower bounds for approximate degree and Markov–Bernstein inequalities
M Bun, J Thaler
Information and Computation 243, 2-25, 2015
622015
The polynomial method strikes back: Tight quantum query bounds via dual polynomials
M Bun, R Kothari, J Thaler
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
472018
Hierarchical heavy hitters with the space saving algorithm
M Mitzenmacher, T Steinke, J Thaler
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and …, 2012
452012
Streaming graph computations with a helpful advisor
G Cormode, M Mitzenmacher, J Thaler
Algorithmica 65 (2), 409-442, 2013
392013
On the power of statistical zero knowledge
A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019
38*2019
Hardness amplification and the approximate degree of constant-depth circuits
M Bun, J Thaler
International Colloquium on Automata, Languages, and Programming, 268-280, 2015
382015
Faster private release of marginals on small databases
K Chandrasekaran, J Thaler, J Ullman, A Wan
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
382014
A Nearly Optimal Lower Bound on the Approximate Degree of AC
M Bun, J Thaler
SIAM Journal on Computing 49 (4), FOCS17-59-FOCS17-96, 2019
362019
Variable selection is hard
D Foster, H Karloff, J Thaler
Conference on Learning Theory, 696-709, 2015
362015
Verifiable Stream Computation and Arthur--Merlin Communication
A Chakrabarti, G Cormode, A McGregor, J Thaler, S Venkatasubramanian
SIAM Journal on Computing 48 (4), 1265-1299, 2019
32*2019
A high-performance algorithm for identifying frequent items in data streams
D Anderson, P Bevan, K Lang, E Liberty, L Rhodes, J Thaler
Proceedings of the 2017 Internet Measurement Conference, 268-282, 2017
312017
Parallel peeling algorithms
J Jiang, M Mitzenmacher, J Thaler
ACM Transactions on Parallel Computing (TOPC) 3 (1), 1-27, 2017
312017
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20