| 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 | 175 | 2010 |
| Non-Interactive Proofs of Proximity T Gur, RD Rothblum Computational Complexity 27 (1), 99–207, 2018 | 77 | 2018 |
| Distribution Testing Lower Bounds via Reductions from Communication Complexity E Blais, CL Canonne, T Gur ACM Transactions on Computation Theory 11 (2), 2019 | 66* | 2019 |
| 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 | 44 | 2019 |
| Relaxed Locally Correctable Codes T Gur, G Ramnarayan, RD Rothblum Theory of Computing 16, 1-68, 2020 | 37 | 2020 |
| An Adaptivity Hierarchy Theorem for Property Testing C Canonne, T Gur Computational Complexity 27, 671-716, 2018 | 34 | 2018 |
| A Hierarchy Theorem for Interactive Proofs of Proximity T Gur, RD Rothblum ITCS 2017 (8th Conference on Innovations in Theoretical Computer Science), 2017 | 34 | 2017 |
| Strong Locally Testable Codes with Relaxed Local Decoders O Goldreich, T Gur, I Komargodski ACM Transactions on Computation Theory 11 (3), 2019 | 32 | 2019 |
| Arthur–Merlin Streaming Complexity T Gur, R Raz Information and Computation (ICALP 2013 Special Issue) 243, 145-165, 2015 | 32 | 2015 |
| 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 | 27 | 2010 |
| Hypercontractivity on High Dimensional Expanders T Gur, N Lifshitz, S Liu STOC 2022 (54th ACM Symposium on Theory of Computing), 2022 | 26 | 2022 |
| 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 | 25 | 2018 |
| On the Power of Relaxed Local Decoding Algorithms T Gur, O Lachish SIAM Journal on Computing (SICOMP) 50 (2), 788-813, 2021 | 22* | 2021 |
| Proofs of Proximity for Distribution Testing A Chiesa, T Gur ITCS 2018 (9th Conference on Innovations in Theoretical Computer Science), 2018 | 22 | 2018 |
| Sublinear Quantum Algorithms for Estimating von Neumann Entropy T Gur, MH Hsieh, S Subramanian QIP 2022 (25th Annual Conference on Quantum Information Processing), 2022 | 20 | 2022 |
| Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity A Chiesa, T Gur, I Shinkar SIAM Journal on Computing (SICOMP) 51 (6), 1839-1865, 2022 | 20 | 2022 |
| 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 | 18 | 2022 |
| Universal Locally Verifiable Codes and 3-Round Interactive Proofs of Proximity for CSP O Goldreich, T Gur Theoretical Computer Science 879, 83-101, 2021 | 18 | 2021 |
| Universal Locally Testable Codes O Goldreich, T Gur Chicago Journal of Theoretical Computer Science 2018 (3), 1-21, 2018 | 16 | 2018 |
| A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification M Dall’Agnol, T Gur, O Lachish SIAM Journal on Computing (SICOMP) 52 (6), 1413-1463, 2023 | 13 | 2023 |
Ron RothblumTechnion在 cs.technion.ac.il 的電子郵件地址已通過驗證