Robert Elsässer

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 35

Top Venues

University of Paderborn, Germany (PHD)

Education History

University of Paderborn, Germany

PHD

Publications

Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling
Population Protocols for Exact Plurality Consensus - How a small chance of failure helps to eliminate insignificant opinions. CoRR (2024)
Lukasz Szustak, Marcin Lawenda, Sebastian Arming, Gregor Bankhamer, Christoph Schweimer, Robert Elsässer
Profiling and optimization of Python-based social sciences applications on HPC systems by means of task and data parallelism. Future Gener. Comput. Syst. 148 (2023)
Christoph Schweimer, Christine Gfrerer, Florian Lugstein, David Pape, Jan A. Velimsky, Robert Elsässer, Bernhard C. Geiger
Generating Simple Directed Social Network Graphs for Information Spreading. WWW (2022)
Gregor Bankhamer, Robert Elsässer, Stefan Schmid
Local Fast Rerouting With Low Congestion: A Randomized Approach. IEEE/ACM Trans. Netw. 30 (6) (2022)
Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling
Fast Consensus via the Unconstrained Undecided State Dynamics. SODA (2022)
Christoph Schweimer, Christine Gfrerer, Florian Lugstein, David Pape, Jan A. Velimsky, Robert Elsässer, Bernhard C. Geiger
Generating Simple Directed Social Network Graphs for Information Spreading. CoRR (2022)
Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. PODC (2022)
Gregor Bankhamer, Robert Elsässer, Stefan Schmid
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. DISC (2021)
Gregor Bankhamer, Robert Elsässer, Stefan Schmid
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. CoRR (2021)
Petra Berenbrink, André Brinkmann, Robert Elsässer, Tom Friedetzky, Lars Nagel
Randomized renaming in shared memory systems. J. Parallel Distributed Comput. 150 (2021)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
Time-space trade-offs in population protocols for the majority problem. Distributed Comput. 34 (2) (2021)
Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling
Fast Consensus via the Unconstrained Undecided State Dynamics. CoRR (2021)
Gregor Bankhamer, Robert Elsässer, Stefan Schmid
Local Fast Rerouting with Low Congestion: A Randomized Approach. CoRR (2020)
Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc
Positive Aging Admits Fast Asynchronous Plurality Consensus. PODC (2020)
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
Towards Accurate Simulation of Global Challenges on Data Centers Infrastructures via Coupling of Models and Data Sources. ICCS (6) (2020)
Gregor Bankhamer, Robert Elsässer, Stefan Schmid
Local Fast Rerouting with Low Congestion: A Randomized Approach. ICNP (2019)
Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc
Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies. CoRR (2018)
Chen Avin, Robert Elsässer
Breaking the $$\log n$$ log n barrier on rumor spreading. Distributed Comput. 31 (6) (2018)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
n) stabilization time and asymptotically optimal number of states. CoRR (2018)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
Majority & Stabilization in Population Protocols. CoRR (2018)
Robert Elsässer, Tomasz Radzik
Recent Results in Population Protocols for Exact Majority and Leader Election. Bull. EATCS 126 (2018)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DISC (2018)
Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
) Convergence Time. PODC (2017)
Petra Berenbrink, Andrea E. F. Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale
Ignore or Comply?: On Breaking Symmetry in Consensus. PODC (2017)
Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. CoRR (2017)
Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker
Brief Announcement: Rapid Asynchronous Plurality Consensus. PODC (2017)
Petra Berenbrink, Andrea E. F. Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale
Ignore or Comply? On Breaking Symmetry in Consensus. CoRR (2017)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. Distributed Comput. 29 (5) (2016)
Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker
Efficient k-Party Voting with Two Choices. CoRR (2016)
Hoda Akbari, Petra Berenbrink, Robert Elsässer, Dominik Kaaser
Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion. ICDCS (2015)
Petra Berenbrink, André Brinkmann, Robert Elsässer, Tom Friedetzky, Lars Nagel
Randomized Renaming in Shared Memory Systems. IPDPS (2015)
Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
Fast Consensus for Voting on General Expander Graphs. DISC (2015)
Robert Elsässer, Dominik Kaaser
On the Influence of Graph Density on Randomized Gossiping. IPDPS (2015)
Chen Avin, Robert Elsässer
Breaking the log n barrier on rumor spreading. CoRR (2015)
Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Communication Complexity of Quasirandom Rumor Spreading. Algorithmica 72 (2) (2015)
Colin Cooper, Robert Elsässer, Tomasz Radzik
The Power of Two Choices in Distributed Voting. CoRR (2014)
Colin Cooper, Robert Elsässer, Tomasz Radzik
The Power of Two Choices in Distributed Voting. ICALP (2) (2014)
Francesc Comellas, Robert Elsässer, Dragan Stevanovic
Preface. Discret. Appl. Math. 176 (2014)
Robert Elsässer, Dominik Kaaser
On the Influence of Graph Density on Randomized Gossiping. CoRR (2014)
Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Randomised broadcasting: Memory vs. randomness. Theor. Comput. Sci. 520 (2014)
Hoda Akbari, Petra Berenbrink, Robert Elsässer, Dominik Kaaser
Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion. CoRR (2014)
Robert Elsässer, Adrian Ogierman, Michael Meier
Epidemics and Their Implications in Urban Environments: A Case Study on a National Scope. SIMULTECH (Selected Papers) (2013)
Robert Elsässer, Adrian Ogierman, Michael Meier
Agent based Simulations of Epidemics on a Large Scale - Toward the Right Choice of Parameters. SIMULTECH (2013)
Benjamin Doerr, Robert Elsässer, Pierre Fraigniaud
Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). Dagstuhl Reports 3 (1) (2013)
Chen Avin, Robert Elsässer
Faster Rumor Spreading: Breaking the logn Barrier. DISC (2013)
Artur Czumaj, Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald, Xin Wang
Fast message dissemination in random geometric networks. Distributed Comput. 26 (1) (2013)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. 27 (4) (2013)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing random walks and voting on graphs. PODC (2012)
Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik
Coalescing random walks and voting on graphs CoRR (2012)
Adrian Ogierman, Robert Elsässer
The impact of the power law exponent on the behavior of a dynamic epidemic type process. SPAA (2012)
Robert Elsässer, Adrian Ogierman
Awareness and Movement vs. the Spread of Epidemics - Analyzing a Dynamic Model for Urban Social/Technological Networks CoRR (2011)
Robert Elsässer, Thomas Sauerwald
Tight bounds for the cover time of multiple random walks. Theor. Comput. Sci. 412 (24) (2011)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald
Faster Coupon Collecting via Replication with Applications in Gossiping. MFCS (2011)
Robert Elsässer, Tobias Tscheuschner
Settling the Complexity of Local Max-Cut (Almost) Completely. ICALP (1) (2011)
Robert Elsässer, Adrian Ogierman
Efficient Broadcasting in Random Power Law Networks. WG (2010)
Robert Elsässer, Thomas Sauerwald
Discrete load balancing is (almost) as easy as continuous load balancing. PODC (2010)
Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Gasieniec
Efficient Information Exchange in the Random Phone-Call Model. ICALP (2) (2010)
Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald
Speeding Up Random Walks with Neighborhood Exploration. SODA (2010)
Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
Efficient Broadcast on Random Geometric Graphs. SODA (2010)
Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Communication Complexity of Quasirandom Rumor Spreading. ESA (1) (2010)
Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Randomised Broadcasting: Memory vs. Randomness. LATIN (2010)
Robert Elsässer, Thomas Sauerwald
On the runtime and robustness of randomized broadcasting. Theor. Comput. Sci. 410 (36) (2009)
Robert Elsässer, Thomas Sauerwald
Cover Time and Broadcast Time. STACS (2009)
Robert Elsässer, Thomas Sauerwald
Tight Bounds for the Cover Time of Multiple Random Walks. ICALP (1) (2009)
Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
On randomized broadcasting in Star graphs. Discret. Appl. Math. 157 (1) (2009)
Robert Elsässer, Thomas Sauerwald
Cover Time and Broadcast Time CoRR (2009)
Petra Berenbrink, Robert Elsässer, Tom Friedetzky
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. PODC (2008)
Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald
On Radio Broadcasting in Random Geometric Graphs. DISC (2008)
Robert Elsässer, Thomas Sauerwald
The power of memory in randomized broadcasting. SODA (2008)
Robert Elsässer, Thomas Sauerwald
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. STACS (2007)
Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
Agent-based randomized broadcasting in large networks. Discret. Appl. Math. 155 (2) (2007)
Robert Elsässer, Leszek Gasieniec
Radio communication in random graphs. J. Comput. Syst. Sci. 72 (3) (2006)
Robert Elsässer, Burkhard Monien, Stefan Schamberger
Distributing Unit Size Workload Packages in Heterogeneous Networks. J. Graph Algorithms Appl. 10 (1) (2006)
Robert Elsässer, Thomas Sauerwald
On the Runtime and Robustness of Randomized Broadcasting. ISAAC (2006)
Robert Elsässer
On the communication complexity of randomized broadcasting in random-like graphs. SPAA (2006)
Robert Elsässer
On Randomized Broadcasting in Power Law Networks. DISC (2006)
Robert Elsässer
Toward the Eigenvalue Power Law. MFCS (2006)
Robert Elsässer, Thomas Sauerwald
On Randomized Broadcasting in Star Graphs. WG (2005)
Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE (2005)
Robert Elsässer, Leszek Gasieniec
Radio communication in random graphs: extended abstract. SPAA (2005)
Robert Elsässer, Burkhard Monien, Stefan Schamberger
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. ESA (2004)
Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
Agent-Based Information Handling in Large Networks. MFCS (2004)
Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
New spectral lower bounds on the bisection width of graphs. Theor. Comput. Sci. 320 (2-3) (2004)
Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer
Optimal Diffusion Schemes And Load Balancing On Product Graphs. Parallel Process. Lett. 14 (1) (2004)
Robert Elsässer, Burkhard Monien, Stefan Schamberger
Load Balancing in Dynamic Networks. ISPAN (2004)
Sergei L. Bezrukov, Robert Elsässer
Edge-isoperimetric problems for cartesian powers of regular graphs. Theor. Comput. Sci. 307 (3) (2003)
Robert Elsässer, Rastislav Kralovic, Burkhard Monien
Sparse topologies with small spectrum size. Theor. Comput. Sci. 307 (3) (2003)
Robert Elsässer, Thomas Lücking, Burkhard Monien
On Spectral Bounds for the k-Partitioning of Graphs. Theory Comput. Syst. 36 (5) (2003)
Robert Elsässer, Burkhard Monien
Load balancing of unit size tokens and expansion properties of graphs. SPAA (2003)
Robert Elsässer
Spectral methods for efficient load balancing strategies. Ausgezeichnete Informatikdissertationen (2002)
Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
Toward Optimal Diffusion Matrices. IPDPS (2002)
Robert Elsässer, Burkhard Monien, Robert Preis
Diffusion Schemes for Load Balancing on Heterogeneous Networks. Theory Comput. Syst. 35 (3) (2002)
Sergei L. Bezrukov, Robert Elsässer
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. WG (2001)
Robert Elsässer, Rastislav Kralovic, Burkhard Monien
Scalable Sparse Topologies with Small Spectrum. STACS (2001)
Robert Elsässer, Thomas Lücking, Burkhard Monien
New spectral bounds on k-partitioning of graphs. SPAA (2001)
Robert Elsässer, Burkhard Monien, Robert Preis
Diffusive load balancing schemes on heterogeneous networks. SPAA (2000)
Sergei L. Bezrukov, Robert Elsässer
The Spider Poset Is Macaulay. J. Comb. Theory, Ser. A 90 (1) (2000)
Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
New Spectral Lower Bounds on the Bisection Width of Graphs. WG (2000)
Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder
On k-partitioning of Hamming Graphs. Discret. Appl. Math. 95 (1-3) (1999)
Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder
On Bounds for the k-Partitioning of Graphs. COCOON (1999)

Robert Elsässer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Robert Elsässer