Tom Gur
Tom Gur
Associate Professor at University of Warwick
Verified email at warwick.ac.uk - Homepage
Title
Cited by
Cited by
Year
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
1202010
Non-Interactive Proofs of Proximity
T Gur, RD Rothblum
Computational Complexity 27 (1), 99–207, 2018
562018
Distribution Testing Lower Bounds via Reductions from Communication Complexity
E Blais, CL Canonne, T Gur
ACM Transactions on Computation Theory 11 (2), 2019
36*2019
Arthur–Merlin Streaming Complexity
T Gur, R Raz
Information and Computation 243 (ICALP 2013 Special Issue), 145-165, 2015
252015
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
252010
Strong Locally Testable Codes with Relaxed Local Decoders
O Goldreich, T Gur, I Komargodski
ACM Transactions on Computation Theory 11 (3), 2019
24*2019
An Adaptivity Hierarchy Theorem for Property Testing
C Canonne, T Gur
CCC 2017 (32nd IEEE Conference on Computational Complexity), 2017
182017
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
O Goldreich, T Gur, RD Rothblum
Information and Computation 261 (ICALP 2015 Special Issue), 175-201, 2018
162018
Relaxed Locally Correctable Codes
T Gur, G Ramnarayan, RD Rothblum
ITCS 2018 (9th Conference on Innovations in Theoretical Computer Science), 2018
152018
A Hierarchy Theorem for Interactive Proofs of Proximity
T Gur, RD Rothblum
ITCS 2017 (8th Conference on Innovations in Theoretical Computer Science), 2017
142017
Universal Locally Testable Codes
O Goldreich, T Gur
Chicago Journal of Theoretical Computer Science 2018 (3), 1-21, 2018
132018
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
112019
Universal Locally Verifiable Codes and 3-Round Interactive Proofs of Proximity for CSP
O Goldreich, T Gur
Electronic Colloquium on Computational Complexity (ECCC) 23, 192, 2017
102017
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), 2018
92018
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
A Chiesa, MA Forbes, T Gur, N Spooner
FOCS 2018 (59th Annual IEEE Symposium on Foundations of Computer Science), 2018
62018
On the Power of Relaxed Local Decoding Algorithms
T Gur, O Lachish
SODA 2020 (31st ACM-SIAM Symposium on Discrete Algorithms), 2020
3*2020
Testing Booleanity and the Uncertainty Principle
T Gur, O Tamuz
Chicago Journal of Theoretical Computer Science 2013 (14), 1-14, 2013
32013
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
22020
An Entropy Lower Bound for Non-Malleable Extractors
T Gur, I Shinkar
IEEE Transactions on Information Theory 66 (5), 2904-2911, 2019
22019
Proofs of Proximity for Distribution Testing
A Chiesa, T Gur
ITCS 2018 (9th Conference on Innovations in Theoretical Computer Science), 2018
22018
The system can't perform the operation now. Try again later.
Articles 1–20