On Bounds for the k-Partitioning of Graphs. - Sergei L. Bezrukov; Robert Elsässer; Ulf-Peter Schroeder (COCOON, 1999)

Optimal and Alternating-Direction Load Balancing Schemes. - Robert Elsässer; Andreas Frommer; Burkhard Monien; Robert Preis (Euro-Par, 1999)

Optimal Cuts for Powers of the Petersen Graph. - Sergei L. Bezrukov; Sajal K. Das 001; Robert Elsässer (WG, 1999)

On k-partitioning of Hamming Graphs. - Sergei L. Bezrukov; Robert Elsässer; Ulf-Peter Schroeder (Discret. Appl. Math., 1999)

Diffusive load balancing schemes on heterogeneous networks. - Robert Elsässer; Burkhard Monien; Robert Preis (SPAA, 2000)

The Spider Poset Is Macaulay. - Sergei L. Bezrukov; Robert Elsässer (J. Comb. Theory A, 2000)

New spectral bounds on k-partitioning of graphs. - Robert Elsässer; Thomas Lücking 001; Burkhard Monien (SPAA, 2001)

Scalable Sparse Topologies with Small Spectrum. - Robert Elsässer; Rastislav Kralovic; Burkhard Monien (STACS, 2001)

Spectral methods for efficient load balancing strategies. - Robert Elsässer (2002)

Spectral methods for efficient load balancing strategies. - Robert Elsässer (Ausgezeichnete Informatikdissertationen, 2002)

Toward Optimal Diffusion Matrices. - Robert Elsässer; Burkhard Monien; Günter Rote; Stefan Schamberger (IPDPS, 2002)

Diffusion Schemes for Load Balancing on Heterogeneous Networks. - Robert Elsässer; Burkhard Monien; Robert Preis (Theory Comput. Syst., 2002)

Load balancing of unit size tokens and expansion properties of graphs. - Robert Elsässer; Burkhard Monien (SPAA, 2003)

On Spectral Bounds for the k-Partitioning of Graphs. - Robert Elsässer; Thomas Lücking 001; Burkhard Monien (Theory Comput. Syst., 2003)

Edge-isoperimetric problems for cartesian powers of regular graphs. - Sergei L. Bezrukov; Robert Elsässer (Theor. Comput. Sci., 2003)

Sparse topologies with small spectrum size. - Robert Elsässer; Rastislav Kralovic; Burkhard Monien (Theor. Comput. Sci., 2003)

Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. - Robert Elsässer; Burkhard Monien; Stefan Schamberger (ESA, 2004)

Load Balancing in Dynamic Networks. - Robert Elsässer; Burkhard Monien; Stefan Schamberger (ISPAN, 2004)

Agent-Based Information Handling in Large Networks. - Robert Elsässer; Ulf Lorenz; Thomas Sauerwald (MFCS, 2004)

Optimal Diffusion Schemes And Load Balancing On Product Graphs. - Robert Elsässer; Burkhard Monien; Robert Preis; Andreas Frommer (Parallel Process. Lett., 2004)

New spectral lower bounds on the bisection width of graphs. - Sergei L. Bezrukov; Robert Elsässer; Burkhard Monien; Robert Preis; Jean-Pierre Tillich (Theor. Comput. Sci., 2004)

Radio communication in random graphs: extended abstract. - Robert Elsässer; Leszek Gasieniec (SPAA, 2005)

On Randomized Broadcasting in Star Graphs. - Robert Elsässer; Thomas Sauerwald (WG, 2005)

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. - Robert Elsässer; Martin Gairing; Thomas Lücking 001; Marios Mavronicolas; Burkhard Monien (WINE, 2005)

Toward the Eigenvalue Power Law. - Robert Elsässer (MFCS, 2006)

On the communication complexity of randomized broadcasting in random-like graphs. - Robert Elsässer (SPAA, 2006)

On Randomized Broadcasting in Power Law Networks. - Robert Elsässer (DISC, 2006)

Radio communication in random graphs. - Robert Elsässer; Leszek Gasieniec (J. Comput. Syst. Sci., 2006)

Distributing Unit Size Workload Packages in Heterogeneous Networks. - Robert Elsässer; Burkhard Monien; Stefan Schamberger (J. Graph Algorithms Appl., 2006)

Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. - Robert Elsässer; Thomas Sauerwald (STACS, 2007)

Agent-based randomized broadcasting in large networks. - Robert Elsässer; Ulf Lorenz; Thomas Sauerwald (Discret. Appl. Math., 2007)

