Baumgart, Matthias, Christian Scheideler, and Stefan Schmid. “A DoS-Resilient Information System for Dynamic Data Management.”https://doi.org/10.1145/1583991.1584064__In SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 300--309, 2009.https://doi.org/10.1145/1583991.1584064 .

Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.”https://doi.org/10.1007/978-3-642-05118-0_58__In Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, 5873:781--782. Lecture Notes in Computer Science. Springer, 2009.https://doi.org/10.1007/978-3-642-05118-0_58 .

Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.”https://doi.org/10.1145/1989493.1989516__In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, Vol. 09371. Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009.https://doi.org/10.1145/1989493.1989516 .

Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, 130--152.

Awerbuch, Baruch, Andr\rquote ea W. Richa, and Christian Scheideler. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.”https://doi.org/10.1145/1400751.1400759__In Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, 45--54. ACM, 2008.https://doi.org/10.1145/1400751.1400759 .

Mense, Mario, and Christian 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, 1135--1144. SIAM, 2008.

Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List.”https://doi.org/10.1007/978-3-540-89335-6_12__In Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, 5340:124--140. Lecture Notes in Computer Science. Springer, 2008.https://doi.org/10.1007/978-3-540-89335-6_12 .

Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”https://doi.org/10.1007/978-3-540-76394-9_22__In Taschenbuch Der Algorithmen, 229--236. EXamen.Press. Springer, 2008.https://doi.org/10.1007/978-3-540-76394-9_22 .

Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.”https://doi.org/10.1137/S0895480102419743__SIAM J. Discrete Math., no. 1 (2007): 141--157.https://doi.org/10.1137/S0895480102419743 .

Onus, Melih, Andrea W. Richa, and Christian Scheideler. “Linearization: Locally Self-Stabilizing Sorting in Graphs.”https://doi.org/10.1137/1.9781611972870.10__In Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007.https://doi.org/10.1137/1.9781611972870.10 .

Awerbuch, Baruch, and Christian 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.

Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.”https://doi.org/10.1145/1281100.1281178__In Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, 370--371. ACM, 2007.https://doi.org/10.1145/1281100.1281178 .

Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.”https://doi.org/10.1007/978-3-540-75142-7_6__In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, 4731:33--47. Lecture Notes in Computer Science. Springer, 2007.https://doi.org/10.1007/978-3-540-75142-7_6 .

W. Richa, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.”https://doi.org/10.1201/9781420010749.ch72__In Handbook of Approximation Algorithms and Metaheuristics., 2007.https://doi.org/10.1201/9781420010749.ch72 .

Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Dynamic and Redundant Data Placement.” In IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.

Aggarwal, Vinay, Anja Feldmann, and Christian Scheideler. “Can ISPs and P Users Cooperate for Improved Performance?”https://doi.org/10.1145/1273445.1273449__ACM Computer Commucation Review, 2007.https://doi.org/10.1145/1273445.1273449 .

Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.”https://doi.org/10.1016/j.jalgor.2004.07.006__J. Algorithms 61, no. 1 (2006): 20--44.https://doi.org/10.1016/j.jalgor.2004.07.006 .

Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.”https://doi.org/10.1109/TMC.2006.138__IEEE Trans. Mob. Comput., no. 9 (2006): 1242--1254.https://doi.org/10.1109/TMC.2006.138 .

Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Christian Schindelhauer. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” In IPDPS, 2006.

Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” In OPODIS, 275--289. Lecture Notes in Computer Science, 2006.

Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” In SPAA, 318--327, 2006.

Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.”https://doi.org/10.1007/s00224-006-1349-0__Theory Comput. Syst., no. 6 (2006): 903--928.https://doi.org/10.1007/s00224-006-1349-0 .

Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” In 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.

Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” In ISPAN, 182--187, 2005.

Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” In ISPAN, 188--193, 2005.

Onus, Melih, Andrea W. Richa, Kishore Kothapalli, and Christian Scheideler. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” In ISPAN, 346--351, 2005.

Kothapalli, Kishore, Christian Scheideler, Melih Onus, and Andrea W. Richa. “Constant Density Spanners for Wireless Ad-Hoc Networks.” In SPAA, 116--125, 2005.

Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” In STOC, 704--713, 2005.

Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” In IMA Workshop on Wireless Communications, 2005.

Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.”https://doi.org/10.1007/s00453-004-1086-1__Algorithmica, no. 3 (2004): 209--233.https://doi.org/10.1007/s00453-004-1086-1 .

Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” In ICALP, 3142:183--195. Lecture Notes in Computer Science, 2004.

Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” In IPDPS, 2004.

Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” In IPTPS, 3279:237--249. Lecture Notes in Computer Science, 2004.

Ateniese, Giuseppe, Chris Riley, and Christian Scheideler. “Survivable Monitoring in Dynamic Networks.” In IWIA, 33--47, 2004.

Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” In SODA, 318--327, 2004.

Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” In SPAA, 44--53, 2004.

Bhargava, Ankur, Kishore Kothapalli, Chris Riley, Christian Scheideler, and Mark Thober. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” In SPAA, 170--179, 2004.

Bagchi, Amitabha, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, and Christian Scheideler. “The Effect of Faults on Network Expansion.” In SPAA, 286--293. ACM, 2004.

Scheideler, Christian, Kay Salzwedel, Friedhelm Meyer auf der Heide, André Brinkmann, Mario Vodisek, and Ulrich Rückert. “Storage Management as Means to Cope with Exponential Information Growth.” In Proceedings of SSGRR 2003, 2003.

Damerow, Valentina, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler. “Smoothed Motion Complexity.”https://doi.org/10.1007/978-3-540-39658-1_17__In ESA, 2832:161--171. Lecture Notes in Computer Science. Springer, 2003.https://doi.org/10.1007/978-3-540-39658-1_17 .

Awerbuch, Baruch, André Brinkmann, and Christian Scheideler. “Anycasting in Adversarial Systems: Routing and Admission Control.” In ICALP, 2719:1153--1168. Lecture Notes in Computer Science. Springer, 2003.

Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” In PODC, 123--132. ACM, 2003.

Czumaj, Artur, Chris Riley, and Christian Scheideler. “Perfectly Balanced Allocation.” In RANDOM-APPROX, 2764:240--251. Lecture Notes in Computer Science. Springer, 2003.

Jia, Lujun, Rajmohan Rajaraman, and Christian Scheideler. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” In SPAA, 220--229. ACM, 2003.

Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” In SPAA, 333--342. ACM, 2003.

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.”https://doi.org/10.1007/s004930200018__Combinatorica, no. 3 (2002): 361--399.https://doi.org/10.1007/s004930200018 .

Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” In SODA, 184--193. ACM/SIAM, 2002.

Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” In SPAA, 53--62, 2002.

Bagchi, Amitabha, Amitabh Chaudhary, Christian Scheideler, and Petr Kolman. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” In SPAA, 265--274, 2002.

Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” In STACS, 2285:27--49. Lecture Notes in Computer Science. Springer, 2002.