Robert Elsässer

Orcid: 0000-0002-5766-8103

Affiliations:
  • University of Salzburg, Department of Computer Sciences, Austria
  • University of Paderborn, Germany (former)


According to our database1, Robert Elsässer authored at least 83 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Profiling and optimization of Python-based social sciences applications on HPC systems by means of task and data parallelism.
Future Gener. Comput. Syst., November, 2023

2022
Local Fast Rerouting With Low Congestion: A Randomized Approach.
IEEE/ACM Trans. Netw., 2022

Generating Simple Directed Social Network Graphs for Information Spreading.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Fast Consensus via the Unconstrained Undecided State Dynamics.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021
Randomized renaming in shared memory systems.
J. Parallel Distributed Comput., 2021

Time-space trade-offs in population protocols for the majority problem.
Distributed Comput., 2021

Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion.
Proceedings of the 35th International Symposium on Distributed Computing, 2021

2020
Positive Aging Admits Fast Asynchronous Plurality Consensus.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Towards Accurate Simulation of Global Challenges on Data Centers Infrastructures via Coupling of Models and Data Sources.
Proceedings of the Computational Science - ICCS 2020, 2020

2018
Recent Results in Population Protocols for Exact Majority and Leader Election.
Bull. EATCS, 2018

Breaking the $$\log n$$ log n barrier on rumor spreading.
Distributed Comput., 2018

Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies.
CoRR, 2018

A population protocol for exact majority with O(\log<sup>5/3</sup>n) stabilization time and asymptotically optimal number of states.
CoRR, 2018

Majority & Stabilization in Population Protocols.
CoRR, 2018

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2017
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time.
CoRR, 2017

Brief Announcement: Rapid Asynchronous Plurality Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Brief Announcement: Population Protocols for Leader Election and Exact Majority with <i>O</i>(log<sup>2</sup> <i>n</i>) States and <i>O</i>(log<sup>2</sup><i> n</i>) Convergence Time.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Ignore or Comply?: On Breaking Symmetry in Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems.
Distributed Comput., 2016

Efficient k-Party Voting with Two Choices.
CoRR, 2016

2015
Breaking the log n barrier on rumor spreading.
CoRR, 2015

Communication Complexity of Quasirandom Rumor Spreading.
Algorithmica, 2015

Fast Consensus for Voting on General Expander Graphs.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

On the Influence of Graph Density on Randomized Gossiping.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion.
Proceedings of the 35th IEEE International Conference on Distributed Computing Systems, 2015

2014
Randomised broadcasting: Memory vs. randomness.
Theor. Comput. Sci., 2014

Preface.
Discret. Appl. Math., 2014

The Power of Two Choices in Distributed Voting.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Coalescing Random Walks and Voting on Connected Graphs.
SIAM J. Discret. Math., 2013

Fast message dissemination in random geometric networks.
Distributed Comput., 2013

Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042).
Dagstuhl Reports, 2013

Faster Rumor Spreading: Breaking the logn Barrier.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Agent based Simulations of Epidemics on a Large Scale - Toward the Right Choice of Parameters.
Proceedings of the SIMULTECH 2013, 2013

Epidemics and Their Implications in Urban Environments: A Case Study on a National Scope.
Proceedings of the Simulation and Modeling Methodologies, Technologies and Applications, 2013

2012
The impact of the power law exponent on the behavior of a dynamic epidemic type process.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Coalescing random walks and voting on graphs.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
Tight bounds for the cover time of multiple random walks.
Theor. Comput. Sci., 2011

Awareness and Movement vs. the Spread of Epidemics - Analyzing a Dynamic Model for Urban Social/Technological Networks
CoRR, 2011

Faster Coupon Collecting via Replication with Applications in Gossiping.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Settling the Complexity of Local Max-Cut (Almost) Completely.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Efficient Broadcasting in Random Power Law Networks.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Efficient Broadcast on Random Geometric Graphs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Speeding Up Random Walks with Neighborhood Exploration.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Discrete load balancing is (almost) as easy as continuous load balancing.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Efficient Information Exchange in the Random Phone-Call Model.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
On the runtime and robustness of randomized broadcasting.
Theor. Comput. Sci., 2009

On randomized broadcasting in Star graphs.
Discret. Appl. Math., 2009

Cover Time and Broadcast Time.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
On Radio Broadcasting in Random Geometric Graphs.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

The power of memory in randomized broadcasting.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2007
Agent-based randomized broadcasting in large networks.
Discret. Appl. Math., 2007

Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs.
Proceedings of the STACS 2007, 2007

2006
Distributing Unit Size Workload Packages in Heterogeneous Networks.
J. Graph Algorithms Appl., 2006

Radio communication in random graphs.
J. Comput. Syst. Sci., 2006

On Randomized Broadcasting in Power Law Networks.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

On the communication complexity of randomized broadcasting in random-like graphs.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Toward the Eigenvalue Power Law.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

On Randomized Broadcasting in Star Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Radio communication in random graphs: extended abstract.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

2004
New spectral lower bounds on the bisection width of graphs.
Theor. Comput. Sci., 2004

Optimal Diffusion Schemes And Load Balancing On Product Graphs.
Parallel Process. Lett., 2004

Agent-Based Information Handling in Large Networks.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Load Balancing in Dynamic Networks.
Proceedings of the 7th International Symposium on Parallel Architectures, 2004

Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks.
Proceedings of the Algorithms, 2004

2003
Sparse topologies with small spectrum size.
Theor. Comput. Sci., 2003

Edge-isoperimetric problems for cartesian powers of regular graphs.
Theor. Comput. Sci., 2003

On Spectral Bounds for the k-Partitioning of Graphs.
Theory Comput. Syst., 2003

Load balancing of unit size tokens and expansion properties of graphs.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002
Diffusion Schemes for Load Balancing on Heterogeneous Networks.
Theory Comput. Syst., 2002

Toward Optimal Diffusion Matrices.
Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Spectral methods for efficient load balancing strategies.
Proceedings of the Ausgezeichnete Informatikdissertationen 2002, 2002

Spectral methods for efficient load balancing strategies.
PhD thesis, 2002

2001
Scalable Sparse Topologies with Small Spectrum.
Proceedings of the STACS 2001, 2001

New spectral bounds on k-partitioning of graphs.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000
The Spider Poset Is Macaulay.
J. Comb. Theory A, 2000

Diffusive load balancing schemes on heterogeneous networks.
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

1999
On k-partitioning of Hamming Graphs.
Discret. Appl. Math., 1999

Optimal Cuts for Powers of the Petersen Graph.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Optimal and Alternating-Direction Load Balancing Schemes.
Proceedings of the Euro-Par '99 Parallel Processing, 5th International Euro-Par Conference, Toulouse, France, August 31, 1999

On Bounds for the k-Partitioning of Graphs.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999


  Loading...