Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, March 27, 2025, 12:15 pm

Duration: 30 minutes

Location: CAB G52

Speaker: Anton Paramonov

Branching Random Walks for Blazing-Fast Broadcasts!

How can we efficiently broadcast multiple messages in a network with severe congestion limits? In this talk, we explore a novel randomized algorithm that leverages parallel branching random walks to achieve near-optimal broadcast time in the CONGEST model. Our approach constructs an efficient tree packing in random graphs, unlocking fast and robust dissemination of information. Along the way, we’ll uncover elegant connections between random walks, network structure, and distributed algorithms. This talk is perfect for anyone who enjoys involved yet high-level and intuitive graph theory!

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login