Agent-Based Information Handling in Large Networks. - Robert Elsässer; Ulf Lorenz; Thomas Sauerwald (MFCS, 2004)

On Randomized Broadcasting in Star Graphs. - Robert Elsässer; Thomas Sauerwald (WG, 2005)

Analyzing Disturbed Diffusion on Networks. - Henning Meyerhenke; Thomas Sauerwald (ISAAC, 2006)

Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. - Robert Elsässer; Thomas Sauerwald (STACS, 2007)

Agent-based randomized broadcasting in large networks. - Robert Elsässer; Ulf Lorenz; Thomas Sauerwald (Discret. Appl. Math., 2007)

Randomisierte Protokolle für die Verteilung von Information [Randomized Protocols for Information Dissemination]. - Thomas Sauerwald (Ausgezeichnete Informatikdissertationen, 2008)

A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. - Henning Meyerhenke; Burkhard Monien; Thomas Sauerwald (IPDPS, 2008)

Self-stabilizing Cuts in Synchronous Networks. - Thomas Sauerwald; Dirk Sudholt (SIROCCO, 2008)

The power of memory in randomized broadcasting. - Robert Elsässer; Thomas Sauerwald (SODA, 2008)

On Radio Broadcasting in Random Geometric Graphs. - Robert Elsässer; Leszek Gasieniec; Thomas Sauerwald (DISC, 2008)

Randomized protocols for information dissemination. - Thomas Sauerwald (2008)

The Weighted Coupon Collector's Problem and Applications. - Petra Berenbrink; Thomas Sauerwald (COCOON, 2009)

Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. - Benjamin Doerr; Tobias Friedrich 001; Thomas Sauerwald (ICALP (1), 2009)

A randomized, o(log w)-depth 2 smoothing network. - Marios Mavronicolas; Thomas Sauerwald (SPAA, 2009)

Cover Time and Broadcast Time. - Robert Elsässer; Thomas Sauerwald (STACS, 2009)

Near-perfect load balancing by randomized rounding. - Tobias Friedrich 001; Thomas Sauerwald (STOC, 2009)

On randomized broadcasting in Star graphs. - Robert Elsässer; Ulf Lorenz; Thomas Sauerwald (Discret. Appl. Math., 2009)

Quasirandom Rumor Spreading on Expanders. - Benjamin Doerr; Tobias Friedrich 001; Thomas Sauerwald (Electron. Notes Discret. Math., 2009)

A new diffusion-based multilevel algorithm for computing graph partitions. - Henning Meyerhenke; Burkhard Monien; Thomas Sauerwald (J. Parallel Distributed Comput., 2009)

On the runtime and robustness of randomized broadcasting. - Robert Elsässer; Thomas Sauerwald (Theor. Comput. Sci., 2009)

Discrete load balancing is (almost) as easy as continuous load balancing. - Robert Elsässer; Thomas Sauerwald (PODC, 2010)

Expansion and the cover time of parallel random walks. - Thomas Sauerwald (PODC, 2010)

Speeding Up Random Walks with Neighborhood Exploration. - Petra Berenbrink; Colin Cooper; Robert Elsässer; Tomasz Radzik; Thomas Sauerwald (SODA, 2010)

Efficient Broadcast on Random Geometric Graphs. - Milan Bradonjic; Robert Elsässer; Tobias Friedrich 001; Thomas Sauerwald; Alexandre Stauffer (SODA, 2010)

Brief Announcement: Stabilizing Consensus with the Power of Two Choices. - Benjamin Doerr; Leslie Ann Goldberg; Lorenz Minder; Thomas Sauerwald; Christian Scheideler (DISC, 2010)

On Mixing and Edge Expansion Properties in Randomized Broadcasting. - Thomas Sauerwald (Algorithmica, 2010)

The Cover Time of Deterministic Random Walks. - Tobias Friedrich 001; Thomas Sauerwald (Electron. J. Comb., 2010)

The impact of randomization in smoothing networks. - Marios Mavronicolas; Thomas Sauerwald (Distributed Comput., 2010)

A self-stabilizing algorithm for cut problems in synchronous networks. - Thomas Sauerwald; Dirk Sudholt (Theor. Comput. Sci., 2010)

Faster Coupon Collecting via Replication with Applications in Gossiping. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Lars Nagel 001; Thomas Sauerwald (MFCS, 2011)

Rumor Spreading and Vertex Expansion on Regular Graphs. - Thomas Sauerwald; Alexandre Stauffer (SODA, 2011)

Stabilizing consensus with the power of two choices. - Benjamin Doerr; Leslie Ann Goldberg; Lorenz Minder; Thomas Sauerwald; Christian Scheideler (SPAA, 2011)

Quasirandom rumor spreading: An experimental analysis. - Benjamin Doerr; Tobias Friedrich 001; Marvin Künnemann; Thomas Sauerwald (ACM J. Exp. Algorithmics, 2011)

