Tom Gur
Tom Gur
Associate Professor at University of Warwick
Zweryfikowany adres z warwick.ac.uk - Strona główna
Cytowane przez
Cytowane przez
Leveraging Genetic Variability across Populations for the Identification of Causal Variants
N Zaitlen, B Paşaniuc, T Gur, E Ziv, E Halperin
The American Journal of Human Genetics 86 (1), 23-33, 2010
Non-Interactive Proofs of Proximity
T Gur, RD Rothblum
Computational Complexity 27 (1), 99–207, 2018
Distribution Testing Lower Bounds via Reductions from Communication Complexity
E Blais, CL Canonne, T Gur
ACM Transactions on Computation Theory 11 (2), 2019
An Adaptivity Hierarchy Theorem for Property Testing
C Canonne, T Gur
Computational Complexity 27, 671-716, 2018
Linear-Size Constant-Query IOPs for Delegating Computation
E Ben-Sasson, A Chiesa, L Goldberg, T Gur, M Riabzev, N Spooner
TCC 2019 (17th Theory of Cryptography Conference), 494-521, 2019
Arthur–Merlin Streaming Complexity
T Gur, R Raz
Information and Computation (ICALP 2013 Special Issue) 243, 145-165, 2015
Strong Locally Testable Codes with Relaxed Local Decoders
O Goldreich, T Gur, I Komargodski
ACM Transactions on Computation Theory 11 (3), 2019
A Generic Coalescent‐Based Framework for the Selection of a Reference Panel for Imputation
B Paşaniuc, R Avinery, T Gur, CF Skibola, PM Bracci, E Halperin
Genetic Epidemiology 34 (8), 773-782, 2010
Relaxed Locally Correctable Codes
T Gur, G Ramnarayan, RD Rothblum
Theory of Computing 16, 1-68, 2020
A Hierarchy Theorem for Interactive Proofs of Proximity
T Gur, RD Rothblum
ITCS 2017 (8th Conference on Innovations in Theoretical Computer Science), 2017
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
O Goldreich, T Gur, RD Rothblum
Information and Computation (ICALP 2015 Special Issue) 261, 175-201, 2018
Universal Locally Testable Codes
O Goldreich, T Gur
Chicago Journal of Theoretical Computer Science 2018 (3), 1-21, 2018
Universal Locally Verifiable Codes and 3-Round Interactive Proofs of Proximity for CSP
O Goldreich, T Gur
Theoretical Computer Science, 2021
On the Power of Relaxed Local Decoding Algorithms
T Gur, O Lachish
SIAM Journal on Computing (SICOMP) 50 (2), 788-813, 2021
Every Set in P Is Strongly Testable under a Suitable Encoding
I Dinur, O Goldreich, T Gur
ITCS 2019 (10th Conference on Innovations in Theoretical Computer Science), 2019
Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
A Chiesa, T Gur, I Shinkar
SODA 2020 (31st ACM-SIAM Symposium on Discrete Algorithms), 2020
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
A Chiesa, MA Forbes, T Gur, N Spooner
Journal of the ACM (JACM) 69 (2), 1-44, 2022
Proofs of Proximity for Distribution Testing
A Chiesa, T Gur
ITCS 2018 (9th Conference on Innovations in Theoretical Computer Science), 2018
Quantum Learning Algorithms Imply Circuit Lower Bounds
S Arunachalam, AB Grilo, T Gur, IC Oliveira, A Sundaram
FOCS 2021 (62nd Annual IEEE Symposium on Foundations of Computer Science), 2021
An Exponential Separation Between MA and AM Proofs of Proximity
T Gur, YP Liu, RD Rothblum
Computational Complexity, 2021
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20