Robert Elsässer

Cited by

	All	Since 2019
Citations	1906	643
h-index	26	13
i10-index	45	18

140

105

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320245 8 18 18 34 36 37 53 60 42 68 94 88 73 84 100 109 107 100 104 98 106 129 107 107 95

Public access

View all

27 articles

4 articles

available

not available

Based on funding mandates

Co-authors

Thomas SauerwaldUniversity Lecturer in Computer Science, University of CambridgeVerified email at cl.cam.ac.uk
Burkhard MonienProfessor für InformatikVerified email at upb.de
Tomasz RadzikKing's College LondonVerified email at kcl.ac.uk
Dominik KaaserTU HamburgVerified email at kaaser.at
Peter KlingUniversity of HamburgVerified email at uni-hamburg.de
Frederik Mallmann-TrennKing's College LondonVerified email at kcl.ac.uk
Leszek A GąsieniecUniversity of LiverpoolVerified email at liverpool.ac.uk
Hirotaka OnoNagoya University, JapanVerified email at i.nagoya-u.ac.jp
Sajal K. DasCurators' Distinguished Professor & Daniel St. Clair Endowed Chair, Computer Science, Missouri S&TVerified email at mst.edu
Andreas FrommerProfessor für Angewandte Informatik, Bergische Universität WuppertalVerified email at math.uni-wuppertal.de
Jean-Pierre TillichResearcher at INRIA ParisVerified email at inria.fr
Tobias FriedrichChair for Algorithm Engineering, Hasso Plattner Institute, Potsdam, GermanyVerified email at hpi.de
Rastislav KrálovičComenius UniversityVerified email at dcs.fmph.uniba.sk
Marios MavronicolasProfessor of Computer Science, University of CyprusVerified email at cs.ucy.ac.cy
Martin GairingDepartment of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Nicolás RiveraUniversidad de ValparaísoVerified email at uv.cl
Takeharu ShiragaChuo UniversityVerified email at g.chuo-u.ac.jp
Emanuele NataleCNRS, Université Côte d'Azur, I3S, INRIAVerified email at i3s.unice.fr
andrea clementiFull Professor, Dipartimento di Ingegneria dell'Impresa, Università Tor Vergata, RomaVerified email at mat.uniroma2.it
Lars NagelZentrum für Datenverarbeitung, Johannes-Gutenberg-Universität MainzVerified email at uni-mainz.de

Robert Elsässer

University of Salzburg

Verified email at cosy.sbg.ac.at

Algorithms


Title Sort by citations Sort by year Sort by 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	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	116*	2013
Tight bounds for the cover time of multiple random walks R Elsässer, T Sauerwald Theoretical Computer Science 412 (24), 2623-2641, 2011	107	2011
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	89	2014
An edge-isoperimetric problem for powers of the Petersen graph SL Bezrukov, SK Das, R Elsässer Annals of combinatorics 4, 153-169, 2000	89	2000
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	62*	2004
On the runtime and robustness of randomized broadcasting R Elsässer, T Sauerwald Theoretical Computer Science 410 (36), 3414-3427, 2009	58	2009
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	58	2008
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	55	2006
A Population Protocol for Exact Majority with O (log5/3 n) Stabilization Time and Theta (log n) States P Berenbrink, R Elsässer, T Friedetzky, D Kaaser, P Kling, T Radzik 32nd International Symposium on Distributed Computing (DISC 2018), 2018	52*	2018
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log² n) States and O(log² 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	50	2017
The power of memory in randomized broadcasting R Elsässer, T Sauerwald Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008	48	2008
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	48*	2004
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	47	2015
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	47	2007
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	42*	2017
Settling the complexity of local max-cut (almost) completely R Elsässer, T Tscheuschner International Colloquium on Automata, Languages, and Programming, 171-182, 2011	42	2011
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	41	2010
Recent results in population protocols for exact majority and leader election R Elsässer, T Radzik Bulletin of EATCS 3 (126), 2018	39	2018
Distributing unit size workload packages in heterogeneous networks R Elsässer, B Monien, S Schamberger Journal of Graph Algorithms and Applications 10 (1), 51-68, 2006	39*	2006

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors