M. Baumgart, C. Scheideler, and S. Schmid, “A DoS-resilient information system for dynamic data management,” in SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309.
LibreCat: /record/1933
DOI: 10.1145/1583991.1584064

D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Brief Announcement: On the Time Complexity of Distributed Topological Self-stabilization,” in Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 2009, vol. 5873, pp. 781--782.
LibreCat: /record/1934
DOI: 10.1007/978-3-642-05118-0_58

B. Doerr, L. Ann Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing Consensus with the Power of Two Choices,” in Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, 2009, vol. 09371.
LibreCat: /record/1935
DOI: 10.1145/1989493.1989516

C. Scheideler, “Algorithms for Overlay Networks,” Bulletin of the EATCS, pp. 130--152, 2008.
LibreCat: /record/1937

B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol for single-hop wireless networks,” in Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, 2008, pp. 45--54.
LibreCat: /record/1938
DOI: 10.1145/1400751.1400759

M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems,” in Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, 2008, pp. 1135--1144.
LibreCat: /record/1940

T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing Deterministic Skip List,” in Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, 2008, vol. 5340, pp. 124--140.
LibreCat: /record/1941
DOI: 10.1007/978-3-540-89335-6_12

C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,” in Taschenbuch der Algorithmen, Springer, 2008, pp. 229--236.
LibreCat: /record/1942
DOI: 10.1007/978-3-540-76394-9_22

A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks,” SIAM J. Discrete Math., no. 1, pp. 141--157, 2007.
LibreCat: /record/2017
DOI: 10.1137/S0895480102419743

M. Onus, A. W. Richa, and C. Scheideler, “Linearization: Locally Self-Stabilizing Sorting in Graphs,” in Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.
LibreCat: /record/2020
DOI: 10.1137/1.9781611972870.10

B. Awerbuch and C. Scheideler, “Towards Scalable and Robust Overlay Networks,” in 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
LibreCat: /record/2022

B. Awerbuch and C. Scheideler, “A denial-of-service resistant DHT,” in Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 2007, pp. 370--371.
LibreCat: /record/2023
DOI: 10.1145/1281100.1281178

B. Awerbuch and C. Scheideler, “A Denial-of-Service Resistant DHT,” in Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 2007, vol. 4731, pp. 33--47.
LibreCat: /record/2024
DOI: 10.1007/978-3-540-75142-7_6

A. W. Richa and C. Scheideler, “Overlay Networks for Peer-to-Peer Networks,” in Handbook of Approximation Algorithms and Metaheuristics., 2007.
LibreCat: /record/2028
DOI: 10.1201/9781420010749.ch72

A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007.
LibreCat: /record/2214

V. Aggarwal, A. Feldmann, and C. Scheideler, “Can ISPs and P users cooperate for improved performance?,” ACM Computer Commucation Review, 2007.
LibreCat: /record/2209
DOI: 10.1145/1273445.1273449

P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” J. Algorithms, vol. 61, no. 1, pp. 20--44, 2006.
LibreCat: /record/2029
DOI: 10.1016/j.jalgor.2004.07.006

G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” IEEE Trans. Mob. Comput., no. 9, pp. 1242--1254, 2006.
LibreCat: /record/2110
DOI: 10.1109/TMC.2006.138

K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, “Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds,” in IPDPS, 2006.
LibreCat: /record/2111

B. Awerbuch and C. Scheideler, “Robust Random Number Generation for Peer-to-Peer Systems,” in OPODIS, 2006, pp. 275--289.
LibreCat: /record/2112