Publications

Found 14 results
Author Title [ Type(Desc)] Year
Filters: Author is Thomas Sauerwald  [Clear All Filters]
Conference Paper
Bradonjic, M.., Elsässer R., Friedrich T., Sauerwald T., & Stauffer A. (2010).  Efficient Broadcast on Random Geometric Graphs. 1412-1421.
Friedrich, T., & Sauerwald T. (2009).  Near-Perfect Load Balancing by Randomized Rounding. 121-130.
Friedrich, T., Gairing M., & Sauerwald T. (2010).  Quasirandom Load Balancing. 1620-1629.
Doerr, B., Friedrich T., Künneman M.., & Sauerwald T. (2009).  Quasirandom Rumor Spreading: An Experimental Analysis. 145-153.
Doerr, B., Friedrich T., & Sauerwald T. (2009).  Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness. 366-377.
Mavronicolas, M., & Sauerwald T. (2009).  A Randomized, O(log w)-Depth 2-Smoothing Network. 178-187.
Friedrich, T., Sauerwald T., & Vilenchik D. (2009).  Smoothed Analysis of Balancing Networks. 472-483.
Berenbrink, P., Cooper C.., Elsässer R., Radzik T.., & Sauerwald T. (2010).  Speeding Up Random Walks with Neighborhood Exploration. 1422-1435.
Elsässer, R., & Sauerwald T. (2009).  Tight Bounds for the Cover Time of Multiple Random Walks. 415-426.
Berenbrink, P., & Sauerwald T. (2009).  The Weighted Coupon Collector's Problem and Applications. 449-458.
Journal Article
Sauerwald, T. (2010).  On Mixing and Edge Expansion Properties in Randomized Broadcasting. Algorithmica. 56(1), 51-88.
Elsässer, R., & Sauerwald T. (2009).  On the Runtime and Robustness of Randomized Broadcasting. Theoretical Computer Science. 410(36), 3414-3427.
Sauerwald, T., & Sudholt D. (2010).  A Self-Stabilizing Algorithm for Cut Problems in Synchronous Networks. Theoretical Computer Science. 411(14-15), 1599-1612.
Friedrich, T., Sauerwald T., & Vilenchik D. (2010).  Smoothed Analysis of Balancing Networks. In Random Structures and Algorithms. 39(1), 115-138.