Thomas Sauerwald

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 50

Top Venues

CoRR

SPAA

ICALP

ACM Trans. Algorithms

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester
Rumors with Changing Credibility. ITCS (2024)
Dimitrios Los, Thomas Sauerwald, John Sylvester
The Power of Filling in Balanced Allocations. SIAM J. Discret. Math. 38 (1) (2024)
Dimitrios Los, Thomas Sauerwald
Tight Bounds for Repeated Balls-Into-Bins. STACS (2023)
Dimitrios Los, Thomas Sauerwald
Balanced Allocations with the Choice of Noise. J. ACM 70 (6) (2023)
Nicolás Rivera, Thomas Sauerwald, John Sylvester
Multiple random walks on graphs: mixing few to cover many. Comb. Probab. Comput. 32 (4) (2023)
Thomas Sauerwald, He Sun, Danny Vagnozzi
The Support of Open Versus Closed Random Walks. ICALP (2023)
Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester
Rumors with Changing Credibility. CoRR (2023)
Dimitrios Los, Thomas Sauerwald, John Sylvester
Balanced Allocations with Heterogeneous Bins: The Power of Memory. SODA (2023)
Dimitrios Los, Thomas Sauerwald
Balanced Allocations in Batches: The Tower of Two Choices. SPAA (2023)
Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ACM Trans. Algorithms 19 (2) (2023)
Dimitrios Los, Thomas Sauerwald
An Improved Drift Theorem for Balanced Allocations. CoRR (2023)
Dimitrios Los, Thomas Sauerwald, John Sylvester
Mean-Biased Processes for Balanced Allocations. CoRR (2023)
Dimitrios Los, Thomas Sauerwald, John Sylvester
Balanced Allocations with Heterogeneous Bins: The Power of Memory. CoRR (2023)
Dimitrios Los, Thomas Sauerwald
Balanced Allocation in Batches: The Tower of Two Choices. CoRR (2023)
Dimitrios Los, Thomas Sauerwald
Balanced Allocations with Incomplete Information: The Power of Two Queries. ITCS (2022)
Dimitrios Los, Thomas Sauerwald
Balanced Allocations with the Choice of Noise. CoRR (2022)
John Haslegrave, Thomas Sauerwald, John Sylvester
Time Dependent Biased Random Walks. ACM Trans. Algorithms 18 (2) (2022)
Dimitrios Los, Thomas Sauerwald
Balanced Allocations with the Choice of Noise. PODC (2022)
Dimitrios Los, Thomas Sauerwald, John Sylvester
Balanced Allocations: Caching and Packing, Twinning and Thinning. SODA (2022)
Dimitrios Los, Thomas Sauerwald
Balanced Allocations in Batches: Simplified and Generalized. CoRR (2022)
Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
The power of two choices for random walks. Comb. Probab. Comput. 31 (1) (2022)
Dimitrios Los, Thomas Sauerwald, John Sylvester
The Power of Filling in Balanced Allocations. CoRR (2022)
Dimitrios Los, Thomas Sauerwald
Brief Announcement: Tight Bounds for Repeated Balls-into-Bins. SPAA (2022)
Dimitrios Los, Thomas Sauerwald
Balanced Allocations in Batches: Simplified and Generalized. SPAA (2022)
Dimitrios Los, Thomas Sauerwald
Tight Bounds for Repeated Balls-into-Bins. CoRR (2022)
Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca, Thomas Sauerwald
Accelerated Information Dissemination on Networks with Local and Global Edges. SIROCCO (2022)
Dimitrios Los, Thomas Sauerwald, John Sylvester
Balanced Allocations: Caching and Packing, Twinning and Thinning. CoRR (2021)
Nicolás Rivera, Thomas Sauerwald, John Sylvester
Multiple Random Walks on Graphs: Mixing Few to Cover Many. ICALP (2021)
Dimitrios Los, Thomas Sauerwald
Balanced Allocations with Incomplete Information: The Power of Two Queries. CoRR (2021)
George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald
Spread of Information and Diseases via Random Walks in Sparse Graphs. DISC (2020)
John Haslegrave, Thomas Sauerwald, John Sylvester
Time Dependent Biased Random Walks. CoRR (2020)
Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
Choice and Bias in Random Walks. ITCS (2020)
Leran Cai, Thomas Sauerwald, Luca Zanetti
Random walks on randomly evolving graphs. CoRR (2020)
Nicolás Rivera, Thomas Sauerwald, John Sylvester
Multiple Random Walks on Graphs: Mixing Few to Cover Many. CoRR (2020)
Leran Cai, Thomas Sauerwald, Luca Zanetti
Random Walks on Randomly Evolving Graphs. SIROCCO (2020)
Nicolás Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester
The Dispersion Time of Random Walks on Finite Graphs. SPAA (2019)
Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald
On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract. SODA (2019)
Thomas Sauerwald, Luca Zanetti
Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities. CoRR (2019)
Thomas Sauerwald, Luca Zanetti
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. ICALP (2019)
Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester
The Power of Two Choices for Random Walks. CoRR (2019)
Nicolas Rivera, Alexandre Stauffer, Thomas Sauerwald, John Sylvester
The dispersion time of random walks on finite graphs. CoRR (2018)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR (2017)
Leran Cai, Thomas Sauerwald
Randomized Load Balancing on Networks with Stochastic Inputs. ICALP (2017)
Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. Distributed Comput. 30 (2) (2017)
Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA (2017)
Leran Cai, Thomas Sauerwald
Randomized Load Balancing on Networks with Stochastic Inputs. CoRR (2017)
Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
Multiple Random Walks on Paths and Grids. STACS (2017)
Hoda Akbari, Petra Berenbrink, Thomas Sauerwald
A simple approach for adapting continuous load balancing processes to discrete settings. Distributed Comput. 29 (2) (2016)
Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald
On coalescence time in graphs-When is coalescing as fast as meeting? CoRR (2016)
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into bins via local search: Cover time and maximum load. Random Struct. Algorithms 48 (4) (2016)
Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald
Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) (2015)
Dan Alistarh, Thomas Sauerwald, Milan Vojnovic
Lock-Free Algorithms under Stochastic Schedulers. PODC (2015)
Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald
Faster Rumor Spreading With Multiple Calls. Electron. J. Comb. 22 (1) (2015)
Lorenz Minder, Thomas Sauerwald, Sven-Ake Wegner
Asymptotic Bounds on the Equilateral Dimension of Hypercubes. Graphs Comb. 31 (5) (2015)
Konstantinos Panagiotou, Xavier Pérez-Giménez, Thomas Sauerwald, He Sun
Randomized Rumour Spreading: The Effect of the Network Topology. Comb. Probab. Comput. 24 (2) (2015)
Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Communication Complexity of Quasirandom Rumor Spreading. Algorithmica 72 (2) (2015)
Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
Randomized diffusion for indivisible loads. J. Comput. Syst. Sci. 81 (1) (2015)
Ali Pourmiri, Thomas Sauerwald
Cutoff Phenomenon for Random Walks on Kneser Graphs. CoRR (2014)
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into bins via local search: cover time and maximum load. STACS (2014)
Lorenz Minder, Thomas Sauerwald, Sven-Ake Wegner
Asymptotic bounds on the equilateral dimension of hypercubes. CoRR (2014)
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
HIT'nDRIVE: Multi-driver Gene Prioritization Based on Hitting Time. RECOMB (2014)
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald
Quasirandom Rumor Spreading. ACM Trans. Algorithms 11 (2) (2014)
Petra Berenbrink, Martin Hoefer, Thomas Sauerwald
Distributed Selfish Load Balancing on Networks. ACM Trans. Algorithms 11 (1) (2014)
Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Randomised broadcasting: Memory vs. randomness. Theor. Comput. Sci. 520 (2014)
George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer
Randomized Rumor Spreading in Dynamic Graphs. ICALP (2) (2014)
Ali Pourmiri, Thomas Sauerwald
Cutoff phenomenon for random walks on Kneser graphs. Discret. Appl. Math. 176 (2014)
Martin Hoefer, Thomas Sauerwald
Brief announcement: threshold load balancing in networks. PODC (2013)
Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into Bins via Local Search. SODA (2013)
Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into bins via local search: cover time and maximum load. CoRR (2013)
Martin Hoefer, Thomas Sauerwald
Threshold Load Balancing in Networks. CoRR (2013)
Artur Czumaj, Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald, Xin Wang
Fast message dissemination in random geometric networks. Distributed Comput. 26 (1) (2013)
Petra Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre Stauffer
Balls-into-bins with nearly optimal load distribution. SPAA (2013)
Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald
Faster Rumor Spreading with Multiple Calls. ISAAC (2013)
Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. Algorithmica 67 (1) (2013)
Ralf Klasing, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald
The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. PODC (2013)
Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald
Ultra-fast rumor spreading in social networks. SODA (2012)
Henning Meyerhenke, Thomas Sauerwald
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning. Algorithmica 64 (3) (2012)
Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun
Counting Arbitrary Subgraphs in Data Streams. ICALP (2) (2012)
Thomas Sauerwald, He Sun
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies CoRR (2012)
Hoda Akbari, Petra Berenbrink, Thomas Sauerwald
A simple approach for adapting continuous load balancing processes to discrete settings. PODC (2012)
George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel
Low Randomness Rumor Spreading via Hashing. STACS (2012)
Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun
Balls into Bins via Local Search CoRR (2012)
George Giakkoupis, Thomas Sauerwald
Rumor spreading and vertex expansion. SODA (2012)
Thomas Sauerwald, He Sun
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. FOCS (2012)
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
Quasirandom Load Balancing. SIAM J. Comput. 41 (4) (2012)
Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald
Randomized Diffusion for Indivisible Loads. SODA (2011)
Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. ISAAC (2011)
Robert Elsässer, Thomas Sauerwald
Tight bounds for the cover time of multiple random walks. Theor. Comput. Sci. 412 (24) (2011)
Petra Berenbrink, Martin Hoefer, Thomas Sauerwald
Distributed Selfish Load Balancing on Networks. SODA (2011)
Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik
Smoothed analysis of balancing networks. Random Struct. Algorithms 39 (1) (2011)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald
Faster Coupon Collecting via Replication with Applications in Gossiping. MFCS (2011)
Thomas Sauerwald, Alexandre Stauffer
Rumor Spreading and Vertex Expansion on Regular Graphs. SODA (2011)
Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
Quasirandom rumor spreading: An experimental analysis. ACM J. Exp. Algorithmics 16 (2011)
Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
Stabilizing consensus with the power of two choices. SPAA (2011)
Tobias Friedrich, Thomas Sauerwald
The Cover Time of Deterministic Random Walks. COCOON (2010)
Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald
Quasirandom Rumor Spreading: An Experimental Analysis CoRR (2010)
Tobias Friedrich, Thomas Sauerwald
The Cover Time of Deterministic Random Walks CoRR (2010)
Marios Mavronicolas, Thomas Sauerwald
The impact of randomization in smoothing networks. Distributed Comput. 22 (5-6) (2010)
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
Quasirandom Load Balancing. SODA (2010)
Thomas Sauerwald, Dirk Sudholt
A self-stabilizing algorithm for cut problems in synchronous networks. Theor. Comput. Sci. 411 (14-15) (2010)

Thomas Sauerwald.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Thomas Sauerwald