| 2026 | AofA | Graphical Balanced Allocations with Removals. | Sam Olesker-Taylor, Thomas Sauerwald, Luca Zanetti |
| 2026 | SODA | (Almost) Perfect Discrete Iterative Load Balancing. | Petra Berenbrink, Robert Elssser, Tom Friedetzky, Hamed Hosseinpour, Dominik Kaaser, Peter Kling, Thomas Sauerwald |
| 2026 | SODA | Time-Biased Random Walks and Robustness of Expanders. | Sam Olesker-Taylor, Thomas Sauerwald, John Sylvester |
| 2023 | ICALP | The Support of Open Versus Closed Random Walks. | Thomas Sauerwald, He Sun, Danny Vagnozzi |
| 2023 | SODA | Balanced Allocations with Heterogeneous Bins: The Power of Memory. | Dimitrios Los, Thomas Sauerwald, John Sylvester |
| 2023 | STACS | Tight Bounds for Repeated Balls-Into-Bins. | Dimitrios Los, Thomas Sauerwald |
| 2023 | SPAA | Balanced Allocations in Batches: The Tower of Two Choices. | Dimitrios Los, Thomas Sauerwald |
| 2022 | PODC | Balanced Allocations with the Choice of Noise. | Dimitrios Los, Thomas Sauerwald |
| 2022 | SODA | Balanced Allocations: Caching and Packing, Twinning and Thinning. | Dimitrios Los, Thomas Sauerwald, John Sylvester |
| 2022 | SPAA | Brief Announcement: Tight Bounds for Repeated Balls-into-Bins. | Dimitrios Los, Thomas Sauerwald |
| 2022 | SPAA | Balanced Allocations in Batches: Simplified and Generalized. | Dimitrios Los, Thomas Sauerwald |
| 2022 | SIROCCO | Accelerated Information Dissemination on Networks with Local and Global Edges. | Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca, Thomas Sauerwald |
| 2021 | ICALP | Multiple Random Walks on Graphs: Mixing Few to Cover Many. | Nicols Rivera, Thomas Sauerwald, John Sylvester |
| 2020 | SIROCCO | Random Walks on Randomly Evolving Graphs. | Leran Cai, Thomas Sauerwald, Luca Zanetti |
| 2019 | ICALP | Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. | Thomas Sauerwald, Luca Zanetti |
| 2019 | SODA | On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract. | Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald |
| 2019 | SPAA | The Dispersion Time of Random Walks on Finite Graphs. | Nicols Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester |
| 2017 | ESA | Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. | Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton |
| 2017 | ICALP | Randomized Load Balancing on Networks with Stochastic Inputs. | Leran Cai, Thomas Sauerwald |
| 2017 | STACS | Multiple Random Walks on Paths and Grids. | Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald |
| 2015 | ICALP | Ultra-Fast Load Balancing on Scale-Free Networks. | Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald |
| 2015 | PODC | Lock-Free Algorithms under Stochastic Schedulers. | Dan Alistarh, Thomas Sauerwald, Milan Vojnovic |
| 2014 | ICALP | Randomized Rumor Spreading in Dynamic Graphs. | George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer |
| 2014 | RECOMB | 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, Sleyman Cenk Sahinalp |
| 2014 | STACS | Balls into bins via local search: cover time and maximum load. | Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun |
| 2013 | ISAAC | Faster Rumor Spreading with Multiple Calls. | Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald |
| 2013 | PODC | Brief announcement: threshold load balancing in networks. | Martin Hoefer, Thomas Sauerwald |
| 2013 | PODC | The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. | Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald |
| 2013 | SODA | Balls into Bins via Local Search. | Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun |
| 2013 | SPAA | Balls-into-bins with nearly optimal load distribution. | Petra Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre Stauffer |
| 2012 | FOCS | Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. | Thomas Sauerwald, He Sun |
| 2012 | ICALP | Counting Arbitrary Subgraphs in Data Streams. | Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun |
| 2012 | PODC | A simple approach for adapting continuous load balancing processes to discrete settings. | Hoda Akbari, Petra Berenbrink, Thomas Sauerwald |
| 2012 | SODA | Ultra-fast rumor spreading in social networks. | Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald |
| 2012 | SODA | Rumor spreading and vertex expansion. | George Giakkoupis, Thomas Sauerwald |
| 2012 | STACS | Low Randomness Rumor Spreading via Hashing. | George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel |
| 2011 | ISAAC | Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. | Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer |
| 2011 | MFCS | Faster Coupon Collecting via Replication with Applications in Gossiping. | Petra Berenbrink, Robert Elssser, Tom Friedetzky, Lars Nagel, Thomas Sauerwald |
| 2011 | SODA | Randomized Diffusion for Indivisible Loads. | Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald |
| 2011 | SODA | Distributed Selfish Load Balancing on Networks. | Petra Berenbrink, Martin Hoefer, Thomas Sauerwald |
| 2011 | SODA | Rumor Spreading and Vertex Expansion on Regular Graphs. | Thomas Sauerwald, Alexandre Stauffer |
| 2011 | SPAA | Stabilizing consensus with the power of two choices. | Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler |
| 2010 | COCOON | The Cover Time of Deterministic Random Walks. | Tobias Friedrich, Thomas Sauerwald |
| 2010 | ESA | Communication Complexity of Quasirandom Rumor Spreading. | Petra Berenbrink, Robert Elssser, Thomas Sauerwald |
| 2010 | LATIN | Randomised Broadcasting: Memory vs. Randomness. | Petra Berenbrink, Robert Elssser, Thomas Sauerwald |
| 2010 | PODC | Discrete load balancing is (almost) as easy as continuous load balancing. | Robert Elssser, Thomas Sauerwald |
| 2010 | PODC | Expansion and the cover time of parallel random walks. | Thomas Sauerwald |
| 2010 | SODA | Speeding Up Random Walks with Neighborhood Exploration. | Petra Berenbrink, Colin Cooper, Robert Elssser, Tomasz Radzik, Thomas Sauerwald |
| 2010 | SODA | Efficient Broadcast on Random Geometric Graphs. | Milan Bradonjic, Robert Elssser, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer |
| 2010 | SODA | Quasirandom Load Balancing. | Tobias Friedrich, Martin Gairing, Thomas Sauerwald |
| 2009 | ALENEX | Quasirandom Rumor Spreading: An Experimental Analysis. | Benjamin Doerr, Tobias Friedrich, Marvin Knnemann, Thomas Sauerwald |
| 2009 | COCOON | The Weighted Coupon Collector's Problem and Applications. | Petra Berenbrink, Thomas Sauerwald |
| 2009 | ICALP | Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
| 2009 | ICALP | Tight Bounds for the Cover Time of Multiple Random Walks. | Robert Elssser, Thomas Sauerwald |
| 2009 | ICALP | Smoothed Analysis of Balancing Networks. | Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik |
| 2009 | STOC | Near-perfect load balancing by randomized rounding. | Tobias Friedrich, Thomas Sauerwald |
| 2009 | STACS | Cover Time and Broadcast Time. | Robert Elssser, Thomas Sauerwald |
| 2009 | SPAA | A randomized, o(log w)-depth 2 smoothing network. | Marios Mavronicolas, Thomas Sauerwald |
| 2008 | PODC | The impact of randomization in smoothing networks. | Marios Mavronicolas, Thomas Sauerwald |
| 2008 | SODA | Quasirandom rumor spreading. | Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald |
| 2008 | SODA | The power of memory in randomized broadcasting. | Robert Elssser, Thomas Sauerwald |
| 2008 | SIROCCO | Self-stabilizing Cuts in Synchronous Networks. | Thomas Sauerwald, Dirk Sudholt |
| 2007 | ISAAC | On Mixing and Edge Expansion Properties in Randomized Broadcasting. | Thomas Sauerwald |
| 2007 | STACS | Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. | Robert Elssser, Thomas Sauerwald |
| 2006 | ISAAC | On the Runtime and Robustness of Randomized Broadcasting. | Robert Elssser, Thomas Sauerwald |
| 2006 | ISAAC | Analyzing Disturbed Diffusion on Networks. | Henning Meyerhenke, Thomas Sauerwald |
| 2005 | WG | On Randomized Broadcasting in Star Graphs. | Robert Elssser, Thomas Sauerwald |
| 2004 | MFCS | Agent-Based Information Handling in Large Networks. | Robert Elssser, Ulf Lorenz, Thomas Sauerwald |