Thomas Sauerwald
Impact in
-
- Opportunistic and Delay-Tolerant Networks
- Distributed systems and fault tolerance
- Caching and Content Delivery
- Mobile Ad Hoc Networks
- Peer-to-Peer Network Technologies
- Optimization and Search Problems
-
- Complex Network Analysis Techniques
Papers in
-
- Opportunistic and Delay-Tolerant Networks 26
- Optimization and Search Problems 24
- Distributed systems and fault tolerance 23
-
- Complexity and Algorithms in Graphs 22
- Advanced Graph Theory Research 12
- Co-authors
- Robert Elsässer⋆ (23 shared papers)Tobias Friedrich (19 shared papers)Alexandre Stauffer (13 shared papers)Benjamin Doerr (5 shared papers)George Giakkoupis (3 shared papers)Petra Berenbrink (15 shared papers)Henning Meyerhenke (4 shared papers)He Sun (6 shared papers)
- Journals
- Algorithmica (4 papers)ACM Transactions on Algorithms (4 papers)Distributed Computing (4 papers)Theoretical Computer Science (4 papers)Discrete Applied Mathematics (3 papers)
- Partner nations
- GermanyUnited KingdomUnited States
In The Last Decade
Thomas Sauerwald
91 papers receiving 1.0k citations
Peers
Comparison fields: 5 of 70
- Computer Networks and Communications 671
- Statistical and Nonlinear Physics 325
- Mathematical Physics 138
- Statistics and Probability 102
- Computational Theory and Mathematics 166
Countries citing papers authored by Thomas Sauerwald
This map shows the geographic impact of Thomas Sauerwald's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Thomas Sauerwald with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Sauerwald more than expected).
Fields of papers citing papers by Thomas Sauerwald
This network shows the impact of papers produced by Thomas Sauerwald. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Thomas Sauerwald. The network helps show where Thomas Sauerwald may publish in the future.
Co-authors
The 25 scholars most cited alongside Thomas Sauerwald, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 94 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 49 | |
| 2 | 2009 | 42 | |
| 3 | 2017 | 39 | |
| 4 | 2008 | 37 | |
| 5 | 2008 | 35 | |
| 6 | 2012 | 33 | |
| 7 | 2008 | 33 | |
| 8 | 2012 | 32 | |
| 9 | 2010 | 32 | |
| 10 | 2008 | 29 | |
| 11 | 2012 | 28 | |
| 12 | The power of memory in randomized broadcasting | 2008 | 27 |
| 13 | 2009 | 27 | |
| 14 | 2007 | 26 | |
| 15 | 2009 | 24 | |
| 16 | 2011 | 23 | |
| 17 | 2012 | 23 | |
| 18 | 2012 | 19 | |
| 19 | Efficient Broadcast on Random Geometric Graphs | 2010 | 18 |
| 20 | 2013 | 18 |
About Thomas Sauerwald
Thomas Sauerwald is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics, Statistical and Nonlinear Physics, Artificial Intelligence and Mathematical Physics, having authored 94 papers that have together received 1.0k indexed citations. Recurring topics across this work include Opportunistic and Delay-Tolerant Networks (26 papers), Optimization and Search Problems (24 papers), Distributed systems and fault tolerance (23 papers), Complexity and Algorithms in Graphs (22 papers), Complex Network Analysis Techniques (20 papers), Stochastic processes and statistical mechanics (18 papers), Markov Chains and Monte Carlo Methods (13 papers) and Advanced Graph Theory Research (12 papers). The work is most often cited by research in Computer Networks and Communications (671 citations), Statistical and Nonlinear Physics (325 citations), Mathematical Physics (138 citations), Statistics and Probability (102 citations) and Computational Theory and Mathematics (166 citations). Thomas Sauerwald has collaborated with scholars based in Germany, United Kingdom and United States. Frequent co-authors include Robert Elsässer⋆, Tobias Friedrich, Alexandre Stauffer, Benjamin Doerr, George Giakkoupis, Petra Berenbrink, Henning Meyerhenke, He Sun, Burkhard Monien and Κωνσταντίνος Παναγιώτου. Their work appears in journals such as Algorithmica, ACM Transactions on Algorithms, Distributed Computing, Theoretical Computer Science and Discrete Applied Mathematics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.