FOCS 2024 7B New Structures and Algorithms for Length-Constrained Expander Decompositions

(19:5)

FOCS 2024 7A Distinguishing, Predicting, and Certifying

(22:36)

FOCS 2024 Nearly Optimal List Labeling

(18:33)

FOCS 2024 7C Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds

(25:49)

FOCS 2024 3C Efficient Approximation of Fractional Hypertree Width

(18:45)

¡SACÓ CARCAJADAS! 😂 Revive la rutina de Bombo Fica en Festival de Las Condes 2025 ✨

(1:9:24)

my 24 top books of 2024 | BEST reads of the year 📚⭐️

(36:19)

FOCS 2024 10B Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy

(22:19)

FOCS 2024 8C Maximum Flow by Augmenting Paths in $n^{2+o(1)}$ Time

(30:5)

FOCS 2024 10C Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for

(22:32)

FOCS 2024 4C Chernoff-Hoeffding and Reverse Hypercontractivity on High Dimensional Expanders

(15:28)

FOCS 2024 1A A generalization of the Four Color Theorem

(17:9)

FOCS 2024 8A An Improved Line-Point Low-Degree Test

(17:44)

FOCS 2024 6A Proofs of Space with Maximal Hardness

(20:1econd)

FOCS 2024 10B A Strong Separation for Adversarially Robust $\\ell_0$ Estimation for Linear Sketches

(23:58)

FOCS 2024 4C Quantum eigenvalue processing

(17:28)

FOCS 2024 1C Fully Dynamic k-Clustering with Fast Update Time and Small Recourse

(19:41)

FOCS 2024 Plenary 2 - Expanders and PCPs: Emergence from Local to Global

(1:6:27)

FOCS 2024 10B Directed Isoperimetry and Monotonicity Testing: A Dynamical Approach

(19:59)

FOCS 2024 10C The ESPRIT algorithm under high noise

(19:47)

FOCS 2024 7B Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems

(23:51)