1:59:36
Spectral Algorithms from Induced Subgraphs of Cayley Graphs - Peter Manohar
Institute for Advanced Study
1:17:02
On Approximability of Satisfiable Constraint Satisfaction Problems & Applications - Amey Bhangale
2:06:47
Explicit Codes Approaching the Generalized Singleton Bound Using Expanders - Shashank Srivastava
2:10:00
Random Matrices From GLn(q) Sampled by Words - Doron Puder
1:09:25
Structure and Randomness for Finite-field Polynomials are (almost) Equivalent - Guy Moshkovitz
2:06:41
Problems in Extremal Combinatorics and Connections with Multiparty Communication... - Zander Kelley
2:10:12
Grid-norm Regularity for Somewhat Dense Graphs, and Some Applications - Zander Kelley
1:05:57
Efficient Batch Verification: Recent Progress and Challenges - Ron Rothblum
2:01:09
A Review of the Notion of Graph Rigidity and Some Recent Developments - Orit Raz
1:05:28
QMA vs. QCMA and Pseudorandomness - Henry Yuen
1:59:23
Simple High Dimensional Expanders from Cayley Graphs - Yotam Dikstein
1:19:48
Dot-Product Proofs - Yuval Ishai
1:57:54
Quadratic Stability of the Brunn-Minkowski Inequality - Peter van Hintum
1:08:06
Induced Subgraphs and Pathwidth - Maria Chudnovsky
1:57:45
Linear Stability of the Brunn-Minkowski Inequality - Peter van Hintum
1:07:20
Quantum Locally Testable Codes and Codes with Transversal Gates - David (Ting-Chun) Lin
1:43:51
Fault Tolerant Routing Protocols on High-Dimensional Expanders - Mitali Bafna
1:05:29
Quasi-Linear Size PCPs with Small Soundness from High-Dimensional Expanders - Mitali Bafna
2:05:40
Sheaves on Graphs, the Hanna Neumann Conjecture, and My Debt to Number Theory and... - Joel Friedman
1:05:24
When and How are (promise) Constraint Satisfaction Problems Efficiently Sol...- Venkatesan Guruswami
2:06:10
Analytic Insights into the Zig-Zag Product and Its Friends: Part II - Gil Cohen
1:13:38
Subgroup Tests and the Aldous--Lyons Conjecture - Michael Chapman
1:08:05
Analytic Insights into the Zig-Zag Product and Its Friends: Part I - Gil Cohen
2:01:40
Subgroup Tests and Tailored Non-local Games - Michael Chapman
2:07:02
A New Approach to Strong Convergence - Ramon Van Handel
1:02:21
Sorting Using Partial Information - Robert Tarjan
2:08:22
Concentration on HDX: Derandomization Beyond Chernoff - Max Hopkins
58:59
An Improved Line-Point Low-Degree Test - Prahladh Harsha
1:58:54
Resolution of the Kohayakawa--Kreuter Conjecture - Raphael Steiner
1:15:47
Quantum Mechanics, Semidefinite Programming, and Graph Invariants - Matthew Hastings
1:06:15
Rounding Large Independent Sets on Expanders - Tim Hsieh
1:47:18
Incidence Bounds via Extremal Graph Theory - Istvan Tomon
54:06
Triangulated Surfaces in Moduli Space - Sahana Vasudevan
1:17:14
Lower Bounds for Set-Multilinear Branching Programs - Shubhangi Saraf
2:00:34
Random Cayley Graphs From a Combinatorial Perspective - Huy Tuan Pham
Additive Combinatorics Without Groups - Huy Tuan Pham
1:44:09
Parallel Repetition for 3-Player XOR Games - Yang Liu
1:07:47
Graphs, CSPs and Codes - Madhu Sudan
4:48
Avi Wigderson, 2023 Turing Award Laureate, Q&A with David Nirenberg | Institute for Advanced Study
1:52:10
The Method of Hypergraph Containers - Wojciech Samotij
1:07:19
Polynomial Capacity and its Applications: To TSP and Beyond - Jonathan Leake
1:57:00
New Derandomized Agreement Testers - Yotam Dikstein
1:09:19
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries - Huacheng Yu
1:14:27
Sparsification of Gaussian Processes - Anindya De
1:51:20
Locally Consistent Decomposition of Strings with Applications to Edit Distance Ske...- Michal Koucký
1:16:44
Explicit SoS Lower Bounds from High Dimensional Expanders - Max Hopkins
2:02:13
Computing Greatest Common Divisors of Polynomials in Parallel - Robert Andrews
1:07:06
Stability and Learning in Strategic Games - Éva Tardos
2:03:51
Analyzing the Max Entropy Algorithm for TSP - Nathan Klein
2:11:44
Reconstruction on Trees and Hypertrees - Yuzhou Gu
Advances in Parallel and Private Stochastic Optimization from Ball Acceleration - Kevin Tian
An Exponential Lower bound on Three Query, Linear Locally Correctable Codes - Pravesh Kothari
1:15:18
Expanding the Reach of P not equal to NP: the Minimum Circuit Size Problem with a... - Rahul Ilango
2:21:04
Omniprediction and Multigroup Fairness - Parikshit Gopalan
1:18:09
The Tree Evaluation Problem: Context and Recent Results - Ian Mertz
2:02:15
Online Discrepancy Minimization - Victor Reis
1:09:44
Marton's Conjecture, aka the Polynomial Freiman--Ruzsa conjecture - Frederick Manners
1:04:05
Online Omniprediction - Sumegha Garg
2:06:07
Coboundary and Cosystolic Expansion - Siqi Liu
Toward Better Depth Lower Bounds: A KRW-like theorem for Strong Composition - Or Meir
2:02:23
Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting- William Hoza
1:13:17
Recent Progress on Derandomizing Space-Bounded Computation - William Hoza
1:41:46
Sparsifying Sums of Functions - Yang Liu
1:13:08
Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications - Nitya Mani
2:08:23
The Iterative Win-Win Method, and Explicit Constructions (without) Using It - Hanlin Ren
51:26
A Definition of Spectral Gap for Nonreversible Markov Chains - Sourav Chatterjee
1:59:52
High Dimensional Expanders and Sparsifications of the Johnson Graph - Yotam Dikstein
1:05:45
A High Dimensional Goldreich-Levin Theorem - Silas Richelson
1:49:53
An Optimization Perspective on Log-concave Sampling - Sinho Chewi
1:06:29
A Proof of the RM Code Capacity Conjecture - Emmanuel Abbé
1:49:25
Extending Generalization Theory towards addressing modern challenges in Machine Learning- Shay Moran
58:19
A Combinatorial Characterization of Minimax in Win/Lose Games - Shay Moran
1:51:08
Shrinkage Under Random Restrictions - Robert Andrews
1:08:19
Private Optimization and Statistical Physics: Low-Rank Matrix Approximation - Nisheeth Vishnoi
1:34:26
Learning from Dynamics - Ankur Moitra
1:09:18
The Diffraction Limit and Extremal Functions - Ankur Moitra
1:47:19
Optimization, Complexity and Math (or, can we prove P!=NP by gradient descent?) - Avi Wigderson
2:09:46
Using Expanders for Fast Graph Algorithms - Thatchaphol Saranurak
53:42
Graph Vertex Expansion - Theo McKenzie
2:05:41
Fitting Various Metrics with Minimum Disagreements - Euiwoong Lee
1:16:58
A Constant Lower Bound for Frankl's Union-Closed Sets Conjecture - Justin Gilmer
1:53:09
A Unified Approach to Discrepancy Minimization - Nikhil Bansal
1:01:21
Approximating Iterated Multiplication of Stochastic Matrices in Small Space - Dean Doron
1:44:05
Existence of Subspace Designs - Ashwin Sah
1:09:40
Unit and Distinct Distances in Typical Norms - Noga Alon
2:26:11
Updates on the Lipschitz Extension Problem - Assaf Naor
59:05
Quantum Error Correction, Systolic Geometry, and Probabilistic Embeddings - Elia Portnoy
1:58:11
Hausdorff Dimension Analogues of the Elekes - Ronyai Theorem and Related Problems - Orit Raz
1:02:22
Common Linear Patterns Are Rare - Nina Kamčev
1:50:44
The Lens of Abelian Embeddings - Dor Minzer
1:55:28
Strong Bounds for 3-Progressions: In-Depth - Zander Kelley
49:18
Extremal Problems for Uniformly Dense Hypergraphs - Mathias Schacht
54:32
Strong Bounds for 3-Progressions - Raghu Meka
1:17:50
Why Can’t We Classically Describe Quantum Systems? - Chinmay Nirkhe
1:57:26
Recent Progress in Randomness Extraction - Eshan Chattopadhyay
1:02:19
Two (More) Algorithms for Set Cover - Anupam Gupta
2:02:11
From Robust Sublinear Expanders to Additive Number Theory via Rainbow Cycles - Matija Bucic
2:03:54
Rainbow Matchings in Hypergraphs - Cosmin Pohoata
1:05:19
Efficient Verification of Computation on Untrusted Platforms - Yael Kalai
2:01:00
Overview and Recent Results in Combinatorial Auctions - Matt Weinberg
1:13:06
Smooth Coverings of Space - Oded Regev
54:33
On Matrix Multiplication and Polynomial Identity Testing - Robert Andrews
1:54:03
Locally Decodable Codes - Zeev Dvir
Non-measurability of the inverse theorem for the Gowers norms - Terence Tao
1:08:12
A Characterization of Multiclass Learnability - Nataly Brukhim
1:02:38
Optimization-Friendly Generic Mechanisms Without Money - Mark Braverman
1:14:22
Online List Labeling: Breaking the log2 n Barrier - Nicole Wein
1:00:00
Optimal Weak to Strong Learning - Kasper Green Larsen
1:00:28
Superfast Derandomization of Interactive Proof Systems - Roei Tell
2:00:29
The Hypergraph Container Method, Partition Containers, and Algorithmic Applications - Or Zamir
1:01:34
Algorithmic Stochastic Localization for the Sherrington-Kirkpatrick Model - Mark Sellke
1:58:20
The Polynomial Method in Communication Complexity - Pei Wu
1:15:06
Strong XOR Lemma for Communication with Bounded Rounds - Huacheng Yu
1:53:10
Additive combinatorics through the lens of communication complexity - Toniann Pitassi
57:51
Communication and Query Complexity of Bipartite Perfect Matching - Yuval Efron
1:57:41
Introduction to Natural Quasirandomness: Unique Colorability and Order-ability - Leonardo Coregliano
57:44
Smoothed Complexity of Local Max-Cut with Two Flips - Xi Chen
1:12:14
Average-Case Computational Complexity of Tensor Decomposition - Alex Wein
1:41:36
Almost Linear Time Algorithms for Max-flow and More - Sushant Sachdeva
53:30
The Optimal Error Resilience of Interactive Communication over the Binary Alphabet - Rachel Zhang
1:12:38
Is your distribution in shape? - Ronitt Rubinfeld
2:06:44
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Ampli... - Fernando Granha Jeronimo
1:02:20
Relative rank and regularity - Tamar Ziegler
1:57:37
Robust sublinear expanders, and an application towards the Erdos-Gallai conjecture - Matija Bucic
1:13:32
Making Proofs More Constructive, and Algorithms Less Random - Oliver Korten
1:10:58
Graphs as geometric objects - Nathan Linial
1:28:24
On Approximability of CSPs on Satisfiable Instances - Subhash Khot
2:00:02
Exact algorithms for graph coloring - Or Zamir
54:48
List decoding with double samplers - Inbal Livni-Navon
2:07:20
An Introduction to Binary Code Bounds - Fernando Granha Jeronimo
1:55:12
An Introduction to Lifted Expander Graphs - Fernando Granha Jeronimo
1:43:42
Norm Minimization, Invariant Theory, and the Jacobian conjecture - William Cole Franks
1:13:11
Reproducibility in Learning - Jessica Sorrell
51:52
Bias vs Low Rank of Polynomials with...Algebraic Geometry - Abhishek Bhowmick
1:16:59
Algorithmizing the Multiplicity Schwartz-Zippel Lemma - Prahladh Harsha
1:00:32
Random algebraic varieties and their applications to hardness of approximation - Bhargav Narayanan
1:59:07
Derandomization and its connections throughout complexity theory - Roei Tell
2:01:05
Derandomization and its connections throughout complexity theory - Liije Chen
1:54:17
Non-Black-Box Derandomization - Roei Tell
1:22:10
Refuting Smoothed k-SAT Formulas and a Proof of Feige's Conjecture - Pravesh Kothari
2:05:32
Association schemes and codes II: Completeness of the hierarchy of high-order...-Leonardo Coregliano
1:24:37
A Proof of the Kahn-Kalai Conjecture - Jinyoung Park
2:06:33
Association schemes and codes I: The Delsarte linear program - Leonardo Coregliano
Polynomial Bounds on Parallel Repetition For All 3-Player Games with Binary Inputs - Kunal Mittal
1:46:16
A Tutorial on Gaussian Elimination - John C Urschel
1:26:36
Set Chasing, with an application to online shortest path - Sébastien Bubeck
2:06:46
Multi-group fairness, loss minimization and indistinguishability - Parikshit Gopalan
2:04:01
A magnetic interpretation of the nodal count on graphs - Lior Alon
1:12:12
Many Nodal Domains in Random Regular Graphs - Nikhil Srivastava
2:01:18
The absorption method, and an application to an old Ramsey problem - Matija Bucic
1:03:56
Linear cover time is exponentially unlikely - Quentin Dubroff
2:00:50
Localization schemes: A framework for proving mixing bounds for Markov chains - Ronen Eldan
1:12:42
Online Bipartite Matching and Adwords - Vijay V. Vazirani
2:04:34
1:04:38
Multi-group learning via Outcome Indistinguishability - Gal Yona
2:00:28
Hardness of Easy Problems and Fine-Grained Complexity - Or Zamir
1:14:03
The Minimum Formula Size Problem is (ETH) Hard - Rahul Ilango
2:17:30
Introduction to Continuous Combinatorics II: semantic limits - Leonardo Coregliano
1:17:31
The Kakeya Set conjecture over Z mod N for general N - Manik Dhar
2:11:45
Introduction to Continuous Combinatorics I: the semidefinite method of flag... - Leonardo Coregliano
1:01:33
Parallel Repetition for the GHZ Game: A Simpler Proof - Uma Girish
2:07:37
Locally testable codes with constant rate, distance, and locality, Part II - Irit Dinur
Locally testable codes with constant rate, distance, and locality, Part I - Irit Dinur
2:10:22
An Introduction to Determinantal Point Processes - John C Urschel
1:18:12
Sharp matrix concentration inequalities - Ramon van Handel
1:53:50
Recent progress in query complexity I & II Part 2 - Pei Wu
1:24:45
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS - Alexandros Hollender
2:08:54
Recent progress in query complexity I & II - Pei Wu
1:13:01
Verifying The Unseen: Interactive Proofs for Label-Invariant Distribution Properties - Guy Rothblum
1:51:48
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits II : A more... - Sébastien Tavenas
1:04:21
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits I... - Srikanth Srinivasan
2:12:31
Linear spaces of matrices - Avi Wigderson
Expander Random Walks: A Fourier-Analytic Approach - Gil Cohen
1:18:08
A Complexity-Theoretic Perspective on Fairness - Michael P. Kim
1:52:51
On Chen’s recent breakthrough on the Kannan-Lovasz-Simonovits conjecture... Part III - Ronen Eldan
2:01:19
On Chen’s recent breakthrough on the Kannan-Lovasz-Simonovits conjecture and Bourga... - Ronen Eldan
2:08:58
1:13:00
Privacy as Stability, for Generalization - Katrina Legitt
1:59:12
How difficult is it to certify that a random 3SAT formula is unsatisfiable? - Toniann Pitassi
1:06:08
Pandora's Box with Correlations: Learning and Approximation - Shuchi Chawla
Computational - Statistical gaps and the Group Testing problem - Fotis Iliopoulos
1:19:57
Approximating Max Cut with Subexponential Linear Programs - Tselil Schramm
2:11:06
Amortized circuit complexity, formal complexity measures, and catalytic algorithms - Jeroen Zuiddam
1:35:52
The abstract chromatic number - Leonardo Nagami Coregliano
Polynomial systems and mixed volumes - Ricky I Liu
1:57:44
Random k-out subgraphs - Or Zamir
1:14:52
Strong refutation of semi-random Boolean CSPs - Venkatesan Guruswami
2:00:44
Solving Laplacian Systems of Directed Graphs - John Peebles
1:00:33
Rainbow structures, Latin squares & graph decompositions - Benny Sudakov
1:51:32
Introduction to Laplacian Linear Systems for Undirected Graphs - John Peebles
1:24:38
Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expan - Zongchen Chen
1:08:20
High dimensional expanders - Part 2 - Shai Evra
1:12:47
Monotone Arithmetic Circuit Lower Bounds Via Communication Complexity - Arkadev Chattopadhyay
2:11:58
High dimensional expanders - Shai Evra
1:15:38
Total Functions in the Polynomial Hierarchy - Robert Kleinberg
2:02:35
Log-concave polynomials in theory and applications - Part 2 - Cynthia Vinzant
1:09:13
Graph Density Inequalities, Sums of Squares and Tropicalization - Annie Raymond
2:05:00
Log-concave polynomials in theory and applications - Cynthia Vinzant
1:21:26
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games... - Andrew Drucker
2:15:05
High Dimensional Expanders and Ramanujan Complexes - Alexander Lubotzky
