David Wajc On Randomized Online

From the CMU Theory Lunch: http://www.cs.cmu.edu/~./theorylunch/ Link to abstract: http://www.cs.cmu.edu/~.

A Google Algorithms TechTalk, 8/23/17, presented by

Stanford University.

CMU Theory lunch talk from October 30, 2019 by

STOC'22 Workshop Dynamic Algorithms: Recent Advances and Applications ...

CMU Theory lunch talk from November 11, 2020 by

CMU Theory Lunch talk from September 29, 2021 by

Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson,

CMU Theory lunch talk from January 16, 2019 by

Paper presentation at the 23rd ACM Conference on Economics and Computation (EC'22), Boulder, CO, July 12, 2022: Title: ...

Speaker:

Rounding Dynamic Matchings Against an Adaptive Adversary.”

The competitive ratio of a

Paper presentation at the 22nd ACM Conference on Economics and Computation (EC'21), Virtual Conference, July 21, 2021: ...

Thomas Kesselheim, Algorithms and Uncertainty, Summer 2021 Lecture Notes: ...

This is a longer talk accompanying the paper "Universally-Optimal Distributed Algorithms for Known Topologies" by Bernhard ...

Title: Improved