default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Sauerwald
Person information
- affiliation: University of Cambridge, Cambridge, UK
- affiliation (former): Max Planck Institute for Informatics, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j35]Dimitrios Los, Thomas Sauerwald, John Sylvester:
The Power of Filling in Balanced Allocations. SIAM J. Discret. Math. 38(1): 529-565 (2024)- [j34]Dimitrios Los
, Thomas Sauerwald:
An Improved Drift Theorem for Balanced Allocations. ACM Trans. Algorithms 20(4): 35:1-35:39 (2024) - [c72]Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Rumors with Changing Credibility. ITCS 2024: 86:1-86:23 - 2023
- [j33]Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Multiple random walks on graphs: mixing few to cover many. Comb. Probab. Comput. 32(4): 594-637 (2023) - [j32]Dimitrios Los, Thomas Sauerwald:
Balanced Allocations with the Choice of Noise. J. ACM 70(6): 37:1-37:84 (2023) - [j31]Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald:
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ACM Trans. Algorithms 19(2): 18:1-18:46 (2023) - [c71]Thomas Sauerwald, He Sun, Danny Vagnozzi:
The Support of Open Versus Closed Random Walks. ICALP 2023: 103:1-103:21 - [c70]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Balanced Allocations with Heterogeneous Bins: The Power of Memory. SODA 2023: 4448-4477 - [c69]Dimitrios Los, Thomas Sauerwald:
Balanced Allocations in Batches: The Tower of Two Choices. SPAA 2023: 51-61 - [c68]Dimitrios Los, Thomas Sauerwald:
Tight Bounds for Repeated Balls-Into-Bins. STACS 2023: 45:1-45:22 - [i33]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Balanced Allocations with Heterogeneous Bins: The Power of Memory. CoRR abs/2301.09810 (2023) - [i32]Dimitrios Los, Thomas Sauerwald:
Balanced Allocation in Batches: The Tower of Two Choices. CoRR abs/2302.04399 (2023) - [i31]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Mean-Biased Processes for Balanced Allocations. CoRR abs/2308.05087 (2023) - [i30]Dimitrios Los, Thomas Sauerwald:
An Improved Drift Theorem for Balanced Allocations. CoRR abs/2308.11083 (2023) - [i29]Charlotte Out, Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Rumors with Changing Credibility. CoRR abs/2311.17040 (2023) - 2022
- [j30]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The power of two choices for random walks. Comb. Probab. Comput. 31(1): 73-100 (2022) - [j29]John Haslegrave, Thomas Sauerwald, John Sylvester:
Time Dependent Biased Random Walks. ACM Trans. Algorithms 18(2): 12:1-12:30 (2022) - [c67]Dimitrios Los, Thomas Sauerwald:
Balanced Allocations with Incomplete Information: The Power of Two Queries. ITCS 2022: 103:1-103:23 - [c66]Dimitrios Los, Thomas Sauerwald:
Balanced Allocations with the Choice of Noise. PODC 2022: 164-175 - [c65]Sarel Cohen, Philipp Fischbeck, Tobias Friedrich, Martin S. Krejca, Thomas Sauerwald:
Accelerated Information Dissemination on Networks with Local and Global Edges. SIROCCO 2022: 79-97 - [c64]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Balanced Allocations: Caching and Packing, Twinning and Thinning. SODA 2022: 1847-1874 - [c63]Dimitrios Los, Thomas Sauerwald:
Balanced Allocations in Batches: Simplified and Generalized. SPAA 2022: 389-399 - [c62]Dimitrios Los, Thomas Sauerwald:
Brief Announcement: Tight Bounds for Repeated Balls-into-Bins. SPAA 2022: 419-421 - [i28]Dimitrios Los, Thomas Sauerwald:
Tight Bounds for Repeated Balls-into-Bins. CoRR abs/2203.12400 (2022) - [i27]Dimitrios Los, Thomas Sauerwald:
Balanced Allocations in Batches: Simplified and Generalized. CoRR abs/2203.13902 (2022) - [i26]Dimitrios Los, Thomas Sauerwald, John Sylvester:
The Power of Filling in Balanced Allocations. CoRR abs/2204.04057 (2022) - [i25]Dimitrios Los, Thomas Sauerwald:
Balanced Allocations with the Choice of Noise. CoRR abs/2206.07503 (2022) - 2021
- [c61]Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Multiple Random Walks on Graphs: Mixing Few to Cover Many. ICALP 2021: 107:1-107:16 - [i24]Dimitrios Los, Thomas Sauerwald:
Balanced Allocations with Incomplete Information: The Power of Two Queries. CoRR abs/2107.03916 (2021) - [i23]Dimitrios Los, Thomas Sauerwald, John Sylvester:
Balanced Allocations: Caching and Packing, Twinning and Thinning. CoRR abs/2110.10759 (2021) - 2020
- [c60]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
Choice and Bias in Random Walks. ITCS 2020: 76:1-76:19 - [c59]Leran Cai, Thomas Sauerwald, Luca Zanetti:
Random Walks on Randomly Evolving Graphs. SIROCCO 2020: 111-128 - [c58]George Giakkoupis, Hayk Saribekyan, Thomas Sauerwald:
Spread of Information and Diseases via Random Walks in Sparse Graphs. DISC 2020: 9:1-9:17 - [i22]John Haslegrave, Thomas Sauerwald, John Sylvester:
Time Dependent Biased Random Walks. CoRR abs/2006.02475 (2020) - [i21]Leran Cai, Thomas Sauerwald, Luca Zanetti:
Random walks on randomly evolving graphs. CoRR abs/2006.10589 (2020) - [i20]Nicolás Rivera, Thomas Sauerwald, John Sylvester:
Multiple Random Walks on Graphs: Mixing Few to Cover Many. CoRR abs/2011.07893 (2020)
2010 – 2019
- 2019
- [c57]Thomas Sauerwald, Luca Zanetti:
Random Walks on Dynamic Graphs: Mixing Times, Hitting Times, and Return Probabilities. ICALP 2019: 93:1-93:15 - [c56]Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald:
On coalescence time in graphs: When is coalescing as fast as meeting?: Extended Abstract. SODA 2019: 956-965 - [c55]Nicolás Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester:
The Dispersion Time of Random Walks on Finite Graphs. SPAA 2019: 103-113 - [i19]Thomas Sauerwald, Luca Zanetti:
Random Walks on Dynamic Graphs: Mixing Times, HittingTimes, and Return Probabilities. CoRR abs/1903.01342 (2019) - [i18]Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester:
The Power of Two Choices for Random Walks. CoRR abs/1911.05170 (2019) - 2018
- [i17]Nicolas Rivera, Alexandre Stauffer, Thomas Sauerwald, John Sylvester:
The dispersion time of random walks on finite graphs. CoRR abs/1808.09219 (2018) - 2017
- [j28]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): 127-148 (2017) - [c54]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. ESA 2017: 37:1-37:15 - [c53]Leran Cai, Thomas Sauerwald:
Randomized Load Balancing on Networks with Stochastic Inputs. ICALP 2017: 139:1-139:14 - [c52]Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald:
Multiple Random Walks on Paths and Grids. STACS 2017: 44:1-44:14 - [i16]Leran Cai, Thomas Sauerwald:
Randomized Load Balancing on Networks with Stochastic Inputs. CoRR abs/1703.08702 (2017) - [i15]Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, Andrew M. Sutton:
Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. CoRR abs/1706.08431 (2017) - 2016
- [j27]Hoda Akbari, Petra Berenbrink, Thomas Sauerwald:
A simple approach for adapting continuous load balancing processes to discrete settings. Distributed Comput. 29(2): 143-161 (2016) - [j26]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: Cover time and maximum load. Random Struct. Algorithms 48(4): 681-702 (2016) - [i14]Varun Kanade, Frederik Mallmann-Trenn, Thomas Sauerwald:
On coalescence time in graphs-When is coalescing as fast as meeting? CoRR abs/1611.02460 (2016) - 2015
- [j25]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Communication Complexity of Quasirandom Rumor Spreading. Algorithmica 72(2): 467-492 (2015) - [j24]Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald:
Faster Rumor Spreading With Multiple Calls. Electron. J. Comb. 22(1): 1 (2015) - [j23]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): 457-479 (2015) - [j22]Lorenz Minder, Thomas Sauerwald, Sven-Ake Wegner:
Asymptotic Bounds on the Equilateral Dimension of Hypercubes. Graphs Comb. 31(5): 1629-1636 (2015) - [j21]Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald:
Randomized diffusion for indivisible loads. J. Comput. Syst. Sci. 81(1): 159-185 (2015) - [c51]Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald:
Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) 2015: 516-527 - [c50]Dan Alistarh, Thomas Sauerwald, Milan Vojnovic:
Lock-Free Algorithms under Stochastic Schedulers. PODC 2015: 251-260 - 2014
- [j20]Ali Pourmiri, Thomas Sauerwald:
Cutoff phenomenon for random walks on Kneser graphs. Discret. Appl. Math. 176: 100-106 (2014) - [j19]Petra Berenbrink, Martin Hoefer, Thomas Sauerwald:
Distributed Selfish Load Balancing on Networks. ACM Trans. Algorithms 11(1): 2:1-2:29 (2014) - [j18]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading. ACM Trans. Algorithms 11(2): 9:1-9:35 (2014) - [j17]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Randomised broadcasting: Memory vs. randomness. Theor. Comput. Sci. 520: 27-42 (2014) - [c49]George Giakkoupis, Thomas Sauerwald, Alexandre Stauffer:
Randomized Rumor Spreading in Dynamic Graphs. ICALP (2) 2014: 495-507 - [c48]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: 293-306 - [c47]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. STACS 2014: 187-198 - [i13]Ali Pourmiri, Thomas Sauerwald:
Cutoff Phenomenon for Random Walks on Kneser Graphs. CoRR abs/1404.4598 (2014) - [i12]Lorenz Minder, Thomas Sauerwald, Sven-Ake Wegner:
Asymptotic bounds on the equilateral dimension of hypercubes. CoRR abs/1408.5027 (2014) - 2013
- [j16]Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. Algorithmica 67(1): 65-88 (2013) - [j15]Artur Czumaj, Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald, Xin Wang:
Fast message dissemination in random geometric networks. Distributed Comput. 26(1): 1-24 (2013) - [c46]Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald:
Faster Rumor Spreading with Multiple Calls. ISAAC 2013: 446-456 - [c45]Martin Hoefer, Thomas Sauerwald:
Brief announcement: threshold load balancing in networks. PODC 2013: 54-56 - [c44]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: 365-374 - [c43]Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into Bins via Local Search. SODA 2013: 16-34 - [c42]Petra Berenbrink, Kamyar Khodamoradi, Thomas Sauerwald, Alexandre Stauffer:
Balls-into-bins with nearly optimal load distribution. SPAA 2013: 326-335 - [i11]Martin Hoefer, Thomas Sauerwald:
Threshold Load Balancing in Networks. CoRR abs/1306.1402 (2013) - [i10]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. CoRR abs/1310.0801 (2013) - 2012
- [j14]Henning Meyerhenke, Thomas Sauerwald:
Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning. Algorithmica 64(3): 329-361 (2012) - [j13]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. SIAM J. Comput. 41(4): 747-771 (2012) - [c41]Thomas Sauerwald, He Sun:
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. FOCS 2012: 341-350 - [c40]Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald, He Sun:
Counting Arbitrary Subgraphs in Data Streams. ICALP (2) 2012: 598-609 - [c39]Hoda Akbari, Petra Berenbrink, Thomas Sauerwald:
A simple approach for adapting continuous load balancing processes to discrete settings. PODC 2012: 271-280 - [c38]George Giakkoupis, Thomas Sauerwald:
Rumor spreading and vertex expansion. SODA 2012: 1623-1641 - [c37]Nikolaos Fountoulakis, Konstantinos Panagiotou, Thomas Sauerwald:
Ultra-fast rumor spreading in social networks. SODA 2012: 1642-1660 - [c36]George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel:
Low Randomness Rumor Spreading via Hashing. STACS 2012: 314-325 - [i9]Thomas Sauerwald, He Sun:
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies. CoRR abs/1201.2715 (2012) - [i8]Paul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into Bins via Local Search. CoRR abs/1207.2125 (2012) - 2011
- [j12]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom rumor spreading: An experimental analysis. ACM J. Exp. Algorithmics 16 (2011) - [j11]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed analysis of balancing networks. Random Struct. Algorithms 39(1): 115-138 (2011) - [j10]Robert Elsässer, Thomas Sauerwald:
Tight bounds for the cover time of multiple random walks. Theor. Comput. Sci. 412(24): 2623-2641 (2011) - [c35]Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions. ISAAC 2011: 190-199 - [c34]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald:
Faster Coupon Collecting via Replication with Applications in Gossiping. MFCS 2011: 72-83 - [c33]Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald:
Randomized Diffusion for Indivisible Loads. SODA 2011: 429-439 - [c32]Thomas Sauerwald, Alexandre Stauffer:
Rumor Spreading and Vertex Expansion on Regular Graphs. SODA 2011: 462-475 - [c31]Petra Berenbrink, Martin Hoefer, Thomas Sauerwald:
Distributed Selfish Load Balancing on Networks. SODA 2011: 1487-1497 - [c30]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing consensus with the power of two choices. SPAA 2011: 149-158 - 2010
- [j9]Thomas Sauerwald:
On Mixing and Edge Expansion Properties in Randomized Broadcasting. Algorithmica 56(1): 51-88 (2010) - [j8]Tobias Friedrich, Thomas Sauerwald:
The Cover Time of Deterministic Random Walks. Electron. J. Comb. 17(1) (2010) - [j7]Marios Mavronicolas, Thomas Sauerwald:
The impact of randomization in smoothing networks. Distributed Comput. 22(5-6): 381-411 (2010) - [j6]Thomas Sauerwald, Dirk Sudholt:
A self-stabilizing algorithm for cut problems in synchronous networks. Theor. Comput. Sci. 411(14-15): 1599-1612 (2010) - [c29]Tobias Friedrich, Thomas Sauerwald:
The Cover Time of Deterministic Random Walks. COCOON 2010: 130-139 - [c28]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Communication Complexity of Quasirandom Rumor Spreading. ESA (1) 2010: 134-145 - [c27]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Randomised Broadcasting: Memory vs. Randomness. LATIN 2010: 306-319 - [c26]Thomas Sauerwald:
Expansion and the cover time of parallel random walks. PODC 2010: 315-324 - [c25]Robert Elsässer, Thomas Sauerwald:
Discrete load balancing is (almost) as easy as continuous load balancing. PODC 2010: 346-354 - [c24]Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Efficient Broadcast on Random Geometric Graphs. SODA 2010: 1412-1421 - [c23]Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald:
Speeding Up Random Walks with Neighborhood Exploration. SODA 2010: 1422-1435 - [c22]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. SODA 2010: 1620-1629 - [c21]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Brief Announcement: Stabilizing Consensus with the Power of Two Choices. DISC 2010: 528-530 - [i7]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed Analysis of Balancing Networks. CoRR abs/1006.1443 (2010) - [i6]Tobias Friedrich, Martin Gairing, Thomas Sauerwald:
Quasirandom Load Balancing. CoRR abs/1006.3302 (2010) - [i5]Tobias Friedrich, Thomas Sauerwald:
The Cover Time of Deterministic Random Walks. CoRR abs/1006.3430 (2010) - [i4]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading. CoRR abs/1012.5351 (2010) - [i3]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom Rumor Spreading: An Experimental Analysis. CoRR abs/1012.5357 (2010)
2000 – 2009
- 2009
- [j5]Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
On randomized broadcasting in Star graphs. Discret. Appl. Math. 157(1): 126-139 (2009) - [j4]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading on Expanders. Electron. Notes Discret. Math. 34: 243-247 (2009) - [j3]Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald:
A new diffusion-based multilevel algorithm for computing graph partitions. J. Parallel Distributed Comput. 69(9): 750-761 (2009) - [j2]Robert Elsässer, Thomas Sauerwald:
On the runtime and robustness of randomized broadcasting. Theor. Comput. Sci. 410(36): 3414-3427 (2009) - [c20]Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald:
Quasirandom Rumor Spreading: An Experimental Analysis. ALENEX 2009: 145-153 - [c19]Petra Berenbrink, Thomas Sauerwald:
The Weighted Coupon Collector's Problem and Applications. COCOON 2009: 449-458 - [c18]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. ICALP (1) 2009: 366-377 - [c17]Robert Elsässer, Thomas Sauerwald:
Tight Bounds for the Cover Time of Multiple Random Walks. ICALP (1) 2009: 415-426 - [c16]Tobias Friedrich, Thomas Sauerwald, Dan Vilenchik:
Smoothed Analysis of Balancing Networks. ICALP (2) 2009: 472-483 - [c15]Marios Mavronicolas, Thomas Sauerwald:
A randomized, o(log w)-depth 2 smoothing network. SPAA 2009: 178-187 - [c14]Robert Elsässer, Thomas Sauerwald:
Cover Time and Broadcast Time. STACS 2009: 373-384 - [c13]Tobias Friedrich, Thomas Sauerwald:
Near-perfect load balancing by randomized rounding. STOC 2009: 121-130 - [i2]Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler:
Stabilizing Consensus with the Power of Two Choices. Algorithmic Methods for Distributed Cooperative Systems 2009 - [i1]Robert Elsässer, Thomas Sauerwald:
Cover Time and Broadcast Time. CoRR abs/0902.1735 (2009) - 2008
- [b1]Thomas Sauerwald:
Randomized protocols for information dissemination. University of Paderborn, Germany, 2008, pp. 1-146 - [c12]Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald:
A new diffusion-based multilevel algorithm for computing graph partitions of very high quality. IPDPS 2008: 1-13 - [c11]Marios Mavronicolas, Thomas Sauerwald:
The impact of randomization in smoothing networks. PODC 2008: 345-354 - [c10]Thomas Sauerwald, Dirk Sudholt:
Self-stabilizing Cuts in Synchronous Networks. SIROCCO 2008: 234-246 - [c9]Robert Elsässer, Thomas Sauerwald:
The power of memory in randomized broadcasting. SODA 2008: 218-227 - [c8]Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom rumor spreading. SODA 2008: 773-781 - [c7]Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald:
On Radio Broadcasting in Random Geometric Graphs. DISC 2008: 212-226 - [p1]Thomas Sauerwald:
Randomisierte Protokolle für die Verteilung von Information [Randomized Protocols for Information Dissemination]. Ausgezeichnete Informatikdissertationen 2008: 241-250 - 2007
- [j1]Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
Agent-based randomized broadcasting in large networks. Discret. Appl. Math. 155(2): 150-160 (2007) - [c6]Thomas Sauerwald:
On Mixing and Edge Expansion Properties in Randomized Broadcasting. ISAAC 2007: 196-207 - [c5]Robert Elsässer, Thomas Sauerwald:
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. STACS 2007: 163-174 - 2006
- [c4]Robert Elsässer, Thomas Sauerwald:
On the Runtime and Robustness of Randomized Broadcasting. ISAAC 2006: 349-358 - [c3]Henning Meyerhenke, Thomas Sauerwald:
Analyzing Disturbed Diffusion on Networks. ISAAC 2006: 429-438 - 2005
- [c2]Robert Elsässer, Thomas Sauerwald:
On Randomized Broadcasting in Star Graphs. WG 2005: 307-318 - 2004
- [c1]Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
Agent-Based Information Handling in Large Networks. MFCS 2004: 586-598
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