Smoothed analysis of balancing networks. - Tobias Friedrich 001; Thomas Sauerwald; Dan Vilenchik (Random Struct. Algorithms, 2011)

Tight bounds for the cover time of multiple random walks. - Robert Elsässer; Thomas Sauerwald (Theor. Comput. Sci., 2011)

Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. - Thomas Sauerwald; He Sun 001 (FOCS, 2012)

Counting Arbitrary Subgraphs in Data Streams. - Daniel M. Kane; Kurt Mehlhorn; Thomas Sauerwald; He Sun 001 (ICALP (2), 2012)

Ultra-fast rumor spreading in social networks. - Nikolaos Fountoulakis; Konstantinos Panagiotou; Thomas Sauerwald (SODA, 2012)

Rumor spreading and vertex expansion. - George Giakkoupis; Thomas Sauerwald (SODA, 2012)

Low Randomness Rumor Spreading via Hashing. - George Giakkoupis; Thomas Sauerwald; He Sun 001; Philipp Woelfel (STACS, 2012)

Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning. - Henning Meyerhenke; Thomas Sauerwald (Algorithmica, 2012)

Quasirandom Load Balancing. - Tobias Friedrich 001; Martin Gairing; Thomas Sauerwald (SIAM J. Comput., 2012)

Brief announcement: threshold load balancing in networks. - Martin Hoefer 001; Thomas Sauerwald (PODC, 2013)

Balls into Bins via Local Search. - Paul Bogdan; Thomas Sauerwald; Alexandre Stauffer; He Sun 001 (SODA, 2013)

Balls-into-bins with nearly optimal load distribution. - Petra Berenbrink; Kamyar Khodamoradi; Thomas Sauerwald; Alexandre Stauffer (SPAA, 2013)

Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. - Tobias Friedrich 001; Thomas Sauerwald; Alexandre Stauffer (Algorithmica, 2013)

Threshold Load Balancing in Networks. - Martin Hoefer 001; Thomas Sauerwald (CoRR, 2013)

Fast message dissemination in random geometric networks. - Artur Czumaj; Robert Elsässer; Leszek Gasieniec; Thomas Sauerwald; Xin Wang (Distributed Comput., 2013)

Randomized Rumor Spreading in Dynamic Graphs. - George Giakkoupis; Thomas Sauerwald; Alexandre Stauffer (ICALP (2), 2014)

HIT'nDRIVE: Multi-driver Gene Prioritization Based on Hitting Time. - Raunak Shrestha; Ermin Hodzic; Jake Yeung; Kendric Wang; Thomas Sauerwald; Phuong Dao; Shawn Anderson; Himisha Beltran; Mark A. Rubin; Colin C. Collins; Gholamreza Haffari; Süleyman Cenk Sahinalp (RECOMB, 2014)

Cutoff phenomenon for random walks on Kneser graphs. - Ali Pourmiri; Thomas Sauerwald (Discret. Appl. Math., 2014)

Distributed Selfish Load Balancing on Networks. - Petra Berenbrink; Martin Hoefer 001; Thomas Sauerwald (ACM Trans. Algorithms, 2014)

Quasirandom Rumor Spreading. - Benjamin Doerr; Tobias Friedrich 001; Thomas Sauerwald (ACM Trans. Algorithms, 2014)

Randomised broadcasting: Memory vs. randomness. - Petra Berenbrink; Robert Elsässer; Thomas Sauerwald (Theor. Comput. Sci., 2014)

Ultra-Fast Load Balancing on Scale-Free Networks. - Karl Bringmann; Tobias Friedrich 001; Martin Hoefer 001; Ralf Rothenberger; Thomas Sauerwald (ICALP (2), 2015)

Lock-Free Algorithms under Stochastic Schedulers. - Dan Alistarh; Thomas Sauerwald; Milan Vojnovic (PODC, 2015)

Communication Complexity of Quasirandom Rumor Spreading. - Petra Berenbrink; Robert Elsässer; Thomas Sauerwald (Algorithmica, 2015)

Faster Rumor Spreading With Multiple Calls. - Konstantinos Panagiotou; Ali Pourmiri; Thomas Sauerwald (Electron. J. Comb., 2015)

Randomized Rumour Spreading: The Effect of the Network Topology. - Konstantinos Panagiotou; Xavier Pérez-Giménez; Thomas Sauerwald; He Sun 001 (Comb. Probab. Comput., 2015)

Asymptotic Bounds on the Equilateral Dimension of Hypercubes. - Lorenz Minder; Thomas Sauerwald; Sven-Ake Wegner (Graphs Comb., 2015)

Randomized diffusion for indivisible loads. - Petra Berenbrink; Colin Cooper; Tom Friedetzky; Tobias Friedrich 001; Thomas Sauerwald (J. Comput. Syst. Sci., 2015)

A simple approach for adapting continuous load balancing processes to discrete settings. - Hoda Akbari; Petra Berenbrink; Thomas Sauerwald (Distributed Comput., 2016)

