default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Elsässer
Person information
- affiliation: University of Salzburg, Department of Computer Sciences, Austria
- affiliation (former): University of Paderborn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[i19]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus - How a small chance of failure helps to eliminate insignificant opinions. CoRR abs/2402.06471 (2024)- 2023
- [j26]Lukasz Szustak
, Marcin Lawenda, Sebastian Arming, Gregor Bankhamer, Christoph Schweimer, Robert Elsässer:
Profiling and optimization of Python-based social sciences applications on HPC systems by means of task and data parallelism. Future Gener. Comput. Syst. 148: 623-635 (2023) - 2022
- [j25]Gregor Bankhamer, Robert Elsässer, Stefan Schmid:
Local Fast Rerouting With Low Congestion: A Randomized Approach. IEEE/ACM Trans. Netw. 30(6): 2403-2418 (2022) - [c56]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions. PODC 2022: 224-234 - [c55]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Fast Consensus via the Unconstrained Undecided State Dynamics. SODA 2022: 3417-3429 - [c54]Christoph Schweimer, Christine Gfrerer, Florian Lugstein, David Pape, Jan A. Velimsky, Robert Elsässer, Bernhard C. Geiger:
Generating Simple Directed Social Network Graphs for Information Spreading. WWW 2022: 1475-1485 - [i18]Christoph Schweimer, Christine Gfrerer, Florian Lugstein, David Pape, Jan A. Velimsky, Robert Elsässer, Bernhard C. Geiger:
Generating Simple Directed Social Network Graphs for Information Spreading. CoRR abs/2205.02485 (2022) - 2021
- [j24]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Time-space trade-offs in population protocols for the majority problem. Distributed Comput. 34(2): 91-111 (2021) - [j23]Petra Berenbrink, André Brinkmann, Robert Elsässer, Tom Friedetzky, Lars Nagel:
Randomized renaming in shared memory systems. J. Parallel Distributed Comput. 150: 112-120 (2021) - [c53]Gregor Bankhamer, Robert Elsässer, Stefan Schmid:
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. DISC 2021: 9:1-9:19 - [i17]Gregor Bankhamer, Petra Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling:
Fast Consensus via the Unconstrained Undecided State Dynamics. CoRR abs/2103.10366 (2021) - [i16]Gregor Bankhamer, Robert Elsässer, Stefan Schmid:
Randomized Local Fast Rerouting for Datacenter Networks with Almost Optimal Congestion. CoRR abs/2108.02136 (2021) - 2020
- [c52]Sergiy Gogolenko, Derek Groen, Diana Suleimenova, Imran Mahmood, Marcin Lawenda, Francisco Javier Nieto de Santos, John Hanley, Milana Vuckovic, Mark Kröll, Bernhard C. Geiger, Robert Elsässer, Dennis Hoppe:
Towards Accurate Simulation of Global Challenges on Data Centers Infrastructures via Coupling of Models and Data Sources. ICCS (6) 2020: 410-424 - [c51]Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc:
Positive Aging Admits Fast Asynchronous Plurality Consensus. PODC 2020: 385-394 - [i15]Gregor Bankhamer, Robert Elsässer, Stefan Schmid:
Local Fast Rerouting with Low Congestion: A Randomized Approach. CoRR abs/2009.01497 (2020)
2010 – 2019
- 2019
- [c50]Gregor Bankhamer, Robert Elsässer, Stefan Schmid:
Local Fast Rerouting with Low Congestion: A Randomized Approach. ICNP 2019: 1-11 - 2018
- [j22]Chen Avin, Robert Elsässer:
Breaking the $$\log n$$ log n barrier on rumor spreading. Distributed Comput. 31(6): 503-513 (2018) - [j21]Robert Elsässer, Tomasz Radzik:
Recent Results in Population Protocols for Exact Majority and Leader Election. Bull. EATCS 126 (2018) - [c49]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DISC 2018: 10:1-10:18 - [i14]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Majority & Stabilization in Population Protocols. CoRR abs/1805.04586 (2018) - [i13]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A population protocol for exact majority with O(\log5/3n) stabilization time and asymptotically optimal number of states. CoRR abs/1805.05157 (2018) - [i12]Gregor Bankhamer, Robert Elsässer, Dominik Kaaser, Matjaz Krnc:
Fast Consensus Protocols in the Asynchronous Poisson Clock Model with Edge Latencies. CoRR abs/1806.02596 (2018) - 2017
- [c48]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply?: On Breaking Symmetry in Consensus. PODC 2017: 335-344 - [c47]Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker:
Brief Announcement: Rapid Asynchronous Plurality Consensus. PODC 2017: 363-365 - [c46]Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik:
Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time. PODC 2017: 451-453 - [i11]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply? On Breaking Symmetry in Consensus. CoRR abs/1702.04921 (2017) - [i10]Andreas Bilke, Colin Cooper, Robert Elsässer, Tomasz Radzik:
Population protocols for leader election and exact majority with O(log^2 n) states and O(log^2 n) convergence time. CoRR abs/1705.01146 (2017) - 2016
- [j20]Petra Berenbrink, Robert Elsässer, Tom Friedetzky:
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. Distributed Comput. 29(5): 317-339 (2016) - [i9]Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker:
Efficient k-Party Voting with Two Choices. CoRR abs/1602.04667 (2016) - 2015
- [j19]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Communication Complexity of Quasirandom Rumor Spreading. Algorithmica 72(2): 467-492 (2015) - [c45]Hoda Akbari, Petra Berenbrink, Robert Elsässer, Dominik Kaaser:
Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion. ICDCS 2015: 497-506 - [c44]Robert Elsässer, Dominik Kaaser:
On the Influence of Graph Density on Randomized Gossiping. IPDPS 2015: 521-531 - [c43]Petra Berenbrink, André Brinkmann, Robert Elsässer, Tom Friedetzky, Lars Nagel:
Randomized Renaming in Shared Memory Systems. IPDPS 2015: 542-549 - [c42]Colin Cooper, Robert Elsässer, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga:
Fast Consensus for Voting on General Expander Graphs. DISC 2015: 248-262 - [i8]Chen Avin, Robert Elsässer:
Breaking the log n barrier on rumor spreading. CoRR abs/1512.03022 (2015) - 2014
- [j18]Francesc Comellas, Robert Elsässer, Dragan Stevanovic:
Preface. Discret. Appl. Math. 176: 1-2 (2014) - [j17]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Randomised broadcasting: Memory vs. randomness. Theor. Comput. Sci. 520: 27-42 (2014) - [c41]Colin Cooper, Robert Elsässer, Tomasz Radzik:
The Power of Two Choices in Distributed Voting. ICALP (2) 2014: 435-446 - [i7]Colin Cooper, Robert Elsässer, Tomasz Radzik:
The Power of Two Choices in Distributed Voting. CoRR abs/1404.7479 (2014) - [i6]Robert Elsässer, Dominik Kaaser:
On the Influence of Graph Density on Randomized Gossiping. CoRR abs/1410.5355 (2014) - [i5]Hoda Akbari, Petra Berenbrink, Robert Elsässer, Dominik Kaaser:
Discrete Load Balancing in Heterogeneous Networks with a Focus on Second-Order Diffusion. CoRR abs/1412.7018 (2014) - 2013
- [j16]Artur Czumaj, Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald, Xin Wang:
Fast message dissemination in random geometric networks. Distributed Comput. 26(1): 1-24 (2013) - [j15]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing Random Walks and Voting on Connected Graphs. SIAM J. Discret. Math. 27(4): 1748-1758 (2013) - [c40]Robert Elsässer, Adrian Ogierman, Michael Meier:
Epidemics and Their Implications in Urban Environments: A Case Study on a National Scope. SIMULTECH (Selected Papers) 2013: 55-70 - [c39]Robert Elsässer, Adrian Ogierman, Michael Meier:
Agent based Simulations of Epidemics on a Large Scale - Toward the Right Choice of Parameters. SIMULTECH 2013: 263-274 - [c38]Chen Avin, Robert Elsässer:
Faster Rumor Spreading: Breaking the logn Barrier. DISC 2013: 209-223 - [i4]Benjamin Doerr, Robert Elsässer, Pierre Fraigniaud:
Epidemic Algorithms and Processes: From Theory to Applications (Dagstuhl Seminar 13042). Dagstuhl Reports 3(1): 94-110 (2013) - 2012
- [c37]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. PODC 2012: 47-56 - [c36]Adrian Ogierman, Robert Elsässer:
The impact of the power law exponent on the behavior of a dynamic epidemic type process. SPAA 2012: 131-139 - [i3]Colin Cooper, Robert Elsässer, Hirotaka Ono, Tomasz Radzik:
Coalescing random walks and voting on graphs. CoRR abs/1204.4106 (2012) - 2011
- [j14]Robert Elsässer, Thomas Sauerwald:
Tight bounds for the cover time of multiple random walks. Theor. Comput. Sci. 412(24): 2623-2641 (2011) - [c35]Robert Elsässer, Tobias Tscheuschner:
Settling the Complexity of Local Max-Cut (Almost) Completely. ICALP (1) 2011: 171-182 - [c34]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald:
Faster Coupon Collecting via Replication with Applications in Gossiping. MFCS 2011: 72-83 - [i2]Robert Elsässer, Adrian Ogierman:
Awareness and Movement vs. the Spread of Epidemics - Analyzing a Dynamic Model for Urban Social/Technological Networks. CoRR abs/1109.3547 (2011) - 2010
- [c33]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Communication Complexity of Quasirandom Rumor Spreading. ESA (1) 2010: 134-145 - [c32]Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Gasieniec:
Efficient Information Exchange in the Random Phone-Call Model. ICALP (2) 2010: 127-138 - [c31]Petra Berenbrink, Robert Elsässer, Thomas Sauerwald:
Randomised Broadcasting: Memory vs. Randomness. LATIN 2010: 306-319 - [c30]Robert Elsässer, Thomas Sauerwald:
Discrete load balancing is (almost) as easy as continuous load balancing. PODC 2010: 346-354 - [c29]Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer:
Efficient Broadcast on Random Geometric Graphs. SODA 2010: 1412-1421 - [c28]Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald:
Speeding Up Random Walks with Neighborhood Exploration. SODA 2010: 1422-1435 - [c27]Robert Elsässer, Adrian Ogierman:
Efficient Broadcasting in Random Power Law Networks. WG 2010: 279-291
2000 – 2009
- 2009
- [j13]Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
On randomized broadcasting in Star graphs. Discret. Appl. Math. 157(1): 126-139 (2009) - [j12]Robert Elsässer, Thomas Sauerwald:
On the runtime and robustness of randomized broadcasting. Theor. Comput. Sci. 410(36): 3414-3427 (2009) - [c26]Robert Elsässer, Thomas Sauerwald:
Tight Bounds for the Cover Time of Multiple Random Walks. ICALP (1) 2009: 415-426 - [c25]Robert Elsässer, Thomas Sauerwald:
Cover Time and Broadcast Time. STACS 2009: 373-384 - [i1]Robert Elsässer, Thomas Sauerwald:
Cover Time and Broadcast Time. CoRR abs/0902.1735 (2009) - 2008
- [c24]Petra Berenbrink, Robert Elsässer, Tom Friedetzky:
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. PODC 2008: 155-164 - [c23]Robert Elsässer, Thomas Sauerwald:
The power of memory in randomized broadcasting. SODA 2008: 218-227 - [c22]Robert Elsässer, Leszek Gasieniec, Thomas Sauerwald:
On Radio Broadcasting in Random Geometric Graphs. DISC 2008: 212-226 - 2007
- [j11]Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
Agent-based randomized broadcasting in large networks. Discret. Appl. Math. 155(2): 150-160 (2007) - [c21]Robert Elsässer, Thomas Sauerwald:
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. STACS 2007: 163-174 - 2006
- [j10]Robert Elsässer, Leszek Gasieniec:
Radio communication in random graphs. J. Comput. Syst. Sci. 72(3): 490-506 (2006) - [j9]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Distributing Unit Size Workload Packages in Heterogeneous Networks. J. Graph Algorithms Appl. 10(1): 51-68 (2006) - [c20]Robert Elsässer, Thomas Sauerwald:
On the Runtime and Robustness of Randomized Broadcasting. ISAAC 2006: 349-358 - [c19]Robert Elsässer:
Toward the Eigenvalue Power Law. MFCS 2006: 351-362 - [c18]Robert Elsässer:
On the communication complexity of randomized broadcasting in random-like graphs. SPAA 2006: 148-157 - [c17]Robert Elsässer:
On Randomized Broadcasting in Power Law Networks. DISC 2006: 370-384 - 2005
- [c16]Robert Elsässer, Leszek Gasieniec:
Radio communication in random graphs: extended abstract. SPAA 2005: 309-315 - [c15]Robert Elsässer, Thomas Sauerwald:
On Randomized Broadcasting in Star Graphs. WG 2005: 307-318 - [c14]Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien:
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. WINE 2005: 195-209 - 2004
- [j8]Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer:
Optimal Diffusion Schemes And Load Balancing On Product Graphs. Parallel Process. Lett. 14(1): 61-73 (2004) - [j7]Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich:
New spectral lower bounds on the bisection width of graphs. Theor. Comput. Sci. 320(2-3): 155-174 (2004) - [c13]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. ESA 2004: 640-651 - [c12]Robert Elsässer, Burkhard Monien, Stefan Schamberger:
Load Balancing in Dynamic Networks. ISPAN 2004: 193-200 - [c11]Robert Elsässer, Ulf Lorenz, Thomas Sauerwald:
Agent-Based Information Handling in Large Networks. MFCS 2004: 586-598 - 2003
- [j6]Robert Elsässer, Thomas Lücking, Burkhard Monien:
On Spectral Bounds for the k-Partitioning of Graphs. Theory Comput. Syst. 36(5): 461-478 (2003) - [j5]Sergei L. Bezrukov, Robert Elsässer:
Edge-isoperimetric problems for cartesian powers of regular graphs. Theor. Comput. Sci. 307(3): 473-492 (2003) - [j4]Robert Elsässer, Rastislav Kralovic, Burkhard Monien:
Sparse topologies with small spectrum size. Theor. Comput. Sci. 307(3): 549-565 (2003) - [c10]Robert Elsässer, Burkhard Monien:
Load balancing of unit size tokens and expansion properties of graphs. SPAA 2003: 266-273 - 2002
- [b1]Robert Elsässer:
Spectral methods for efficient load balancing strategies. University of Paderborn, Germany, 2002, pp. I-II, 1-121 - [j3]Robert Elsässer, Burkhard Monien, Robert Preis:
Diffusion Schemes for Load Balancing on Heterogeneous Networks. Theory Comput. Syst. 35(3): 305-320 (2002) - [c9]Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger:
Toward Optimal Diffusion Matrices. IPDPS 2002 - [p1]Robert Elsässer:
Spectral methods for efficient load balancing strategies. Ausgezeichnete Informatikdissertationen 2002: 29-38 - 2001
- [c8]Robert Elsässer, Thomas Lücking, Burkhard Monien:
New spectral bounds on k-partitioning of graphs. SPAA 2001: 255-262 - [c7]Robert Elsässer, Rastislav Kralovic, Burkhard Monien:
Scalable Sparse Topologies with Small Spectrum. STACS 2001: 218-229 - [c6]Sergei L. Bezrukov, Robert Elsässer:
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. WG 2001: 9-20 - 2000
- [j2]Sergei L. Bezrukov, Robert Elsässer:
The Spider Poset Is Macaulay. J. Comb. Theory A 90(1): 1-26 (2000) - [c5]Robert Elsässer, Burkhard Monien, Robert Preis:
Diffusive load balancing schemes on heterogeneous networks. SPAA 2000: 30-38 - [c4]Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich:
New Spectral Lower Bounds on the Bisection Width of Graphs. WG 2000: 23-34
1990 – 1999
- 1999
- [j1]Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder:
On k-partitioning of Hamming Graphs. Discret. Appl. Math. 95(1-3): 127-140 (1999) - [c3]Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder:
On Bounds for the k-Partitioning of Graphs. COCOON 1999: 154-163 - [c2]Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis:
Optimal and Alternating-Direction Load Balancing Schemes. Euro-Par 1999: 280-290 - [c1]Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer:
Optimal Cuts for Powers of the Petersen Graph. WG 1999: 228-239
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