The power of memory in randomized broadcasting. - Robert Elsässer; Thomas Sauerwald (SODA, 2008)

On Radio Broadcasting in Random Geometric Graphs. - Robert Elsässer; Leszek Gasieniec; Thomas Sauerwald (DISC, 2008)

Cover Time and Broadcast Time. - Robert Elsässer; Thomas Sauerwald (STACS, 2009)

On randomized broadcasting in Star graphs. - Robert Elsässer; Ulf Lorenz; Thomas Sauerwald (Discret. Appl. Math., 2009)

On the runtime and robustness of randomized broadcasting. - Robert Elsässer; Thomas Sauerwald (Theor. Comput. Sci., 2009)

Efficient Information Exchange in the Random Phone-Call Model. - Petra Berenbrink; Jurek Czyzowicz; Robert Elsässer; Leszek Gasieniec (ICALP (2), 2010)

Discrete load balancing is (almost) as easy as continuous load balancing. - Robert Elsässer; Thomas Sauerwald (PODC, 2010)

Speeding Up Random Walks with Neighborhood Exploration. - Petra Berenbrink; Colin Cooper; Robert Elsässer; Tomasz Radzik; Thomas Sauerwald (SODA, 2010)

Efficient Broadcast on Random Geometric Graphs. - Milan Bradonjic; Robert Elsässer; Tobias Friedrich 001; Thomas Sauerwald; Alexandre Stauffer (SODA, 2010)

Efficient Broadcasting in Random Power Law Networks. - Robert Elsässer; Adrian Ogierman (WG, 2010)

Settling the Complexity of Local Max-Cut (Almost) Completely. - Robert Elsässer; Tobias Tscheuschner (ICALP (1), 2011)

Faster Coupon Collecting via Replication with Applications in Gossiping. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Lars Nagel 001; Thomas Sauerwald (MFCS, 2011)

Awareness and Movement vs. the Spread of Epidemics - Analyzing a Dynamic Model for Urban Social/Technological Networks - Robert Elsässer; Adrian Ogierman (CoRR, 2011)

Tight bounds for the cover time of multiple random walks. - Robert Elsässer; Thomas Sauerwald (Theor. Comput. Sci., 2011)

Coalescing random walks and voting on graphs. - Colin Cooper; Robert Elsässer; Hirotaka Ono 001; Tomasz Radzik (PODC, 2012)

The impact of the power law exponent on the behavior of a dynamic epidemic type process. - Adrian Ogierman; Robert Elsässer (SPAA, 2012)

Epidemics and Their Implications in Urban Environments: A Case Study on a National Scope. - Robert Elsässer; Adrian Ogierman; Michael Meier 005 (SIMULTECH (Selected Papers), 2013)

Agent based Simulations of Epidemics on a Large Scale - Toward the Right Choice of Parameters. - Robert Elsässer; Adrian Ogierman; Michael Meier 005 (SIMULTECH, 2013)

Faster Rumor Spreading: Breaking the logn Barrier. - Chen Avin; Robert Elsässer (DISC, 2013)

Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). - Benjamin Doerr; Robert Elsässer; Pierre Fraigniaud (Dagstuhl Reports, 2013)

Fast message dissemination in random geometric networks. - Artur Czumaj; Robert Elsässer; Leszek Gasieniec; Thomas Sauerwald; Xin Wang (Distributed Comput., 2013)

Coalescing Random Walks and Voting on Connected Graphs. - Colin Cooper; Robert Elsässer; Hirotaka Ono 001; Tomasz Radzik (SIAM J. Discret. Math., 2013)

The Power of Two Choices in Distributed Voting. - Colin Cooper; Robert Elsässer; Tomasz Radzik (ICALP (2), 2014)

Preface. - Francesc Comellas; Robert Elsässer; Dragan Stevanovic (Discret. Appl. Math., 2014)

Randomised broadcasting: Memory vs. randomness. - Petra Berenbrink; Robert Elsässer; Thomas Sauerwald (Theor. Comput. Sci., 2014)

Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion. - Hoda Akbari; Petra Berenbrink; Robert Elsässer; Dominik Kaaser (ICDCS, 2015)

On the Influence of Graph Density on Randomized Gossiping. - Robert Elsässer; Dominik Kaaser (IPDPS, 2015)

Fast Consensus for Voting on General Expander Graphs. - Colin Cooper; Robert Elsässer; Tomasz Radzik; Nicolas Rivera; Takeharu Shiraga (DISC, 2015)

