 | 2012 |
|---|
| 53 |       | Colin Cooper,
Robert Elsässer,
Hirotaka Ono,
Tomasz Radzik:
Coalescing random walks and voting on graphs
CoRR abs/1204.4106: (2012) |
| 2011 |
|---|
| 52 | | Robert Elsässer,
Tobias Tscheuschner:
Settling the Complexity of Local Max-Cut (Almost) Completely.
ICALP (1) 2011: 171-182 |
| 51 | | Petra Berenbrink,
Robert Elsässer,
Tom Friedetzky,
Lars Nagel,
Thomas Sauerwald:
Faster Coupon Collecting via Replication with Applications in Gossiping.
MFCS 2011: 72-83 |
| 50 | | 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) |
| 49 | | Robert Elsässer,
Thomas Sauerwald:
Tight bounds for the cover time of multiple random walks.
Theor. Comput. Sci. 412(24): 2623-2641 (2011) |
| 2010 |
|---|
| 48 | | Petra Berenbrink,
Robert Elsässer,
Thomas Sauerwald:
Communication Complexity of Quasirandom Rumor Spreading.
ESA (1) 2010: 134-145 |
| 47 | | Petra Berenbrink,
Jurek Czyzowicz,
Robert Elsässer,
Leszek Gasieniec:
Efficient Information Exchange in the Random Phone-Call Model.
ICALP (2) 2010: 127-138 |
| 46 | | Petra Berenbrink,
Robert Elsässer,
Thomas Sauerwald:
Randomised Broadcasting: Memory vs. Randomness.
LATIN 2010: 306-319 |
| 45 | | Robert Elsässer,
Thomas Sauerwald:
Discrete load balancing is (almost) as easy as continuous load balancing.
PODC 2010: 346-354 |
| 44 | | Milan Bradonjic,
Robert Elsässer,
Tobias Friedrich,
Thomas Sauerwald,
Alexandre Stauffer:
Efficient Broadcast on Random Geometric Graphs.
SODA 2010: 1412-1421 |
| 43 | | Petra Berenbrink,
Colin Cooper,
Robert Elsässer,
Tomasz Radzik,
Thomas Sauerwald:
Speeding Up Random Walks with Neighborhood Exploration.
SODA 2010: 1422-1435 |
| 42 | | Robert Elsässer,
Adrian Ogierman:
Efficient Broadcasting in Random Power Law Networks.
WG 2010: 279-291 |
| 2009 |
|---|
| 41 | | Robert Elsässer,
Thomas Sauerwald:
Tight Bounds for the Cover Time of Multiple Random Walks.
ICALP (1) 2009: 415-426 |
| 40 | | Robert Elsässer,
Thomas Sauerwald:
Cover Time and Broadcast Time.
STACS 2009: 373-384 |
| 39 | | Robert Elsässer,
Thomas Sauerwald:
Cover Time and Broadcast Time
CoRR abs/0902.1735: (2009) |
| 38 | | Robert Elsässer,
Ulf Lorenz,
Thomas Sauerwald:
On randomized broadcasting in Star graphs.
Discrete Applied Mathematics 157(1): 126-139 (2009) |
| 37 | | Robert Elsässer,
Thomas Sauerwald:
On the runtime and robustness of randomized broadcasting.
Theor. Comput. Sci. 410(36): 3414-3427 (2009) |
| 2008 |
|---|
| 36 | | Robert Elsässer,
Leszek Gasieniec,
Thomas Sauerwald:
On Radio Broadcasting in Random Geometric Graphs.
DISC 2008: 212-226 |
| 35 | | 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 |
| 34 | | Robert Elsässer,
Thomas Sauerwald:
The power of memory in randomized broadcasting.
SODA 2008: 218-227 |
| 2007 |
|---|
| 33 | | Robert Elsässer,
Thomas Sauerwald:
Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs.
STACS 2007: 163-174 |
| 32 | | Robert Elsässer,
Ulf Lorenz,
Thomas Sauerwald:
Agent-based randomized broadcasting in large networks.
Discrete Applied Mathematics 155(2): 150-160 (2007) |
| 2006 |
|---|
| 31 | | Robert Elsässer:
On Randomized Broadcasting in Power Law Networks.
DISC 2006: 370-384 |
| 30 | | Robert Elsässer,
Thomas Sauerwald:
On the Runtime and Robustness of Randomized Broadcasting.
ISAAC 2006: 349-358 |
| 29 | | Robert Elsässer:
Toward the Eigenvalue Power Law.
MFCS 2006: 351-362 |
| 28 | | Robert Elsässer:
On the communication complexity of randomized broadcasting in random-like graphs.
SPAA 2006: 148-157 |
| 27 | | Robert Elsässer,
Leszek Gasieniec:
Radio communication in random graphs.
J. Comput. Syst. Sci. 72(3): 490-506 (2006) |
| 26 | | Robert Elsässer,
Burkhard Monien,
Stefan Schamberger:
Distributing Unit Size Workload Packages in Heterogeneous Networks.
J. Graph Algorithms Appl. 10(1): 51-68 (2006) |
| 2005 |
|---|
| 25 | | Robert Elsässer,
Leszek Gasieniec:
Radio communication in random graphs: extended abstract.
SPAA 2005: 309-315 |
| 24 | | Robert Elsässer,
Thomas Sauerwald:
On Randomized Broadcasting in Star Graphs.
WG 2005: 307-318 |
| 23 | | 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 |
|---|
| 22 | | Robert Elsässer,
Burkhard Monien,
Stefan Schamberger:
Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks.
ESA 2004: 640-651 |
| 21 | | Robert Elsässer,
Burkhard Monien,
Stefan Schamberger:
Load Balancing in Dynamic Networks.
ISPAN 2004: 193-200 |
| 20 | | Robert Elsässer,
Ulf Lorenz,
Thomas Sauerwald:
Agent-Based Information Handling in Large Networks.
MFCS 2004: 586-598 |
| 19 | | Robert Elsässer,
Burkhard Monien,
Robert Preis,
Andreas Frommer:
Optimal Diffusion Schemes And Load Balancing On Product Graphs.
Parallel Processing Letters 14(1): 61-73 (2004) |
| 18 | | 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) |
| 2003 |
|---|
| 17 | | Robert Elsässer,
Burkhard Monien:
Load balancing of unit size tokens and expansion properties of graphs.
SPAA 2003: 266-273 |
| 16 | | Sergei L. Bezrukov,
Robert Elsässer:
Edge-isoperimetric problems for cartesian powers of regular graphs.
Theor. Comput. Sci. 307(3): 473-492 (2003) |
| 15 | | Robert Elsässer,
Rastislav Kralovic,
Burkhard Monien:
Sparse topologies with small spectrum size.
Theor. Comput. Sci. 307(3): 549-565 (2003) |
| 14 | | 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) |
| 2002 |
|---|
| 13 | | Robert Elsässer,
Burkhard Monien,
Günter Rote,
Stefan Schamberger:
Toward Optimal Diffusion Matrices.
IPDPS 2002 |
| 12 | | Robert Elsässer,
Burkhard Monien,
Robert Preis:
Diffusion Schemes for Load Balancing on Heterogeneous Networks.
Theory Comput. Syst. 35(3): 305-320 (2002) |
| 11 |  | Robert Elsässer:
Spectral methods for efficient load balancing strategies.
Universität Paderborn 2002: I-II, 1-121 |
| 2001 |
|---|
| 10 | | Robert Elsässer,
Thomas Lücking,
Burkhard Monien:
New spectral bounds on k-partitioning of graphs.
SPAA 2001: 255-262 |
| 9 | | Robert Elsässer,
Rastislav Kralovic,
Burkhard Monien:
Scalable Sparse Topologies with Small Spectrum.
STACS 2001: 218-229 |
| 8 | | Sergei L. Bezrukov,
Robert Elsässer:
Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs.
WG 2001: 9-20 |
| 2000 |
|---|
| 7 | | Robert Elsässer,
Burkhard Monien,
Robert Preis:
Diffusive load balancing schemes on heterogeneous networks.
SPAA 2000: 30-38 |
| 6 | | 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 |
| 5 | | Sergei L. Bezrukov,
Robert Elsässer:
The Spider Poset Is Macaulay.
J. Comb. Theory, Ser. A 90(1): 1-26 (2000) |
| 1999 |
|---|
| 4 | | Sergei L. Bezrukov,
Robert Elsässer,
Ulf-Peter Schroeder:
On Bounds for the k-Partitioning of Graphs.
COCOON 1999: 154-163 |
| 3 | | Robert Elsässer,
Andreas Frommer,
Burkhard Monien,
Robert Preis:
Optimal and Alternating-Direction Load Balancing Schemes.
Euro-Par 1999: 280-290 |
| 2 | | Sergei L. Bezrukov,
Sajal K. Das,
Robert Elsässer:
Optimal Cuts for Powers of the Petersen Graph.
WG 1999: 228-239 |
| 1 | | Sergei L. Bezrukov,
Robert Elsässer,
Ulf-Peter Schroeder:
On k-partitioning of Hamming Graphs.
Discrete Applied Mathematics 95(1-3): 127-140 (1999) |
Data released under the ODC-BY 1.0 license — See also our legal information page