Follow
Robert Elsässer
Robert Elsässer
University of Salzburg
Verified email at cosy.sbg.ac.at
Title
Cited by
Cited by
Year
Diffusion schemes for load balancing on heterogeneous networks
R Elsässer, B Monien, R Preis
Theory of Computing Systems 35, 305-320, 2002
175*2002
Coalescing random walks and voting on connected graphs
C Cooper, R Elsasser, H Ono, T Radzik
SIAM Journal on Discrete Mathematics 27 (4), 1748-1758, 2013
109*2013
Tight bounds for the cover time of multiple random walks
R Elsässer, T Sauerwald
Theoretical Computer Science 412 (24), 2623-2641, 2011
1072011
The power of two choices in distributed voting
C Cooper, R Elsässer, T Radzik
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
852014
An edge-isoperimetric problem for powers of the Petersen graph
SL Bezrukov, SK Das, R Elsässer
Annals of Combinatorics 4, 153-169, 2000
792000
Optimal diffusion schemes and load balancing on product graphs
R Elsässer, B Monien, R Preis, A Frommer
Parallel Processing Letters 14 (01), 61-73, 2004
61*2004
On the runtime and robustness of randomized broadcasting
R Elsässer, T Sauerwald
Theoretical Computer Science 410 (36), 3414-3427, 2009
582009
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
P Berenbrink, R Elsässer, T Friedetzky
Distributed Computing 29, 317-339, 2016
57*2016
On the communication complexity of randomized broadcasting in random-like graphs
R Elsässer
Proceedings of the eighteenth annual ACM symposium on Parallelism in …, 2006
562006
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time
A Bilke, C Cooper, R Elsässer, T Radzik
Proceedings of the ACM Symposium on Principles of Distributed Computing, 451-453, 2017
502017
A Population Protocol for Exact Majority with O (log5/3 n) Stabilization Time and Theta (log n) States}}
U Schmid, J Widder
32nd International Symposium on Distributed Computing (DISC 2018) 121, 10, 2018
48*2018
The power of memory in randomized broadcasting
R Elsässer, T Sauerwald
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008
482008
Fast consensus for voting on general expander graphs
C Cooper, R Elsässer, T Radzik, N Rivera, T Shiraga
Distributed Computing: 29th International Symposium, DISC 2015, Tokyo, Japan …, 2015
472015
Broadcasting vs. mixing and information dissemination on Cayley graphs
R Elsässer, T Sauerwald
STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science …, 2007
462007
New spectral lower bounds on the bisection width of graphs
S Bezrukov, R Elsässer, B Monien, R Preis, JP Tillich
Theoretical Computer Science 320 (2-3), 155-174, 2004
452004
Brief announcement: rapid asynchronous plurality consensus
R Elsässer, T Friedetzky, D Kaaser, F Mallmann-Trenn, H Trinker
Proceedings of the ACM symposium on principles of distributed computing, 363-365, 2017
39*2017
Efficient broadcast on random geometric graphs
M Bradonjić, R Elsässer, T Friedrich, T Sauerwald, A Stauffer
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
392010
Distributing unit size workload packages in heterogeneous networks.
R Elsässer, B Monien, S Schamberger
J. Graph Algorithms Appl. 10 (1), 51-68, 2006
38*2006
Recent results in population protocols for exact majority and leader election
R Elsässer, T Radzik
Bulletin of EATCS 3 (126), 2018
362018
Ignore or comply? on breaking symmetry in consensus
P Berenbrink, A Clementi, R Elsässer, P Kling, F Mallmann-Trenn, ...
Proceedings of the ACM Symposium on Principles of Distributed Computing, 335-344, 2017
362017
The system can't perform the operation now. Try again later.
Articles 1–20