The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robert Elsässer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder
    On Bounds for the k-Partitioning of Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:154-163 [Conf]
  2. Robert Elsässer, Burkhard Monien, Stefan Schamberger
    Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:640-651 [Conf]
  3. Robert Elsässer, Andreas Frommer, Burkhard Monien, Robert Preis
    Optimal and Alternating-Direction Load Balancing Schemes. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:280-290 [Conf]
  4. Robert Elsässer, Burkhard Monien, Günter Rote, Stefan Schamberger
    Toward Optimal Diffusion Matrices. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  5. Robert Elsässer, Thomas Sauerwald
    On the Runtime and Robustness of Randomized Broadcasting. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:349-358 [Conf]
  6. Robert Elsässer, Burkhard Monien, Stefan Schamberger
    Load Balancing in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:193-200 [Conf]
  7. Robert Elsässer
    Toward the Eigenvalue Power Law. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:351-362 [Conf]
  8. Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
    Agent-Based Information Handling in Large Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:586-598 [Conf]
  9. Robert Elsässer, Burkhard Monien
    Load balancing of unit size tokens and expansion properties of graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:266-273 [Conf]
  10. Robert Elsässer
    On the communication complexity of randomized broadcasting in random-like graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:148-157 [Conf]
  11. Robert Elsässer, Leszek Gasieniec
    Radio communication in random graphs: extended abstract. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:309-315 [Conf]
  12. Robert Elsässer, Thomas Lücking, Burkhard Monien
    New spectral bounds on k-partitioning of graphs. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:255-262 [Conf]
  13. Robert Elsässer, Burkhard Monien, Robert Preis
    Diffusive load balancing schemes on heterogeneous networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:30-38 [Conf]
  14. Robert Elsässer, Rastislav Kralovic, Burkhard Monien
    Scalable Sparse Topologies with Small Spectrum. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:218-229 [Conf]
  15. Robert Elsässer, Thomas Sauerwald
    Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:163-174 [Conf]
  16. Robert Elsässer
    On Randomized Broadcasting in Power Law Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:370-384 [Conf]
  17. Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer
    Optimal Cuts for Powers of the Petersen Graph. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:228-239 [Conf]
  18. Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
    New Spectral Lower Bounds on the Bisection Width of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:23-34 [Conf]
  19. Sergei L. Bezrukov, Robert Elsässer
    Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:9-20 [Conf]
  20. Robert Elsässer, Thomas Sauerwald
    On Randomized Broadcasting in Star Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2005, pp:307-318 [Conf]
  21. Robert Elsässer, Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien
    A Simple Graph-Theoretic Model for Selfish Restricted Scheduling. [Citation Graph (0, 0)][DBLP]
    WINE, 2005, pp:195-209 [Conf]
  22. Sergei L. Bezrukov, Robert Elsässer, Ulf-Peter Schroeder
    On k-partitioning of Hamming Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:127-140 [Journal]
  23. Robert Elsässer, Ulf Lorenz, Thomas Sauerwald
    Agent-based randomized broadcasting in large networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:2, pp:150-160 [Journal]
  24. Robert Elsässer, Leszek Gasieniec
    Radio communication in random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:3, pp:490-506 [Journal]
  25. Sergei L. Bezrukov, Robert Elsässer
    The Spider Poset Is Macaulay. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:90, n:1, pp:1-26 [Journal]
  26. Robert Elsässer, Thomas Lücking, Burkhard Monien
    On Spectral Bounds for the k-Partitioning of Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:5, pp:461-478 [Journal]
  27. Robert Elsässer, Burkhard Monien, Robert Preis
    Diffusion Schemes for Load Balancing on Heterogeneous Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:3, pp:305-320 [Journal]
  28. Robert Elsässer, Burkhard Monien, Robert Preis, Andreas Frommer
    Optimal Diffusion Schemes And Load Balancing On Product Graphs. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2004, v:14, n:1, pp:61-73 [Journal]
  29. Sergei L. Bezrukov, Robert Elsässer
    Edge-isoperimetric problems for cartesian powers of regular graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:3, pp:473-492 [Journal]
  30. Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich
    New spectral lower bounds on the bisection width of graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:155-174 [Journal]
  31. Robert Elsässer, Rastislav Kralovic, Burkhard Monien
    Sparse topologies with small spectrum size. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:3, pp:549-565 [Journal]

  32. Communication Complexity of Quasirandom Rumor Spreading. [Citation Graph (, )][DBLP]


  33. Tight Bounds for the Cover Time of Multiple Random Walks. [Citation Graph (, )][DBLP]


  34. Efficient Information Exchange in the Random Phone-Call Model. [Citation Graph (, )][DBLP]


  35. Randomised Broadcasting: Memory vs. Randomness. [Citation Graph (, )][DBLP]


  36. Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. [Citation Graph (, )][DBLP]


  37. Discrete load balancing is (almost) as easy as continuous load balancing. [Citation Graph (, )][DBLP]


  38. The power of memory in randomized broadcasting. [Citation Graph (, )][DBLP]


  39. Speeding Up Random Walks with Neighborhood Exploration. [Citation Graph (, )][DBLP]


  40. Efficient Broadcast on Random Geometric Graphs. [Citation Graph (, )][DBLP]


  41. Cover Time and Broadcast Time. [Citation Graph (, )][DBLP]


  42. On Radio Broadcasting in Random Geometric Graphs. [Citation Graph (, )][DBLP]


  43. Cover Time and Broadcast Time [Citation Graph (, )][DBLP]


  44. On randomized broadcasting in Star graphs. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002