Robert Elsässer

110 papers A* 15A 15B 18C 1Misc 1Journal 48Unranked 10

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