Robert Elsässer

PROFILE

Homepage
No homepage is listed.
ORCID
No ORCID is listed.
Affiliations
No affiliations are listed.
Aliases
No aliases are listed.
Publication record
96 papers · 1,777 citations · H-index 26

PAPERS

Silent Self-Stabilizing Ranking: Time Optimal and Space Efficient
20254 citationsauthor #2
Profiling and optimization of Python-based social sciences applications on HPC systems by means of task and data parallelism
20237 citationsauthor #6
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions
20228 citationsauthor #4
Generating Simple Directed Social Network Graphs for Information Spreading
202229 citationsauthor #6
Fast Consensus via the Unconstrained Undecided State Dynamics
202113 citationsauthor #4
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion
20214 citationsauthor #2
Time-space trade-offs in population protocols for the majority problem
202036 citationsauthor #2
Towards Accurate Simulation of Global Challenges on Data Centers Infrastructures via Coupling of Models and Data Sources
20200 citationsauthor #11
Local Fast Rerouting with Low Congestion: A Randomized Approach
201912 citationsauthor #2
Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies
20181 citationsauthor #2
10 : 2 A Population Protocol for Exact Majority
20180 citationsauthor #2
T he D istributed C omputing C olumn
20180 citationsauthor #1
Majority & Stabilization in Population Protocols
201811 citationsauthor #2
Recent Results in Population Protocols for Exact Majority and Leader Election
201845 citationsauthor #1
A Population Protocol for Exact Majority with O (log 5 / 3 n ) Stabilization Time and Θ(log n ) States
201838 citationsauthor #2
Positive Aging Admits Fast Asynchronous Plurality Consensus
20185 citationsauthor #2
A population protocol for exact majority with O(\log5/3n) stabilization time and asymptotically optimal number of states
201822 citationsauthor #2
Breaking the $$\log n$$logn barrier on rumor spreading
20172 citationsauthor #2
Brief Announcement: Rapid Asynchronous Plurality Consensus
201717 citationsauthor #1
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time
201710 citationsauthor #3
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time
201757 citationsauthor #3
Ignore or Comply?: On Breaking Symmetry in Consensus
201738 citationsauthor #3
Efficient k-Party Voting with Two Choices
201612 citationsauthor #1
On the isomorphism of graphs having some eigenvalues of moderate multiplicity
20161 citationsauthor #1
Rapid Asynchronous Plurality Consensus
201611 citationsauthor #1
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
20160 citationsauthor #2
Fast Consensus for Voting on General Expander Graphs
201548 citationsauthor #2
Breaking the log n barrier on rumor spreading
20153 citationsauthor #2
Randomized Renaming in Shared Memory Systems
20153 citationsauthor #3
Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion
20144 citationsauthor #3
The Power of Two Choices in Distributed Voting
201486 citationsauthor #2
Preface
20140 citationsauthor #2
Communication Complexity of Quasirandom Rumor Spreading
20141 citationsauthor #2
Analyzing Two Competing Epidemic Processes-The Power of Influential Nodes -
20142 citationsauthor #2
On the Influence of Graph Density on Randomized Gossiping
20147 citationsauthor #1
Epidemic Algorithms and Processes : From Theory to Applications 2 Table of Contents Executive Summary
20132 citationsauthor #2
Faster Rumor Spreading: Breaking the logn Barrier
20137 citationsauthor #2
Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042)
20130 citationsauthor #2
Complexity of Quasirandom Rumor Spreading ∗
20130 citationsauthor #2
Agent based Simulations of Epidemics on a Large Scale - Toward the Right Choice of Parameters
20131 citationsauthor #1
Epidemics and Their Implications in Urban Environments: A Case Study on a National Scope
20130 citationsauthor #1
Session details: Session 7
20130 citationsauthor #1
The impact of the power law exponent on the behavior of a dynamic epidemic type process
20124 citationsauthor #2
Coalescing random walks and voting on graphs
201235 citationsauthor #2
Coalescing Random Walks and Voting on Connected Graphs
201286 citationsauthor #2
Awareness and Movement vs. the Spread of Epidemics - Analyzing a Dynamic Model for Urban Social/Technological Networks
20111 citationsauthor #1
Fast Generation and Mixing of Random Graphs in Peer-to-Peer Networks
20110 citationsauthor #4
Faster Coupon Collecting via Replication with Applications in Gossiping
20112 citationsauthor #2
Fast message dissemination in random geometric networks
20113 citationsauthor #2
Efficient broadcast on random geometric graphs
201034 citationsauthor #2
Speeding up random walks with neighborhood exploration
201035 citationsauthor #3
Discrete load balancing is (almost) as easy as continuous load balancing
201014 citationsauthor #1
Efficient Broadcasting in Random Power Law Networks
20102 citationsauthor #1
Toward Proper Random Graph Models for Real World Networks
20103 citationsauthor #1
Settling the Complexity of Local Max-Cut (Almost) Completely
201037 citationsauthor #1
Randomised broadcasting: Memory vs. randomness
20106 citationsauthor #2
Communication Complexity of Quasirandom Rumor Spreading
201014 citationsauthor #2
Efficient Information Exchange in the Random Phone-Call Model
201021 citationsauthor #3
On randomized broadcasting in Star graphs
20092 citationsauthor #1
Tight bounds for the cover time of multiple random walks
200995 citationsauthor #1
Cover Time and Broadcast Time
200912 citationsauthor #1
Random broadcast on random geometric graphs
20090 citationsauthor #2
The power of memory in randomized broadcasting
200846 citationsauthor #1
On Radio Broadcasting in Random Geometric Graphs
20089 citationsauthor #1
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
200852 citationsauthor #2
Agent-based randomized broadcasting in large networks
20072 citationsauthor #1
Dynamically Evolving, Large-scale
200737 citationsauthor #1
On Randomized Broadcasting in Power Law Networks
200611 citationsauthor #1
Radio communication in random graphs
200622 citationsauthor #1
On the runtime and robustness of randomized broadcasting
200675 citationsauthor #1
Toward the Eigenvalue Power Law
20067 citationsauthor #1
On the communication complexity of randomized broadcasting in random-like graphs
200652 citationsauthor #1
On Randomized Broadcasting in Star Graphs
200513 citationsauthor #1
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling
200513 citationsauthor #1
Radio communication in random graphs: extended abstract
20052 citationsauthor #1
Agent-Based Information Handling in Large Networks
200411 citationsauthor #1
Load balancing in dynamic networks
200429 citationsauthor #1
Optimal Diffusion Schemes And Load Balancing On Product Graphs
200422 citationsauthor #1
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
200410 citationsauthor #1
Sparse topologies with small spectrum size
200317 citationsauthor #1
Load balancing of unit size tokens and expansion properties of graphs
200326 citationsauthor #1
On Spectral Bounds for the k-Partitioning of Graphs
20036 citationsauthor #1
Toward optimal diffusion matrices
20029 citationsauthor #1
Diffusion Schemes for Load Balancing on Heterogeneous Networks
200293 citationsauthor #1
Spectral methods for efficient load balancing strategies
20023 citationsauthor #1
Scalable Sparse Topologies with Small Spectrum
20014 citationsauthor #1
Edge-isoperimetric problems for cartesian powers of regular graphs
200128 citationsauthor #2
New spectral bounds on k-partitioning of graphs
20018 citationsauthor #1
An Edge-Isoperimetric Problem for Powers of the Petersen Graph
200080 citationsauthor #3
Diffusive load balancing schemes on heterogeneous networks
200030 citationsauthor #1
The Spider Poset Is Macaulay
200014 citationsauthor #2
New spectral lower bounds on the bisection width of graphs
200032 citationsauthor #2
Optimal Cuts for Powers of the Petersen Graph
19990 citationsauthor #3
On k-partitioning of Hamming Graphs
19994 citationsauthor #2
Optimal and Alternating-Direction Load Balancing Schemes
199930 citationsauthor #1
On Bounds for the k-Partitioning of Graphs
19992 citationsauthor #2
Journal of Graph Algorithms and Applications Distributing Unit Size Workload Packages in Heterogeneous Networks
year unknown26 citationsauthor #1

TIMELINE

1999 36 citations

2000 156 citations

2001 40 citations

2002 105 citations

2003 49 citations

2004 72 citations

2005 28 citations

2006 167 citations

2007 39 citations

2008 107 citations

2009 109 citations

2010 166 citations

2011 6 citations

2012 125 citations

2013 10 citations

2014 100 citations

2015 54 citations

2016 24 citations

2017 124 citations

2018 122 citations

2019 12 citations

2020 36 citations

2021 17 citations

2022 37 citations

2023 7 citations

2025 4 citations

Unknown 26 citations

Robert Elsässer

PROFILE

PAPERS

TIMELINE

COAUTHOR MAP

CONCEPT FOOTPRINT