متابعة
Robert Elsässer
Robert Elsässer
University of Salzburg
بريد إلكتروني تم التحقق منه على cosy.sbg.ac.at
عنوان
عدد مرات الاقتباسات
عدد مرات الاقتباسات
السنة
Diffusion schemes for load balancing on heterogeneous networks‏
R Elsässer, B Monien, R Preis‏
Theory of Computing Systems 35, 305-320, 2002‏
176*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‏
122*2013
Tight bounds for the cover time of multiple random walks‏
R Elsässer, T Sauerwald‏
Theoretical Computer Science 412 (24), 2623-2641, 2011‏
1102011
The power of two choices in distributed voting‏
C Cooper, R Elsässer, T Radzik‏
International Colloquium on Automata, Languages, and Programming, 435-446, 2014‏
952014
An edge-isoperimetric problem for powers of the Petersen graph‏
SL Bezrukov, SK Das, R Elsässer‏
Annals of combinatorics 4, 153-169, 2000‏
942000
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‏
63*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‏
Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008‏
582008
A population protocol for exact majority with O (log5/3 n) stabilization time and Θ (log n) states‏
P Berenbrink, R Elsässer, T Friedetzky, D Kaaser, P Kling, T Radzik‏
32nd International Symposium on Distributed Computing, DISC 2018, 10, 2018‏
56*2018
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‏
542017
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‏
542006
Fast consensus for voting on general expander graphs‏
C Cooper, R Elsässer, T Radzik, N Rivera, T Shiraga‏
International Symposium on Distributed Computing, 248-262, 2015‏
512015
The power of memory in randomized broadcasting‏
R Elsässer, T Sauerwald‏
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008‏
492008
Broadcasting vs. mixing and information dissemination on Cayley graphs‏
R Elsässer, T Sauerwald‏
Annual Symposium on Theoretical Aspects of Computer Science, 163-174, 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‏
46*2004
Settling the complexity of local max-cut (almost) completely‏
R Elsässer, T Tscheuschner‏
International Colloquium on Automata, Languages, and Programming, 171-182, 2011‏
452011
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‏
44*2017
Time-space trade-offs in population protocols for the majority problem‏
P Berenbrink, R Elsässer, T Friedetzky, D Kaaser, P Kling, T Radzik‏
Distributed Computing 34, 91-111, 2021‏
43*2021
Recent results in population protocols for exact majority and leader election‏
R Elsässer, T Radzik‏
Bulletin of EATCS 3 (126), 2018‏
422018
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‏
412017
يتعذر على النظام إجراء العملية في الوقت الحالي. عاود المحاولة لاحقًا.
مقالات 1–20