Остановите войну!
for scientists:
default search action
Thomas Sauerwald
- > Home > Persons > Thomas Sauerwald
Publications
- 2015
- [j25]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Communication Complexity of Quasirandom Rumor Spreading. Algorithmica 72(2): 467-492 (2015) - 2014
- [j17]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Randomised broadcasting: Memory vs. randomness. Theor. Comput. Sci. 520: 27-42 (2014) - 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) - 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) - [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 - 2010
- [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 - [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 - 2009
- [j5]Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
On randomized broadcasting in Star graphs. Discret. Appl. Math. 157(1): 126-139 (2009) - [j2]Robert Elsässer, Thomas Sauerwald:
On the runtime and robustness of randomized broadcasting. Theor. Comput. Sci. 410(36): 3414-3427 (2009) - [c17]Robert Elsässer, Thomas Sauerwald:
Tight Bounds for the Cover Time of Multiple Random Walks. ICALP (1) 2009: 415-426 - [c14]Robert Elsässer, Thomas Sauerwald:
Cover Time and Broadcast Time. STACS 2009: 373-384 - [i1]Robert Elsässer, Thomas Sauerwald:
Cover Time and Broadcast Time. CoRR abs/0902.1735 (2009) - 2008
- [c9]Robert Elsässer, Thomas Sauerwald:
The power of memory in randomized broadcasting. SODA 2008: 218-227 - [c7]Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald:
On Radio Broadcasting in Random Geometric Graphs. DISC 2008: 212-226 - 2007
- [j1]Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
Agent-based randomized broadcasting in large networks. Discret. Appl. Math. 155(2): 150-160 (2007) - [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 - 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
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-02-23 16:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint