Yannic Maus

Researcher

Computational Complexity

1 standalone talk · 1 total lecture · 1h recorded

Algorithms & Theoretical CS

Standalone talks by Yannic Maus

Self-contained public lectures, keynote addresses, and research seminars.

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.