Robert Elsässer

Cited by

	All	Since 2020
Citations	1970	613
h-index	27	13
i10-index	45	16

140

105

1999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420255 8 18 17 34 37 37 51 60 44 67 93 88 73 84 97 111 103 102 105 98 108 130 111 102 123 39

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
Nicolás RiveraUniversidad de ValparaísoVerified email at uv.cl
Takeharu ShiragaChuo UniversityVerified email at g.chuo-u.ac.jp
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
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 NagelLoughborough UniversityVerified email at lboro.ac.uk

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	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	110	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	95	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	94	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	63*	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
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(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	54	2017
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	54	2006
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	51	2015
The power of memory in randomized broadcasting R Elsässer, T Sauerwald Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008	49	2008
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	46	2007
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	45	2011
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 Elsässer, T Radzik Bulletin of EATCS 3 (126), 2018	42	2018
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	41	2017

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