Tom Gur (@TomGur) / X

Tom Gur

698 posts

Tom Gur

@TomGur

Professor @Cambridge_Uni. My research is in Theoretical Computer Science and Quantum Computing.

Cambridge, UK

cst.cam.ac.uk/people/tg508

Joined August 2019

Tom Gur
@TomGur
Jan 6, 2023
Happy to finally share this paper, which has been 4 years in the making. In a sentence, we construct general-purpose zero-knowledge proofs (leaking no information other than the correctness of the statement) in the setting of massive data streams.🧵 arxiv.org/abs/2301.02161
197K
Tom Gur
@TomGur
Apr 29, 2023
I am happy to share that I will join the University of Cambridge as an Associate Professor this summer! I have PhD and postdoc positions available. Candidates with a strong background in Theoretical Computer Science and Quantum Computing are welcome to email me.
86K
Tom Gur
@TomGur
Oct 20, 2025
I’m looking for postdocs and PhD students to join my group at Cambridge! Topics include: Classical & Quantum Complexity, Sublinear Algorithms, Coding Theory, Cryptography, Learning Theory, Fourier Analysis, and Additive Combinatorics. To apply or inquire, email me your CV.
66K
Tom Gur
@TomGur
Apr 12, 2024
The Tim Gowers event at Cambridge concluded with a thought-provoking talk by Terry Tao on the proof of the Polynomial Freiman–Ruzsa conjecture and its formalisation in Lean. By the end, it seemed the entire audience pondered whether maths as we know it is about to change forever.
67K
Tom Gur
@TomGur
Jun 15, 2024
Gil Cohen is teaching a fantastic course about Free Probability (generalising classical probability theory to the non-commutative setting) from the perspective of theoretical computer science. Highly recommended! Lecture recordings are available here:
youtube.com
Free Probability Theory and Ramanujan Graphs - Spring 2024
These are the recorded lectures, given in English, for a course I am currently teaching at Tel Aviv University (in the Spring of 2024). The goal is to introd...
20K
Tom Gur
@TomGur
Apr 16, 2024
Avi Wigderson gave a truly inspiring talk yesterday at @Cambridge_CL about the value of errors in proofs. The video will be posted shortly on the Cambridge Algorithms and Complexity Workshop webpage. cl.cam.ac.uk/~tg508/cacw202…
16K
Tom Gur
@TomGur
Dec 1, 2024
An advent calendar of some of my favourite TCS/Maths talks. Day #1: Avi Wigderson on Reading Alan Turing. It is a gem of a talk, full of insights about Turing's work, writing style, and influences on mathematics and computer science. Pure joy!
23K
Tom Gur
@TomGur
Oct 9, 2024
Postdoc and PhD student positions are available at Cambridge in one or more of the following topics: – Complexity Theory – Quantum Complexity Theory – Sublinear Algorithms – Additive Combinatorics / Fourier Analysis More details here: cstheory-jobs.org/2024/10/09/pos…
14K
Tom Gur
@TomGur
Sep 15, 2021
Wow!!! Dinur, Evra, Livne, Lubotzky, and Mozes constructed Locally Testable Codes with Constant Rate, Distance, and Locality, using what appears to be a variant of high dimensional expanders. This is a *monumental* achievement, a culmination of over two decades of research! 1/5
Tom Gur
@TomGur
Nov 9, 2022
What an exciting result and a massive blow to the random circuit sampling approach!
Tom Gur
@TomGur
Nov 12, 2022
Another fascinating paper, this time by Zvika Brakerski, just appeared on the arxiv. I'm always excited to see these deep connections between cryptography/complexity theory and theoretical physics. arxiv.org/pdf/2211.05491…
Tom Gur
@TomGur
Apr 12, 2024
I'm very proud to say Marcel was my PhD student!
Princeton Computer Science
@PrincetonCS
Apr 12, 2024
Marcel Dall'Agnol, an expert in theoretical computer science, joined the department as teaching faculty in September 2023. Dall'Agnol was an elementary school teacher for disadvantaged students before completing his Ph.D. @uniofwarwick. Learn more: bit.ly/3xGAUj3
31K
Tom Gur
@TomGur
Nov 13, 2024
Excited to share this new paper with Jack O'Connor and @_nickspoon! We improve our ZK-PCP construction to cover all of NEXP (with exponential proofs), scale it to NP with polynomial proofs, and obtain O(1)-locality via composition--yielding a ZK analogue of the PCP theorem. 1/3
23K
Tom Gur
@TomGur
May 13, 2024
Alessandro Chiesa and Eylon Yogev just released a splendid book about building cryptographic proofs from hash functions. The book is available for free here: hash-based-snargs-book.github.io
17K