Zongrui Zou: Differentially Private Multiway and k-Cut
44:50
Zongrui Zou: Differentially Private Multiway and k-Cut
Jiatu Li: Yao's lemma is all you need (for derandomization)
50:23
Jiatu Li: Yao's lemma is all you need (for derandomization)
William He: Pseudorandomness Properties of Random Reversible Circuits
50:03
William He: Pseudorandomness Properties of Random Reversible Circuits
Grant Schoenebeck: Eliciting Informative Text Evaluations with Large Language Models
50:41
Grant Schoenebeck: Eliciting Informative Text Evaluations with Large Language Models
Tim Hsieh: Rounding Large Independent Sets on Expanders
49:14
Tim Hsieh: Rounding Large Independent Sets on Expanders
Angelos Pelecanos: On the t-wise Independence of Block Ciphers
47:45
Angelos Pelecanos: On the t-wise Independence of Block Ciphers
Da Wei Zheng: Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
57:30
Da Wei Zheng: Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Peter Manohar: An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
55:09
Peter Manohar: An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes
Tolson Bell: O(1) Insertion for Random Walk d-ary Cuckoo Hashing
50:03
Tolson Bell: O(1) Insertion for Random Walk d-ary Cuckoo Hashing
Bernardo Subercaseaux Roa: SAT-Solving for the Packing Chromatic Number of the Infinite Grid
1:09:33
Bernardo Subercaseaux Roa: SAT-Solving for the Packing Chromatic Number of the Infinite Grid
Dravyansh Sharma: Reliable Learning Under Adversarial Attacks
46:11
Dravyansh Sharma: Reliable Learning Under Adversarial Attacks
Sander Borst: Selection in Explorable Heaps
33:57
Sander Borst: Selection in Explorable Heaps
Neekon Vafa: Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
51:56
Neekon Vafa: Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
Alex Goldberg: Batching of Tasks by Users of Pseudonymous Forums
36:37
Alex Goldberg: Batching of Tasks by Users of Pseudonymous Forums
Bernardo Subercaseaux: Explaining Decision Trees is Harder Than You Would Think!
48:51
Bernardo Subercaseaux: Explaining Decision Trees is Harder Than You Would Think!
Justin Raizes: Obfuscation with Certified Deletion
52:05
Justin Raizes: Obfuscation with Certified Deletion
Noah Singer: Improved streaming approximation algorithms for Maximum Directed Cut
57:27
Noah Singer: Improved streaming approximation algorithms for Maximum Directed Cut
Lisa Masserova: Blockchains Enable Non-Interactive MPC
51:30
Lisa Masserova: Blockchains Enable Non-Interactive MPC
Emre Yolcu: Exponential Separations using Guarded Extension Variables
1:01:02
Emre Yolcu: Exponential Separations using Guarded Extension Variables
Sam McCauley: Theory and Practice of Adaptive Filters
52:20
Sam McCauley: Theory and Practice of Adaptive Filters
Ke Wu: What Can Cryptography Do For Decentralized Mechanism Design?
51:40
Ke Wu: What Can Cryptography Do For Decentralized Mechanism Design?
Chirag Gupta: Faster online calibration without randomization
58:26
Chirag Gupta: Faster online calibration without randomization
Misha Khodak: New Directions in Algorithms with Predictions: Learning and Privacy
57:32
Misha Khodak: New Directions in Algorithms with Predictions: Learning and Privacy
Weijie Su: A Truthful Owner-Assisted Scoring Mechanism for Estimation
57:44
Weijie Su: A Truthful Owner-Assisted Scoring Mechanism for Estimation
Prayaag Venkat: On Fitting Ellipsoids to Random Points
50:55
Prayaag Venkat: On Fitting Ellipsoids to Random Points
Mik Zlatin: New and Improved Algorithms for Steiner Tree Augmentation Problems
41:34
Mik Zlatin: New and Improved Algorithms for Steiner Tree Augmentation Problems
Dravyansh Sharma: Provably Tuning the Elastic Net across Instances
42:57
Dravyansh Sharma: Provably Tuning the Elastic Net across Instances
Mitali Bafna: Global Hypercontractivity on HDX and Applications
55:35
Mitali Bafna: Global Hypercontractivity on HDX and Applications
Mingxun Zhou: Optimal Single-Server Private Information Retrieval
52:52
Mingxun Zhou: Optimal Single-Server Private Information Retrieval
Majid Farhadi: On Hardness & Approximation of Submodular Minimum Linear Ordering Problems
47:12
Majid Farhadi: On Hardness & Approximation of Submodular Minimum Linear Ordering Problems