Tom Gur
@tomgur.bsky.social
Professor of Computer Science at Cambridge.
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, and their interplay with Fourier Analysis & Additive Combinatorics.
To apply or inquire, email me your CV.
Topics include: Classical & Quantum Complexity, Sublinear Algorithms, Coding Theory, Cryptography, Learning Theory, and their interplay with Fourier Analysis & Additive Combinatorics.
To apply or inquire, email me your CV.
October 20, 2025 at 8:15 PM
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, and their interplay with Fourier Analysis & Additive Combinatorics.
To apply or inquire, email me your CV.
Topics include: Classical & Quantum Complexity, Sublinear Algorithms, Coding Theory, Cryptography, Learning Theory, and their interplay with Fourier Analysis & Additive Combinatorics.
To apply or inquire, email me your CV.
Cambridge is recruiting Assistant/Associate Professors in Theoretical Computer Science. #TCS #AcademicJobs
Application deadline: 15 December 2025. Contact me for informal inquiries. See more details and apply here:
www.cst.cam.ac.uk/assistantass...
Application deadline: 15 December 2025. Contact me for informal inquiries. See more details and apply here:
www.cst.cam.ac.uk/assistantass...
October 7, 2025 at 11:38 AM
Cambridge is recruiting Assistant/Associate Professors in Theoretical Computer Science. #TCS #AcademicJobs
Application deadline: 15 December 2025. Contact me for informal inquiries. See more details and apply here:
www.cst.cam.ac.uk/assistantass...
Application deadline: 15 December 2025. Contact me for informal inquiries. See more details and apply here:
www.cst.cam.ac.uk/assistantass...
New arXiv preprint: we show algorithmic versions of the polynomial Freiman–Ruzsa (PFR) theorem of Gowers, Green, Manners, and Tao. Interestingly, our proof draws on quantum information and stabilizer learning algorithms, which we dequantize into classical algorithms.
arxiv.org/pdf/2509.02338
arxiv.org/pdf/2509.02338
September 3, 2025 at 8:48 AM
New arXiv preprint: we show algorithmic versions of the polynomial Freiman–Ruzsa (PFR) theorem of Gowers, Green, Manners, and Tao. Interestingly, our proof draws on quantum information and stabilizer learning algorithms, which we dequantize into classical algorithms.
arxiv.org/pdf/2509.02338
arxiv.org/pdf/2509.02338