Jean-Pierre Demailly: Improved bounds for the Kobayashi conjecture on generic hyperbolicity

(53:56)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs

(43:52)

Keith Rogers: Improved bounds for the Kakeya conjecture using semialgebraic geometry

(43:53)

Part I: Improved mixing time bounds for the Thorp shuffle and L-reversal chain

(1:1:48)

Improved Bounds for the Sunflower Lemma

(1:50:10)

EC'24: Improved Bounds for Fractional Online Matching Problems

(22:57)

Jean-Pierre Demailly: Improved bounds for jet differential operators and the Kobayashi conjecture

(1:8:15)

Improved Bounds for Szemeredi's Theorem Mehtaab Sawney Columbia University

(1:1:40)

Strong Bounds for 3-Progressions

(1:4:48)

E2.B — Improved Bounds for Matching in Random-Order Streams

(25:5)

Natan Rubin: Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions

(49:16)

Tomasz Schoen (UAM): Improved bound in Roth's theorem

(37:20)

The Traveling Salesperson: Better Bounds

(7:8)

Part II:Improved mixing time bounds for the Thorp shuffle and L-reversal chain

(48:42)

Improved Bounds for Distributed Load Balancing

(20:53)

Pablo Shmerkin: Improved bounds for Furstenberg sets and orthogonal projections in the plane

(45:49)

Session 5 - Improved Bounds for perfect sampling of k-colorings in graphs

(26:2)

Session 5 - Improved bounds for the sunflower lemma

(19:31)

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority - Ashwin Nayak

(1:11:58)

Improved Bounds on the Dot Product under Random Projection and Random Sign Projection

(24:12)