Computational Complexity

1 standalone talk · 1 total lecture · 1 faculty & speakers · 1h recorded

Algorithms & Theoretical CS

Faculty & visiting speakers

Yannic Maus1

Talks & colloquia from Computational Complexity

Self-contained seminars, public lectures, and invited talks.

The Role of Randomness in Local Distributed Graph Problems

19:03

Theory & Algos·Research Seminar

The Role of Randomness in Local Distributed Graph Problems

Yannic Maus·Computational Complexity

Yannic Maus explores the fundamental implications of randomness in local distributed graph problems, analyzing its role in algorithm design and complexity bounds.