49:14

Tim Hsieh: Rounding Large Independent Sets on Expanders

47:45

Angelos Pelecanos: On the t-wise Independence of Block Ciphers

57:30

Da Wei Zheng: Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs

55:09

Peter Manohar: An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes

50:03

Tolson Bell: O(1) Insertion for Random Walk d-ary Cuckoo Hashing

01:09:33

Bernardo Subercaseaux Roa: SAT-Solving for the Packing Chromatic Number of the Infinite Grid

46:11

Dravyansh Sharma: Reliable Learning Under Adversarial Attacks

33:57

Sander Borst: Selection in Explorable Heaps

51:56

Neekon Vafa: Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures

36:37

Alex Goldberg: Batching of Tasks by Users of Pseudonymous Forums

48:51

Bernardo Subercaseaux: Explaining Decision Trees is Harder Than You Would Think!

52:05

Justin Raizes: Obfuscation with Certified Deletion

57:27

Noah Singer: Improved streaming approximation algorithms for Maximum Directed Cut

51:30

Lisa Masserova: Blockchains Enable Non-Interactive MPC

01:01:02

Emre Yolcu: Exponential Separations using Guarded Extension Variables

52:20

Sam McCauley: Theory and Practice of Adaptive Filters

51:40

Ke Wu: What Can Cryptography Do For Decentralized Mechanism Design?

58:26

Chirag Gupta: Faster online calibration without randomization

57:32

Misha Khodak: New Directions in Algorithms with Predictions: Learning and Privacy

57:44

Weijie Su: A Truthful Owner-Assisted Scoring Mechanism for Estimation

50:55

Prayaag Venkat: On Fitting Ellipsoids to Random Points

41:34

Mik Zlatin: New and Improved Algorithms for Steiner Tree Augmentation Problems

42:57

Dravyansh Sharma: Provably Tuning the Elastic Net across Instances

55:35

Mitali Bafna: Global Hypercontractivity on HDX and Applications

52:52

Mingxun Zhou: Optimal Single-Server Private Information Retrieval

47:12

Majid Farhadi: On Hardness & Approximation of Submodular Minimum Linear Ordering Problems

52:11

Dravyansh Sharma: Data-driven Semi-supervised Learning

01:04:08

Michael Mitzenmacher: Algorithms with Predictions

01:03:56

Siddharth Prasad: Learning to Cut in Integer Programming

01:02:10

Samson Zhou: Memory Bounds for the Experts Problem

49:47

Ke Wu: A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss

58:54

João Ribeiro: Low-degree Polynomials, Local Sources, and a Curious Log Factor

56:20

Brian Zhang: Fixed-Parameter Algorithms for Optimal Correlation in General-Sum Extensive-Form Games

55:30

Tim Hsieh: Algorithmic Thresholds for Refuting Random Polynomial Systems

01:02:45

Roie Levin: Random Order Set Cover is as Easy as Offline

01:03:33

Bernhard Haeupler: Universally-Optimal Distributed Optimization

59:13

Ainesh Bakshi: Low-Rank Approximation with (1/ϵ)^1/3 Matrix-Vector Products

57:53

Zihan Tan: Improved Approximation Algorithms for Graph Crossing Number

57:44

Nihar Shah: Two F-words in Peer Review (Fraud and Feedback)

51:52

Isaac Grosof: WCFS Queues: A new analysis framework

01:04:57

Divyarthi Mohan: Simplicity and Optimality in Multi-Item Auctions

44:14

Jeff Xu: Sum of Squares Lower Bounds for Sparse Independent Set

01:04:28

Ian Waudby-Smith: Estimating means of bounded random variables by betting

01:10:59

Hao Chung: Foundations of Transaction Fee Mechanism Design

48:22

Praneeth Kacham: Fast and Small Subspace Embeddings

01:04:39

Daniel Anderson: Parallel Minimum Cuts in O(m log² n) Work and Low Depth

59:53

Aaditya Ramdas: Comparing sequential forecasters

57:14

Theo McKenzie: Many nodal domains in random regular graphs

01:04:10

Jonathan Ullman: The Limits of Pan Privacy and Shuffle Privacy for Learning and Estimation

59:07

Kevin Pratt: Elementary High-Dimensional Expanders from Chevalley Groups

01:05:12

David Wajc: Online Stochastic Max-Weight Bipartite Matching: Beyond Prophet Inequalities

42:22

Sandeep Silwal: Dimensionality Reduction for Clustering Problems

01:05:31

Peter Manohar: Algorithms and Certificates for Boolean CSP Refutation

58:06

Mor Harchol-Balter: Optimal Scheduling for Multi-Server Systems

56:47

Samson Zhou: Tight Bounds for Adversarially Robust Streams and Sliding Windows

01:06:00

Yihan Zhang: Complete Positivity in Adversarial Information Theory

01:09:23

Alex Wang: New notions of simultaneous diagonalizability of quadratic forms w/ applications to QCQPs

01:05:02

Sidhanth Mohanty: Computational Phase Transitions in Sparse Planted Problems?

50:44

Dravyansh Sharma: Adversarial Robustness: Knowing what you don't know

01:04:34

Matthew Fahrbach: Edge-Weighted Online Bipartite Matching