Theory Seminar

Upcoming and Past Talks

Beating Bellman-Ford: Faster Single-Source Shortest Paths with Negative Weights

Jeremy Fineman

1 min read · November 07, 2024

2024 · algorithms · fall-2024
Communication Complexity of Partial XOR Functions

Vladimir Podolskii

2 min read · October 24, 2024

2024 · communication complexity · fall-2024
Secure Auctions for Rational Parties

Girisha Shankar

2 min read · October 18, 2024

2024 · cryptography · fall-2024
Quantum approach to classical optimization: why bother and what to do?

Jiaqi Leng

2 min read · April 12, 2024

2024 · optimization · spring-2024
Online Aggregation Problems with Delay

William Umboh

1 min read · January 12, 2024

2024 · distributed algorithms · spring-2024