Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn, 2011.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.”https://doi.org/10.1007/s00287-010-0470-2__Informatik Spektrum, no. 5 (2010): 468--474.https://doi.org/10.1007/s00287-010-0470-2 .

Gavoille, Cyril, Boaz Patt-Shamir, and Christian Scheideler. “Foreword.”https://doi.org/10.1007/s00224-010-9284-5__Theory of Computing Systems, no. 4 (2010): 809--810.https://doi.org/10.1007/s00224-010-9284-5 .

Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.”https://doi.org/10.1007/978-3-642-12200-2_27__In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, 6034:294--305. Lecture Notes in Computer Science. Springer, 2010.https://doi.org/10.1007/978-3-642-12200-2_27 .

Richa, Andrea W., Jin Zhang, Christian Scheideler, and Stefan Schmid. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.”https://doi.org/10.1145/1835698.1835726__In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, 114--115. ACM, 2010.https://doi.org/10.1145/1835698.1835726 .

Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.”https://doi.org/10.1007/978-3-642-15763-9_17__In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:179--193. Lecture Notes in Computer Science. Springer, 2010.https://doi.org/10.1007/978-3-642-15763-9_17 .

Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.”https://doi.org/10.1007/978-3-642-15763-9_50__In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, 6343:528--530. Lecture Notes in Computer Science. Springer, 2010.https://doi.org/10.1007/978-3-642-15763-9_50 .

Scheideler, Christian, ed. Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers. Lecture Notes in Computer Science, 2010.https://doi.org/10.1007/978-3-642-16988-5 .

D. Kleinberg, Robert, and Christian Scheideler. “Foreword.”https://doi.org/10.1007/s00224-009-9202-x__Theory Comput. Syst., no. 2 (2009): 187.https://doi.org/10.1007/s00224-009-9202-x .

Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.”https://doi.org/10.1007/s00224-008-9099-9__Theory Comput. Syst., no. 2 (2009): 234--260.https://doi.org/10.1007/s00224-008-9099-9 .

Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.”https://doi.org/10.1016/j.tcs.2008.10.003__Theor. Comput. Sci., no. 6–7 (2009): 453--466.https://doi.org/10.1016/j.tcs.2008.10.003 .

Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.”https://doi.org/10.1007/978-3-642-02930-1_47__In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, 5556:571--582. Lecture Notes in Computer Science. Springer, 2009.https://doi.org/10.1007/978-3-642-02930-1_47 .

Jacob, Riko, Stephan Ritscher, Christian Scheideler, and Stefan Schmid. “A Self-Stabilizing and Local Delaunay Graph Construction.”https://doi.org/10.1007/978-3-642-10631-6_78__In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, 5878:771--780. Lecture Notes in Computer Science. Springer, 2009.https://doi.org/10.1007/978-3-642-10631-6_78 .

Jacob, Riko, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.”https://doi.org/10.1145/1582716.1582741__In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 131--140, 2009.https://doi.org/10.1145/1582716.1582741 .

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, Andr\rquote ea W. Richa, and Paolo Santi. “An O(Log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model.”https://doi.org/10.1145/1374618.1374632__In Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, 91--100. ACM, 2008.https://doi.org/10.1145/1374618.1374632 .

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 .

Hegering, Heinz-Gerd, Axel Lehmann, Hans Jürgen Ohlbach, and Christian Scheideler, eds. INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland. Vol. 133. LNI, 2008.

Vöcking, Berthold, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, and Dorothea Wagner. Taschenbuch Der Algorithmen. EXamen.Press, 2008.

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 .

Aspnes, James, Christian Scheideler, Anish Arora, and Samuel Madden, eds. Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings. Vol. 4549. Lecture Notes in Computer Science, 2007.https://doi.org/10.1007/978-3-540-73090-3 .

B. Gibbons, Phillip, and Christian Scheideler, eds. SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007. ACM, 2007.

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.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.”https://doi.org/10.1007/s004930170007__Combinatorica 21, no. 1 (2001): 95--138.https://doi.org/10.1007/s004930170007 .

Awerbuch, Baruch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. “Simple Routing Strategies for Adversarial Systems.” In FOCS, 158--167. IEEE Computer Society, 2001.

Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “SIMLAB-A Simulation Environment for Storage Area Networks.” In PDP, 227--234. IEEE Computer Society, 2001.

Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” In SPAA, 38--47, 2001.

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.”https://doi.org/10.1007/s002240010006__Theory Comput. Syst. 33, no. 5/6 (2000): 337--391.https://doi.org/10.1007/s002240010006 .

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.”https://doi.org/10.1137/S0097539799353431__SIAM J. Comput. 30, no. 4 (2000): 1126--1155.https://doi.org/10.1137/S0097539799353431 .

Berenbrink, Petra, André Brinkmann, and Christian Scheideler. “Distributed Path Selection for Storage Networks.” In PDPTA, 2000.

Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” In SODA, 30--39, 2000.

Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms 17, no. 3–4 (2000): 213--237.

Brinkmann, André, Kay Salzwedel, and Christian Scheideler. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” In SPAA, 119--128, 2000.

Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” In STOC, 38--47. ACM, 2000.

Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” In 32nd ACM Symposium on Theory of Computing, 38–47, 2000.

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.”https://doi.org/10.1007/s002240000123__Theory Comput. Syst. 32, no. 3 (1999): 387--420.https://doi.org/10.1007/s002240000123 .

Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” In SODA, 112--121, 1999.

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Simple Competitive Request Scheduling Strategies.” In SPAA, 33--42, 1999.

Berenbrink, Petra, Marco Riedel, and Christian Scheideler. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” In International Workshop on Communication and Data Management in Large Networks (CDMLarge), 2–12, 1999.

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” In STOC, 215--224, 1999.

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”https://doi.org/10.1007/s002240000096__Theory Comput. Syst. 31, no. 4 (1998): 425--449.https://doi.org/10.1007/s002240000096 .

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” In SPAA, 259--268, 1998.

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” In STOC, 624--633, 1998.

Scheideler, Christian. Universal Routing Strategies for Interconnection Networks. Vol. 1390. Lecture Notes in Computer Science, 1998.https://doi.org/10.1007/BFb0052928 .

Bock, Stefan, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Optimal Wormhole Routing in the (n, d)-Torus.” In IPPS, 326--332. IEEE Computer Society, 1997.

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” In SPAA, 170--179, 1997.

Scheideler, Christian. Universal Routing Strategies. University of Paderborn, Germany, 1996.

Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”https://doi.org/10.1016/0304-3975(96)00032-1__Theor. Comput. Sci., no. 2 (1996): 245--281.https://doi.org/10.1016/0304-3975(96)00032-1 .

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In FOCS, 370--379, 1996.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In SOFSEM, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.

Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In STOC, 356--365. ACM, 1996.

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.”https://doi.org/10.1007/3-540-60313-1_154__In ESA, 341--354. Lecture Notes in Computer Science, 1995.https://doi.org/10.1007/3-540-60313-1_154 .

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In SPAA, 137--146, 1995.

Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In STACS, 267--278, 1995.