Copyright notice: The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


According to google scholar, the papers below have been cited in total more than 520 times. My g-index is 21 and my h-index is 14.

Articles in   Journals   Conferences   Others

2011

Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald
Faster Coupon Collecting via Replication with Applications in Gossiping
Proc. of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11), 2011, to appear

Robert Elsässer, Tobias Tscheuschner
Settling the Complexity of Local Max-Cut (Almost) Completely
Proc. of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11), 2011, to appear

Robert Elsässer, Thomas Sauerwald
Tight Bounds for the Cover Time of Multiple Random Walks
Theoretical Computer Science, 412, 2011, 2623-2641 (special issue for invited ICALP'09 papers)

2010

Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Communication Complexity of Quasirandom Rumor Spreading
Proc. of the 18th Annual European Symposium on Algorithms (ESA'10), 2010, 134-145

Robert Elsässer, Thomas Sauerwald
Discrete Load Balancing is (Almost) as Easy as Continuous Load Balancing
Proc. of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'10), 2010, 346-354

Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek Gasieniec
Efficient Information Exchange in the Random Phone-Call Model
Proc. of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10), 2010, 127-138

Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, Thomas Sauerwald
Speeding Up Random Walks with Neighbourhood Exploration
Proc. of the 21st Annual ACM/SIAM Symposium on Discrete Algorithms (SODA'10), 2010, 1422-1435

Milan Bradonjic, Robert Elsässer, Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer
Efficient Broadcast on Random Geometric Graphs
Proc. of the 21st Annual ACM/SIAM Symposium on Discrete Algorithms (SODA'10), 2010, 1412-1421

Robert Elsässer, Adrian Ogierman
Efficient Broadcasting in Random Power Law Networks
Proc. of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG'10), to appear

Petra Berenbrink, Robert Elsässer, Thomas Sauerwald
Randomised Broadcasting: Memory vs. Randomness
Proc. of the 9th Latin American Theoretical Informatics Symposium (LATIN'10), 2010, 306-319

Robert Elsässer, Andre Neubert
Toward Proper Random Graph Models for Real World Networks
Proc. of the 9th International Conference on Networks (ICN'10), 2010, 306-315

2009

Robert Elsässer, Thomas Sauerwald
Tight Bounds for the Cover Time of Multiple Random Walks
Proc. of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09), 2010, 415-426
[Abstract][Postscript/PDF]

Robert Elsässer, Thomas Sauerwald
Cover Time and Broadcast Time
Proc. of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09), 2008, 373-384

Robert Elsässer, Thomas Sauerwald
On the Runtime and Robustness of Randomized Broadcasting
Theoretical Computer Science, 410, 2009, 3414-3427

Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
On Randomized Broadcasting in Star Graphs
Discrete Applied Mathematics, 157, 2009, 126-139

2008

Robert Elsässer, Leszek Gąsieniec, Thomas Sauerwald
On Radio Broadcasting in Random Geometric Graphs
Proc. of the 22nd International Symposium on Distributed Computing (DISC'08), 2008, 212-226
[Abstract][Postscript/PDF]

Petra Berenbrink, Robert Elsässer, Tom Friedetzky
Efficient Randomised Broadcasting in Random Regular Networks with Applications in Peer-to-Peer Systems
Proc. of the 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'08), 2008, 155-164
[Abstract][Postscript/PDF]

Robert Elsässer, Thomas Sauerwald
The Power of Memory in Randomized Broadcasting
Proc. of the 19th Annual ACM/SIAM Symposium on Discrete Algorithms (SODA'08), 2008, 218-227
[Abstract][Postscript/PDF]

2007

Robert Elsässer, Thomas Sauerwald
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
Proc. of the 24st International Symposium on Theoretical Aspects of Computer Science (STACS'07), 2007, 163-174
[Abstract][Postscript/PDF]

Robert Elsässer , Ulf Lorenz, Thomas Sauerwald
Agent-Based Randomized Broadcasting in Large Networks
Discrete Applied Mathematics, 155, 2007, 150-160 (special issue for invited MFCS'04 papers)
[Abstract][Postscript/PDF]

2006

Robert Elsässer, Thomas Sauerwald
On the Runtime and Robustness of Randomized Broadcasting
Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC'06), 2006, 349-358
[Abstract][Postscript/PDF]

Robert Elsässer
On Randomized Broadcasting in Power Law Networks
Proc. of the 20th International Symposium on Distributed Computing (DISC'06), 2006, 370-384
[Abstract][Postscript/PDF]

Robert Elsässer
Toward the Eigenvalue Power Law
Proc. of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS'06), 2006, 351-362
[Abstract][Postscript/PDF]

Robert Elsässer
On the Communication Complexity of Randomized Broadcasting in Random-Like Graphs
Proc. of the 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'06), 2006, 148-157
[Abstract][Postscript/PDF]

Robert Elsässer , Leszek Gąsieniec
Radio Communication in Random Graphs
Journal of Computer and System Sciences, 72, 2006, 490-506
[Abstract][Postscript/PDF]

Robert Elsässer , Burkhard Monien, Stefan Schamberger
Distributing Unit Size Workload Packages in Heterogeneous Networks
Journal of Graph Algorithms and Applications, 10, 2006, 51-68 (special issue for invited ESA'04 papers)
[Abstract][Postscript/PDF]

2005

Robert Elsässer , Leszek Gąsieniec
Radio Communication in Random Graphs
Proc. of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2005), 2005, 309-315
[Abstract][Postscript/PDF]

Robert Elsässer , Thomas Sauerwald
On Randomized Broadcasting in Star Graphs
31th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2005), 2005, 307-318
[Abstract][Postscript/PDF]

Robert Elsässer , Martin Gairing , Thomas Lücking , Marios Mavronicolas , Burkhard Monien
A Simple Graph-Theoretic Model for Selfish Restricted Scheduling
Proc. of the 1st Workshop on Internet and Network Economics (WINE 2005), 2005, 195-209
[Abstract][Postscript/PDF]

2004

Robert Elsässer , Burkhard Monien, Stefan Schamberger
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks
Proc. of the 12th European Symposium on Algorithms (ESA'04), 2004, 640-651
[Abstract][Postscript/PDF]

Robert Elsässer , Ulf Lorenz, Thomas Sauerwald
Agent-Based Information Handling in Large Networks
Proc. of the 7th International Symposium on Mathematical Foundations of Computer Science (MFCS'04), 2004, 586-598
[Abstract][Postscript/PDF]

Robert Elsässer , Burkhard Monien, Stefan Schamberger
Load Balancing in Dynamic Networks
Proc. of the 7th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2004), 2004, 193-200
[Abstract][Postscript/PDF]

Robert Elsässer , Andreas Frommer , Burkhard Monien, Robert Preis
Optimal Diffusion Schemes and Load Balancing on Product Graphs
Parallel Processing Letters, 14, 2004, 61-73
[Abstract][Postscript/PDF]

Sergei L. Bezrukov, Robert Elsässer , Burkhard Monien, Robert Preis, J.-P. Tillich
New spectral lower bounds on the bisection width of graphs
Theoretical Computer Science, 320, 2004, 155-174
[Abstract][Postscript/PDF]

2003

Robert Elsässer , Rastislav Kralovic , Burkhard Monien
Sparse Topologies with Small Spectrum Size
Theoretical Computer Science, 307, 2003, 549-565
[Abstract][Postscript/PDF]

Robert Elsässer , Burkhard Monien
Diffusion Load Balancing in Static and Dynamic Networks
Proc. International Workshop on Ambient Intelligence Computing, 2003, 49-62
[Abstract][Postscript/PDF]

Robert Elsässer , Burkhard Monien
Load Balancing of Unit Size Tokens and Expansion Properties of Graphs
Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2003), 2003, 266-273
[Abstract][Postscript/PDF]

Sergei L. Bezrukov , Robert Elsässer
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs
Theoretical Computer Science, 307, 2003, 473-492
[Abstract][Postscript/PDF]

Robert Elsässer , Thomas Lücking , Burkhard Monien
On Spectral Bounds for the k-Partitioning of Graphs
Theory of Computing Systems, 36, 2003, 461-478, (special issue for invited SPAA'01 papers)
[Abstract][Postscript/PDF]

2002

Robert Elsässer , Burkhard Monien , Robert Preis
Diffusion Schemes for Load Balancing on Heterogeneous Networks
Theory of Computing Systems, 35, 2002, 305-320, (special issue for invited SPAA'00 papers)
[Abstract][Postscript/PDF]

Robert Elsässer
Spectral Methods for Efficient Load Balancing Strategies
German Informatics Society - Outstanding Dissertation
[Postscript/PDF]

Robert Elsässer , Burkhard Monien , Günter Rote , Stefan Schamberger
Toward Optimal Diffusion Matrices
Proc. of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002
[Abstract][Postscript/PDF]

2001

Sergei L. Bezrukov , Robert Elsässer
Edge Isoperimetric Problems for Cartesian Powers of Regular Graphs
27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001), 2001
[Abstract][Postscript/PDF]

Robert Elsässer , Thomas Lücking , Burkhard Monien
New Spectral Bounds on k-Partitioning of Graphs
Proc. of the Thirtheenth ACM Symposium on Parallel Algorithms and Architectures (SPAA 2001), 2001, 255-262
[Abstract][Postscript/PDF]

Robert Elsässer , Rastislav Kralovic , Burkhard Monien
Scalable Sparse Topologies with Small Spectrum
18th Annual Symposium on Theoretical Aspects of Computer Science,Proceedings (STACS 2001), 2001, 218-229
[Abstract][Postscript/PDF]

2000

Sergei L. Bezrukov , Robert Elsässer
The Spider Poset is Macaulay
Journal of Combinatorial Theory A, 90, 2000, 1-26
[Abstract][Postscript/PDF]

Sergei L. Bezrukov , Sajal Das , Robert Elsässer
An Edge Isoperimetric Problem for Powers of the Petersen Graph
Annals of Combinatorics, 4, 2000, 153-169
[Abstract][Postscript/PDF]

Sergei L. Bezrukov , Robert Elsässer , Burkhard Monien , Robert Preis , J.-P. Tillich
New spectral lower bounds on the bisection width of graphs
26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), Ulrik Brandes, Dorothea Wagner (eds.), Springer, LNCS 1928, Jun 2000, 23-34
[Abstract][Postscript/PDF]

Robert Elsässer , Burkhard Monien , Robert Preis
Diffusive Load Balancing Schemes on Heterogeneous Networks
12th ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000), 2000, 30-38
[Abstract][Postscript/PDF]

1999

Sergei L. Bezrukov , Sajal Das , Robert Elsässer
Optimal Cuts for Powers of the Petersen Graph
25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1999), LNCS 1665, 1999, 228-239
[Abstract][Postscript/PDF]

Sergei L. Bezrukov , Robert Elsässer , Ulf-Peter Schroeder
On k-partitioning of Hamming Graphs
Discrete Applied Mathematics, 95, 1999, 127-140
[Abstract][Postscript/PDF]

Sergei L. Bezrukov , Robert Elsässer , Ulf-Peter Schroeder
On Bounds for the k-Partitioning of Graphs
Conference on Computing and Combinatorics (COCOON 1999), 1999, 154-163
[Abstract][Postscript/PDF]

Robert Elsässer , Andreas Frommer , Burkhard Monien , Robert Preis
Optimal and Alternating-Direction Loadbalancing Schemes
Euro-Par 99, Parallel Processing, P. Amestoy et al. (eds.), LNCS 1685, 1999, 280-290
[Abstract][Postscript/PDF]