Communication Complexity of Quasirandom Rumor Spreading. - Petra Berenbrink; Robert Elsässer; Thomas Sauerwald (Algorithmica, 2015)

Breaking the log n barrier on rumor spreading. - Chen Avin; Robert Elsässer (CoRR, 2015)

Efficient k-Party Voting with Two Choices. - Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Frederik Mallmann-Trenn; Horst Trinker (CoRR, 2016)

Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky (Distributed Comput., 2016)

Ignore or Comply?: On Breaking Symmetry in Consensus. - Petra Berenbrink; Andrea Clementi; Robert Elsässer; Peter Kling; Frederik Mallmann-Trenn; Emanuele Natale (PODC, 2017)

Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time. - Andreas Bilke; Colin Cooper; Robert Elsässer; Tomasz Radzik (PODC, 2017)

Brief Announcement: Rapid Asynchronous Plurality Consensus. - Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Frederik Mallmann-Trenn; Horst Trinker (PODC, 2017)

Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. - Andreas Bilke; Colin Cooper; Robert Elsässer; Tomasz Radzik (CoRR, 2017)

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Peter Kling; Tomasz Radzik (DISC, 2018)

Majority & Stabilization in Population Protocols. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Peter Kling; Tomasz Radzik (CoRR, 2018)

A population protocol for exact majority with O( log5/3n) stabilization time and asymptotically optimal number of states. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Peter Kling; Tomasz Radzik (CoRR, 2018)

Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies. - Gregor Bankhamer; Robert Elsässer; Dominik Kaaser; Matjaz Krnc (CoRR, 2018)

Breaking the $$ log n$$ log n barrier on rumor spreading. - Chen Avin; Robert Elsässer (Distributed Comput., 2018)

Recent Results in Population Protocols for Exact Majority and Leader Election. - Robert Elsässer; Tomasz Radzik (Bull. EATCS, 2018)

Towards Accurate Simulation of Global Challenges on Data Centers Infrastructures via Coupling of Models and Data Sources. - Sergiy Gogolenko; Derek Groen; Diana Suleimenova; Imran Mahmood; Marcin Lawenda; Francisco Javier Nieto de Santos; John Hanley; Milana Vuckovic; Mark Kröll; Bernhard C. Geiger; Robert Elsässer; Dennis Hoppe (ICCS (6), 2020)

Positive Aging Admits Fast Asynchronous Plurality Consensus. - Gregor Bankhamer; Robert Elsässer; Dominik Kaaser; Matjaz Krnc (PODC, 2020)

Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. - Gregor Bankhamer; Robert Elsässer; Stefan Schmid 001 (DISC, 2021)

Time-space trade-offs in population protocols for the majority problem. - Petra Berenbrink; Robert Elsässer; Tom Friedetzky; Dominik Kaaser; Peter Kling; Tomasz Radzik (Distributed Comput., 2021)

Randomized renaming in shared memory systems. - Petra Berenbrink; André Brinkmann; Robert Elsässer; Tom Friedetzky; Lars Nagel 001 (J. Parallel Distributed Comput., 2021)

Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. - Gregor Bankhamer; Petra Berenbrink; Felix Biermeier; Robert Elsässer; Hamed Hosseinpour; Dominik Kaaser; Peter Kling (PODC, 2022)

Fast Consensus via the Unconstrained Undecided State Dynamics. - Gregor Bankhamer; Petra Berenbrink; Felix Biermeier; Robert Elsässer; Hamed Hosseinpour; Dominik Kaaser; Peter Kling (SODA, 2022)

Generating Simple Directed Social Network Graphs for Information Spreading. - Christoph Schweimer; Christine Gfrerer; Florian Lugstein; David Pape; Jan A. Velimsky; Robert Elsässer; Bernhard C. Geiger (WWW, 2022)

Local Fast Rerouting With Low Congestion: A Randomized Approach. - Gregor Bankhamer; Robert Elsässer; Stefan Schmid 001 (IEEE/ACM Trans. Netw., 2022)

Profiling and optimization of Python-based social sciences applications on HPC systems by means of task and data parallelism. - Lukasz Szustak; Marcin Lawenda; Sebastian Arming; Gregor Bankhamer; Christoph Schweimer; Robert Elsässer (Future Gener. Comput. Syst., 2023)

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model. - Antoine El-Hayek; Robert Elsässer; Stefan Schmid 001 (PODC, 2025)

Silent Self-Stabilizing Ranking: Time Optimal and Space Efficient. - Petra Berenbrink; Robert Elsässer; Thorsten Götte; Lukas Hintze; Dominik Kaaser (CoRR, 2025)