Balls into bins via local search: Cover time and maximum load. - Karl Bringmann; Thomas Sauerwald; Alexandre Stauffer; He Sun 001 (Random Struct. Algorithms, 2016)

Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. - Tobias Friedrich 001; Anton Krohmer; Ralf Rothenberger; Thomas Sauerwald; Andrew M. Sutton (ESA, 2017)

Randomized Load Balancing on Networks with Stochastic Inputs. - Leran Cai; Thomas Sauerwald (ICALP, 2017)

Multiple Random Walks on Paths and Grids. - Andrej Ivaskovic; Adrian Kosowski; Dominik Pajak; Thomas Sauerwald (STACS, 2017)

The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. - Ralf Klasing; Adrian Kosowski; Dominik Pajak; Thomas Sauerwald (Distributed Comput., 2017)

Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. - Thomas Sauerwald; Luca Zanetti (ICALP, 2019)

On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract. - Varun Kanade; Frederik Mallmann-Trenn; Thomas Sauerwald (SODA, 2019)

The Dispersion Time of Random Walks on Finite Graphs. - Nicolás Rivera; Thomas Sauerwald; Alexandre Stauffer; John Sylvester 001 (SPAA, 2019)

Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities. - Thomas Sauerwald; Luca Zanetti (CoRR, 2019)

Choice and Bias in Random Walks. - Agelos Georgakopoulos; John Haslegrave; Thomas Sauerwald; John Sylvester 001 (ITCS, 2020)

Random Walks on Randomly Evolving Graphs. - Leran Cai; Thomas Sauerwald; Luca Zanetti (SIROCCO, 2020)

Spread of Information and Diseases via Random Walks in Sparse Graphs. - George Giakkoupis; Hayk Saribekyan; Thomas Sauerwald (DISC, 2020)

Balanced Allocations with Incomplete Information: The Power of Two Queries. - Dimitrios Los; Thomas Sauerwald (ITCS, 2022)

Accelerated Information Dissemination on Networks with Local and Global Edges. - Sarel Cohen; Philipp Fischbeck; Tobias Friedrich 001; Martin S. Krejca; Thomas Sauerwald (SIROCCO, 2022)

Balanced Allocations: Caching and Packing, Twinning and Thinning. - Dimitrios Los; Thomas Sauerwald; John Sylvester 001 (SODA, 2022)

Brief Announcement: Tight Bounds for Repeated Balls-into-Bins. - Dimitrios Los; Thomas Sauerwald (SPAA, 2022)

Balanced Allocations in Batches: Simplified and Generalized. - Dimitrios Los; Thomas Sauerwald (SPAA, 2022)

The power of two choices for random walks. - Agelos Georgakopoulos; John Haslegrave; Thomas Sauerwald; John Sylvester 001 (Comb. Probab. Comput., 2022)

Time Dependent Biased Random Walks. - John Haslegrave; Thomas Sauerwald; John Sylvester 001 (ACM Trans. Algorithms, 2022)

The Support of Open Versus Closed Random Walks. - Thomas Sauerwald; He Sun 001; Danny Vagnozzi (ICALP, 2023)

Balanced Allocations with Heterogeneous Bins: The Power of Memory. - Dimitrios Los; Thomas Sauerwald; John Sylvester 001 (SODA, 2023)

Balanced Allocations in Batches: The Tower of Two Choices. - Dimitrios Los; Thomas Sauerwald (SPAA, 2023)

Tight Bounds for Repeated Balls-Into-Bins. - Dimitrios Los; Thomas Sauerwald (STACS, 2023)

Balanced Allocation in Batches: The Tower of Two Choices. - Dimitrios Los; Thomas Sauerwald (CoRR, 2023)

Mean-Biased Processes for Balanced Allocations. - Dimitrios Los; Thomas Sauerwald; John Sylvester 001 (CoRR, 2023)

Multiple random walks on graphs: mixing few to cover many. - Nicolás Rivera; Thomas Sauerwald; John Sylvester 001 (Comb. Probab. Comput., 2023)

On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? - Varun Kanade; Frederik Mallmann-Trenn; Thomas Sauerwald (ACM Trans. Algorithms, 2023)

Balanced Allocations with the Choice of Noise. - Dimitrios Los; Thomas Sauerwald (J. ACM, 2023)

Rumors with Changing Credibility. - Charlotte Out; Nicolás Rivera; Thomas Sauerwald; John Sylvester 001 (ITCS, 2024)

Time-Biased Random Walks and Robustness of Expanders. - Sam Olesker-Taylor; Thomas Sauerwald; John Sylvester 001 (CoRR, 2024)

The Power of Filling in Balanced Allocations. - Dimitrios Los; Thomas Sauerwald; John Sylvester 001 (SIAM J. Discret. Math., 2024)

An Improved Drift Theorem for Balanced Allocations. - Dimitrios Los; Thomas Sauerwald (ACM Trans. Algorithms, 2024)