STOC24 2 A 1 Online Edge Coloring is Nearly as Easy as Offline

(24:40)

STOC24 2 B 4 Learning the coefficients A presentable version of border complexity and applications

(14:31)

STOC24 2 D 1 The Power of Two sided Recruitment in Two sided Markets

(29:34)

STOC24 2 A 4 Low Step Multi Commodity Flow Emulators

(15:43)

STOC24 2 A 3 Near Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs

(21:36)

STOC24 2 A 5 Maximum Bipartite Matching in n^{2+o(1)} Time via a Combinatorial Algorithm

(20:4)

STOC24 2 A 2 Approximate Earth Mover's Distance in Truly Subquadratic Time

(22:26)

STOC24 2 D 2 Strategic Budget Selection in a Competitive Autobidding World

(24:14)

STOC24 2 C 5 Near Optimal Mean Estimation with Unknown, Heteroskedastic Variances

(16:25)

STOC24 2 C 1 Super Non singular Decompositions of Polynomials and their Application to Robustly Lear

(15:45)

STOC24 2 D 3 The Role of Transparency in Repeated First Price Auctions with Unknown Valuations

(17:54)

STOC24 2 D 4 Bilateral Trade with Correlated Values

(21:43)

STOC24 2 C 4 Exploring and Learning in Sparse Linear MDPs without Computationally Intractable Oracle

(19:13)

STOC24 2 B 2 Black Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipo

(24:20)

STOC24 2 C 2 Calibrated Language Models Must Hallucinate

(19:)

STOC24 2 B 5 On the Power of Homogeneous Algebraic Formulas

(18:21)

STOC24 8 C 2 An efficient quantum parallel repetition theorem and applications

(19:20)

STOC24 3 C 2 A New Approach for Non Interactive Zero Knowledge from Learning with Errors

(20:28)

STOC24 2 B 1 Strong Algebras and Radical Sylvester Gallai Configurations

(25:33)