Tom Gur

Public lists managed by Tom Gur

• Algorithms and Complexity Seminar
• Quantum Computing Seminar

Talks given by Tom Gur

Obviously this only lists talks that are listed through talks.cam. Furthermore, this facility only works if the speaker's e-mail was specified in a talk. Most talks have not done this.

Talks organised by Tom Gur

This list is based on what was entered into the 'organiser' field in a talk. It may not mean that Tom Gur actually organised the talk, they may have been responsible only for entering the talk into the talks.cam system.

• Complexity in the Era of AI and Data-Driven Computing
• Cryptography, Distribution Verification, and Quantum Advantage
• Exploiting randomness in quantum algorithms
• The Karchmer-Raz-Wigderson Conjecture
• Monotone Circuit Complexity of Matching
• Proximity Gaps for Multilinear Interactive Oracle Proofs
• Extractors for Samplable Distributions from the Two-Source Extractor Recipe
• Classical Commitments to Quantum States
• An Upper Bound on the Weisfeiler-Leman Dimension
• Learning shallow quantum circuits with many-qubit gates
• Expander decompositions
• Build-a-Bear for quantum computer architectures
• Distribution Learning Meets Graph Structure Sampling
• Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error
• A super-linear lower bound for the iteration number of the Weisfeiler-Leman algorithm
• Distinct Elements in Streams and the Klee's Measure Problem
• Classical and Quantum Algorithms for Characters of the Symmetric Group
• The Algebraic Circuit-Based Approach to Proof Complexity
• The Role of piracy in quantum proofs
• Zero-Knowledge in Streaming Interactive Proofs
• Symmetric Quantum Computation
• A stronger bound for linear 3-LCC
• Near-Optimal Alphabet Soundness Tradeoff PCPs
• Interactive proofs for verifying (quantum) learning and testing
• Models that prove their own correctness
• Quantum circuit lower bounds with entangled inputs
• Deniable encryption in a quantum world
• Dimension-free discretization inequalities with applications to low-degree learning
• Rate-1 Zero-Knowledge Proofs from One-Way Functions
• Homomorphism Indistinguishability: Characterisations, Closure, Complexity
• Low Degree Testing over the Reals
• The quantum games PCP: results and confessions
• Transform Arbitrary Good Quantum LDPC Codes into Good Geometrically Local Codes in Any Dimension
• When and why do efficient algorithms exist (for constraint satisfaction and beyond)?
• From Query to Sequential Computation: A New Approach
• A strongly polynomial algorithm for the minimum-cost generalized flow problem
• Incompressibility and Next-Block Pseudoentropy
• Perfect Zero-Knowledge PCPs for #P
• Polynomial-Time Pseudodeterministic Construction of Primes
• The Value of Errors in Proofs
• Understanding linear programming and the simplex algorithm
• Space-Bounded Quantum State Testing via Space-Efficient Quantum Singular Value Transformation
• On Parallel Repetition of PCPs