Gur, Tom
98  results:
Search for persons X
?
1

On the Power of Interactive Proofs for Learning:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
 
?
2

Perfect Zero-Knowledge PCPs for #P:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Gur, Tom ; O'Connor, Jack ; Spooner, Nicholas - p. 1724-1730 , 2024
 
?
3

Proof-Carrying Data from Arithmetized Random Oracles:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,
Chen, Megan ; Chiesa, Alessandro ; Gur, Tom.. - p. 379-404 , 2023
 
?
 
?
 
?
8

Worst-case to average-case reductions via additive combinat..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Asadi, Vahid R. ; Golovnev, Alexander ; Gur, Tom. - p. 1566-1574 , 2022
 
?
9

Hypercontractivity on high dimensional expanders:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Gur, Tom ; Lifshitz, Noam ; Liu, Siqi - p. 176-184 , 2022
 
?
10

Quantum learning algorithms imply circuit lower bounds:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Arunachalam, Srinivasan ; Grilo, Alex B. ; Gur, Tom.. - p. 562-573 , 2022
 
?
11

Universal locally verifiable codes and 3-round interactive ..:

Goldreich, Oded ; Gur, Tom
Theoretical Computer Science.  878-879 (2021)  - p. 83-101 , 2021
 
?
13

A Structural Theorem for Local Algorithms with Applications..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Dall'Agnol, Marcel ; Gur, Tom ; Lachish, Oded - p. 1651-1665 , 2021
 
?
14

On the Power of Relaxed Local Decoding Algorithms:

Gur, Tom ; Lachish, Oded
SIAM Journal on Computing.  50 (2021)  2 - p. 788-813 , 2021
 
?
15

A structural theorem for local algorithms with applications..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Dall'Agnol, Marcel ; Gur, Tom ; Lachish, Oded - p. 1651-1665 , 2021
 
1-15