Tom Gur

Associate Professor
Department of Computer Science
University of Warwick
United Kingdom

E-mail: tom.gur@warwick.ac.uk
Google Scholar profile
Twitter account
I am an associate professor in the Department of Computer Science at the University of Warwick.
I am a member of the Division of Theory and Foundations and the Centre for Discrete Mathematics and its Applications (DIMAP).
My research is supported by a UKRI Future Leaders Fellowship (2020-2027, £1M+).

Prior to joining Warwick, I was a postdoctoral researcher at UC Berkeley.
I received my PhD from the Weizmann Institute of Science, where my advisor was Oded Goldreich.
My research is primarily in the foundations of computer science and their interplay with combinatorics, algebra, and analysis.
Specific interests include algorithms, complexity, coding theory, cryptography, learning theory, and quantum computing.

Prospective students and postdocs: I am interested to hear from potential PhD students and postdocs with a strong TCS/maths background.
If our research interests intersect and you would like to work with me, feel free to drop me a line.

Quantum Computing
This module provides an introduction to quantum computing, focusing on the design and analysis of quantum algorithms, as well as covering topics in quantum information and quantum cryptography.
(Anonymous feedback form for CS419)
Derandomization of Cell Sampling
with Alexander Golovnev and Igor Shinkar
(Preprint)

Quantum Learning Algorithms Imply Circuit Lower Bounds
with Srinivasan Arunachalam, Alex B. Grilo, Igor C. Oliveira, and Aarthi Sundaram
FOCS 2021
QIP 2021
(Video of my QIP talk)

Quantum Proofs of Proximity
with Marcel Dall'Agnol, Subhayan Roy Moulik, and Justin Thaler
TQC 2021
(Video of Marcel's TQC talk)

A Structural Theorem for Local Algorithms with Applications to Testing, Coding, and Privacy
with Marcel Dall'Agnol and Oded Lachish
SODA 2021
(Video of Marcel's SODA talk)

Universal Locally Verifiable Codes and 3-Round Interactive Proofs of Proximity for CSP
with Oded Goldreich
Theoretical Computer Science, 2021

On the Power of Relaxed Local Decoding Algorithms
with Oded Lachish
SODA 2020
SIAM Journal on Computing, 2021
(Videos of my FOCS 2020 Tutorial)

Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity
with Alessandro Chiesa and Igor Shinkar
SODA 2020
SIAM Journal on Computing, 2021 (to appear)

An Entropy Lower Bound for Non-Malleable Extractors
with Igor Shinkar
IEEE Transactions on Information Theory, 2020

Linear-Size Constant-Query IOPs for Delegating Computation
with Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Michael Riabzev, and Nicholas Spooner
TCC 2019

Every Set in P Is Strongly Testable under a Suitable Encoding
with Irit Dinur and Oded Goldreich
ITCS 2019

Spatial Isolation Implies Zero Knowledge Even in a Quantum World
with Alessandro Chiesa, Michael Forbes, and Nicholas Spooner
FOCS 2018
QIP 2019
Journal of the ACM, 2021 (to appear)

An Exponential Separation between MA and AM Proofs of Proximity
with Yang P. Liu and Ron D. Rothblum
ICALP 2018
Computational Complexity, 2021

Proofs of Proximity for Distribution Testing
with Alessandro Chiesa
ITCS 2018
(Video of my FOCS 2017 Workshop talk)

Relaxed Locally Correctable Codes
with Govind Ramnarayan and Ron D. Rothblum
ITCS 2018
Theory of Computing, 2020

Universal Locally Testable Codes
with Oded Goldreich
Chicago Journal of Theoretical Computer Science, 2018

An Adaptivity Hierarchy Theorem for Property Testing
with Clément Canonne
CCC 2017
Computational Complexity, 2018

Distribution Testing Lower Bounds via Reductions from Communication Complexity
with Eric Blais and Clément Canonne
CCC 2017
ACM Transactions on Computation Theory, 2019

A Hierarchy Theorem for Interactive Proofs of Proximity
with Ron D. Rothblum
ITCS 2017
(Video of my ITCS talk)

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
with Oded Goldreich and Ron D. Rothblum
ICALP 2015
Information and Computation, 2018 (special issue for ICALP 2015)

Strong Locally Testable Codes with Relaxed Local Decoders
with Oded Goldreich and Ilan Komargodski
CCC 2015
ACM Transactions on Computation Theory, 2019

Non-Interactive Proofs of Proximity
with Ron D. Rothblum
ITCS 2015
Computational Complexity, 2018

Arthur-Merlin Streaming Complexity
with Ran Raz
ICALP 2013
Information and Computation, 2015 (special issue for ICALP 2013)

Testing Booleanity and the Uncertainty Principle
with Omer Tamuz
Chicago Journal of Theoretical Computer Science, 2013

Leveraging Genetic Variability across Populations for the Identification of Causal Variant
with Noah Zaitlen, Bogdan Pasaniuc, Elad Ziv, and Eran Halperin
American Journal of Human Genetics, 2010

A Generic Coalescent-Based Framework for the Selection of a Reference Panel for Imputation
with Bogdan Pasaniuc, Ram Avinery, Christine F. Skibola, Paige M. Bracci, and Eran Halperin
Genetic Epidemiology, 2010

Thesis

On Locally Verifiable Proofs of Proximity
PhD Thesis, 2017
Awarded the Even Prize in Theoretical Computer Science

Local chair of CCC 2023 (with Artur Czumaj)
Editor in quantum computing for CRC Press, 2021-Present
Organised and taught an MSRI Graduate School on Foundations and Frontiers of Probabilistic Proofs, 2021 (with Alessandro Chiesa; videos available here)
Full member of the EPSRC Peer Review College, 2021-Present
Lead diversity and inclusivity advisor for STOC, 2021-Present
PC member at ITCS 2020
Organised and taught a FOCS 2020 Tutorial on Relaxed Locally Decodable Codes (with Igor Shinkar)
Group leader at the CATCS Visioning Workshop, 2020
Organised the Algorithms UK Workshop, 2019 (with Artur Czumaj and Graham Cormode)
Organised the DIMAP Workshop, 2019 (with Vadim Lozin)
PC member at RANDOM 2018
Email
tom.gur@warwick.ac.uk
Office
CS2.06
Address
Tom Gur
Centre for Discrete Mathematics and its Applications (DIMAP)
Department of Computer Science
University of Warwick
CV4 7AL
United Kingdom