The SCEAS System
| |||||||

## Search the dblp DataBase
Thomas Sauerwald:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Robert Elsässer, Thomas Sauerwald
**On the Runtime and Robustness of Randomized Broadcasting.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:349-358 [Conf] - Henning Meyerhenke, Thomas Sauerwald
**Analyzing Disturbed Diffusion on Networks.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:429-438 [Conf] - 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] - 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] - Robert Elsässer, Thomas Sauerwald
**On Randomized Broadcasting in Star Graphs.**[Citation Graph (0, 0)][DBLP] WG, 2005, pp:307-318 [Conf] - 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] **Quasirandom Rumor Spreading: An Experimental Analysis.**[Citation Graph (, )][DBLP]**The Weighted Coupon Collector's Problem and Applications.**[Citation Graph (, )][DBLP]**The Cover Time of Deterministic Random Walks.**[Citation Graph (, )][DBLP]**Communication Complexity of Quasirandom Rumor Spreading.**[Citation Graph (, )][DBLP]**Tight Bounds for the Cover Time of Multiple Random Walks.**[Citation Graph (, )][DBLP]**Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness.**[Citation Graph (, )][DBLP]**Smoothed Analysis of Balancing Networks.**[Citation Graph (, )][DBLP]**A new diffusion-based multilevel algorithm for computing graph partitions of very high quality.**[Citation Graph (, )][DBLP]**On Mixing and Edge Expansion Properties in Randomized Broadcasting.**[Citation Graph (, )][DBLP]**Randomised Broadcasting: Memory vs. Randomness.**[Citation Graph (, )][DBLP]**The impact of randomization in smoothing networks.**[Citation Graph (, )][DBLP]**Discrete load balancing is (almost) as easy as continuous load balancing.**[Citation Graph (, )][DBLP]**Expansion and the cover time of parallel random walks.**[Citation Graph (, )][DBLP]**Self-stabilizing Cuts in Synchronous Networks.**[Citation Graph (, )][DBLP]**The power of memory in randomized broadcasting.**[Citation Graph (, )][DBLP]**Quasirandom rumor spreading.**[Citation Graph (, )][DBLP]**Speeding Up Random Walks with Neighborhood Exploration.**[Citation Graph (, )][DBLP]**Quasirandom Load Balancing.**[Citation Graph (, )][DBLP]**Efficient Broadcast on Random Geometric Graphs.**[Citation Graph (, )][DBLP]**A randomized, o(log w)-depth 2 smoothing network.**[Citation Graph (, )][DBLP]**Cover Time and Broadcast Time.**[Citation Graph (, )][DBLP]**Near-perfect load balancing by randomized rounding.**[Citation Graph (, )][DBLP]**On Radio Broadcasting in Random Geometric Graphs.**[Citation Graph (, )][DBLP]**Brief Announcement: Stabilizing Consensus with the Power of Two Choices.**[Citation Graph (, )][DBLP]**On Mixing and Edge Expansion Properties in Randomized Broadcasting.**[Citation Graph (, )][DBLP]**Cover Time and Broadcast Time**[Citation Graph (, )][DBLP]**Smoothed Analysis of Balancing Networks**[Citation Graph (, )][DBLP]**Quasirandom Load Balancing**[Citation Graph (, )][DBLP]**The Cover Time of Deterministic Random Walks**[Citation Graph (, )][DBLP]**On randomized broadcasting in Star graphs.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |