Robert Elsässer⋆

1.2k total citations
44 papers, 348 citations indexed

About

Robert Elsässer⋆ is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Robert Elsässer⋆ has authored 44 papers receiving a total of 348 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Computer Networks and Communications, 13 papers in Computational Theory and Mathematics and 7 papers in Geometry and Topology. Recurrent topics in Robert Elsässer⋆'s work include Distributed systems and fault tolerance (10 papers), Interconnection Networks and Systems (10 papers) and Advanced Graph Theory Research (9 papers). Robert Elsässer⋆ is often cited by papers focused on Distributed systems and fault tolerance (10 papers), Interconnection Networks and Systems (10 papers) and Advanced Graph Theory Research (9 papers). Robert Elsässer⋆ collaborates with scholars based in Germany, Austria and United Kingdom. Robert Elsässer⋆'s co-authors include Burkhard Monien, Thomas Sauerwald, Robert Preis, Stefan Schamberger, Tomasz Radzik, Colin Cooper, Petra Berenbrink, Leszek Gąsieniec, Rastislav Kráľovič and Hirotaka Ono and has published in prestigious journals such as IEEE/ACM Transactions on Networking, Future Generation Computer Systems and Theoretical Computer Science.

In The Last Decade

Robert Elsässer⋆

42 papers receiving 328 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Robert Elsässer⋆ Germany 11 252 77 66 46 40 44 348
Joseph G. Peters Canada 13 372 1.5× 100 1.3× 186 2.8× 34 0.7× 40 1.0× 48 559
Elena Lodi Italy 10 69 0.3× 51 0.7× 67 1.0× 50 1.1× 33 0.8× 27 250
Kenneth A. Berman United States 11 127 0.5× 29 0.4× 103 1.6× 9 0.2× 21 0.5× 43 291
Russell Bradford United Kingdom 11 117 0.5× 16 0.2× 88 1.3× 38 0.8× 40 1.0× 37 287
Jean‐Jacques Pansiot France 14 367 1.5× 70 0.9× 216 3.3× 89 1.9× 251 6.3× 35 669
Aimin Pan China 9 165 0.7× 48 0.6× 51 0.8× 27 0.6× 45 1.1× 21 325
Christine Rüb Germany 6 158 0.6× 24 0.3× 124 1.9× 41 0.9× 158 4.0× 12 384
Romas Aleliunas Canada 3 218 0.9× 54 0.7× 226 3.4× 18 0.4× 144 3.6× 3 466
Luděk Kučera Czechia 8 75 0.3× 20 0.3× 177 2.7× 25 0.5× 102 2.5× 35 303
Pierre Fraigniaud France 17 727 2.9× 34 0.4× 337 5.1× 88 1.9× 98 2.5× 74 895

Countries citing papers authored by Robert Elsässer⋆

Since Specialization
Citations

This map shows the geographic impact of Robert Elsässer⋆'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 Robert Elsässer⋆ with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert Elsässer⋆ more than expected).

Fields of papers citing papers by Robert Elsässer⋆

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Robert Elsässer⋆. 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 Robert Elsässer⋆. The network helps show where Robert Elsässer⋆ may publish in the future.

Co-authorship network of co-authors of Robert Elsässer⋆

This figure shows the co-authorship network connecting the top 25 collaborators of Robert Elsässer⋆. A scholar is included among the top collaborators of Robert Elsässer⋆ based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Robert Elsässer⋆. Robert Elsässer⋆ is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Berenbrink, Petra, et al.. (2022). Population Protocols for Exact Plurality Consensus. 224–234. 3 indexed citations
2.
Berenbrink, Petra, André Brinkmann, Robert Elsässer⋆, Tom Friedetzky, & Lars Nagel. (2021). Randomized renaming in shared memory systems. Journal of Parallel and Distributed Computing. 150. 112–120. 1 indexed citations
3.
Berenbrink, Petra, et al.. (2018). A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations
4.
Elsässer⋆, Robert & Tomasz Radzik. (2018). Recent Results in Population Protocols for Exact Majority and Leader Election. 3(126). 6 indexed citations
5.
Berenbrink, Petra, Robert Elsässer⋆, & Tom Friedetzky. (2016). Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. Distributed Computing. 29(5). 317–339. 2 indexed citations
6.
Elsässer⋆, Robert, et al.. (2015). On the isomorphism of graphs having some eigenvalues of moderate multiplicity. Linear Algebra and its Applications. 488. 377–395.
7.
Elsässer⋆, Robert, et al.. (2015). On the Influence of Graph Density on Randomized Gossiping. 6. 521–531. 2 indexed citations
8.
Berenbrink, Petra, Robert Elsässer⋆, & Thomas Sauerwald. (2013). Randomised broadcasting: Memory vs. randomness. Theoretical Computer Science. 520. 27–42.
9.
Czumaj, Artur, Robert Elsässer⋆, Leszek Gąsieniec, Thomas Sauerwald, & Xin Wang. (2011). Fast message dissemination in random geometric networks. Distributed Computing. 26(1). 1–24. 1 indexed citations
10.
Elsässer⋆, Robert & Thomas Sauerwald. (2010). Tight bounds for the cover time of multiple random walks. Theoretical Computer Science. 412(24). 2623–2641. 25 indexed citations
11.
Elsässer⋆, Robert & Thomas Sauerwald. (2008). The power of memory in randomized broadcasting. Symposium on Discrete Algorithms. 218–227. 15 indexed citations
12.
Elsässer⋆, Robert, Ulf Lorenz, & Thomas Sauerwald. (2008). On randomized broadcasting in Star graphs. Discrete Applied Mathematics. 157(1). 126–139. 3 indexed citations
13.
Elsässer⋆, Robert & Thomas Sauerwald. (2008). On the runtime and robustness of randomized broadcasting. Theoretical Computer Science. 410(36). 3414–3427. 20 indexed citations
14.
Elsässer⋆, Robert, Ulf Lorenz, & Thomas Sauerwald. (2006). Agent-based randomized broadcasting in large networks. Discrete Applied Mathematics. 155(2). 150–160. 1 indexed citations
15.
Elsässer⋆, Robert & Leszek Gąsieniec. (2005). Radio communication in random graphs. Journal of Computer and System Sciences. 72(3). 490–506. 6 indexed citations
16.
Elsässer⋆, Robert, et al.. (2004). New spectral lower bounds on the bisection width of graphs. Theoretical Computer Science. 320(2-3). 155–174. 10 indexed citations
17.
Elsässer⋆, Robert, et al.. (2003). Edge-isoperimetric problems for cartesian powers of regular graphs. Theoretical Computer Science. 307(3). 473–492. 16 indexed citations
18.
Elsässer⋆, Robert, Thomas Lücking, & Burkhard Monien. (2003). On Spectral Bounds for the k-Partitioning of Graphs. Theory of Computing Systems. 36(5). 461–478. 1 indexed citations
19.
Elsässer⋆, Robert. (2002). Spectral methods for efficient load balancing strategies.. 29–38. 1 indexed citations
20.
Elsässer⋆, Robert, et al.. (2000). The Spider Poset Is Macaulay. Journal of Combinatorial Theory Series A. 90(1). 1–26. 4 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026