Meyer auf der Heide, F., &; Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In ESA (pp. 341--354).https://doi.org/10.1007/3-540-60313-1_154 

Meyer auf der Heide, F., &; Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In SPAA (pp. 137--146).

Meyer auf der Heide, F., Scheideler, C., &; Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In STACS (pp. 267--278).

Meyer auf der Heide, F., Scheideler, C., &; Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. Theor. Comput. Sci., (2), 245--281.https://doi.org/10.1016/0304-3975(96)00032-1 

Meyer auf der Heide, F., &; Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In FOCS (pp. 370--379).

Meyer auf der Heide, F., &; Scheideler, C. (1996). Communication in Parallel Systems. In SOFSEM (Vol. 1175, pp. 16--33). Springer.

Cypher, R., Meyer auf der Heide, F., Scheideler, C., &; Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In STOC (pp. 356--365). ACM.

Bock, S., Meyer auf der Heide, F., &; Scheideler, C. (1997). Optimal Wormhole Routing in the (n, d)-Torus. In IPPS (pp. 326--332). IEEE Computer Society.

Flammini, M., &; Scheideler, C. (1997). Simple, Efficient Routing Schemes for All-Optical Networks. In SPAA (pp. 170--179).

Scheideler, C., &; Vöcking, B. (1998). Universal Continuous Routing Strategies. Theory Comput. Syst., 31(4), 425--449.https://doi.org/10.1007/s002240000096 

Adler, M., &; Scheideler, C. (1998). Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract). In SPAA (pp. 259--268).

Feige, U., &; Scheideler, C. (1998). Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). In STOC (pp. 624--633).

Flammini, M., &; Scheideler, C. (1999). Simple, Efficient Routing Schemes for All-Optical Networks. Theory Comput. Syst., 32(3), 387--420.https://doi.org/10.1007/s002240000123 

Berenbrink, P., &; Scheideler, C. (1999). Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths. In SODA (pp. 112--121).

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Simple Competitive Request Scheduling Strategies. In SPAA (pp. 33--42).

Berenbrink, P., Riedel, M., &; Scheideler, C. (1999). Design of the PRESTO Multimedia Storage Network (Extended Abstract). In International Workshop on Communication and Data Management in Large Networks (CDMLarge) (pp. 2–12).

Scheideler, C., &; Vöcking, B. (1999). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. In STOC (pp. 215--224).

Adler, M., &; Scheideler, C. (2000). Efficient Communication Strategies for Ad Hoc Wireless Networks. Theory Comput. Syst., 33(5/6), 337--391.https://doi.org/10.1007/s002240010006 

Scheideler, C., &; Vöcking, B. (2000). From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols. SIAM J. Comput., 30(4), 1126--1155.https://doi.org/10.1137/S0097539799353431 

Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2000). Distributed Path Selection for Storage Networks. In PDPTA.

Czumaj, A., &; Scheideler, C. (2000). Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. In SODA (pp. 30--39).

Czumaj, A., &; Scheideler, C. (2000). Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. Random Struct. Algorithms, 17(3–4), 213--237.

Brinkmann, A., Salzwedel, K., &; Scheideler, C. (2000). Efficient, distributed data placement strategies for storage area networks (extended abstract). In SPAA (pp. 119--128).

Czumaj, A., &; Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). In STOC (pp. 38--47). ACM.

Czumaj, A., &; Scheideler, C. (2000). 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 (pp. 38–47).

Meyer auf der Heide, F., &; Scheideler, C. (2001). Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. Combinatorica, 21(1), 95--138.https://doi.org/10.1007/s004930170007 

Awerbuch, B., Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2001). Simple Routing Strategies for Adversarial Systems. In FOCS (pp. 158--167). IEEE Computer Society.

Berenbrink, P., Brinkmann, A., &; Scheideler, C. (2001). SIMLAB-A Simulation Environment for Storage Area Networks. In PDP (pp. 227--234). IEEE Computer Society.

Kolman, P., &; Scheideler, C. (2001). Simple on-line algorithms for the maximum disjoint paths problem. In SPAA (pp. 38--47).

Feige, U., &; Scheideler, C. (2002). Improved Bounds for Acyclic Job Shop Scheduling. Combinatorica, (3), 361--399.https://doi.org/10.1007/s004930200018 

Kolman, P., &; Scheideler, C. (2002). Improved bounds for the unsplittable flow problem. In SODA (pp. 184--193). ACM/SIAM.

Brinkmann, A., Salzwedel, K., &; Scheideler, C. (2002). Compact, adaptive placement schemes for non-uniform requirements. In SPAA (pp. 53--62).

Bagchi, A., Chaudhary, A., Scheideler, C., &; Kolman, P. (2002). Algorithms for fault-tolerant routing in circuit switched networks. In SPAA (pp. 265--274).

Scheideler, C. (2002). Models and Techniques for Communication in Dynamic Networks. In STACS (Vol. 2285, pp. 27--49). Springer.

Scheideler, C., Salzwedel, K., Meyer auf der Heide, F., Brinkmann, A., Vodisek, M., &; Rückert, U. (2003). Storage Management as Means to cope with Exponential Information Growth. In Proceedings of SSGRR 2003.

Damerow, V., Meyer auf der Heide, F., Räcke, H., Scheideler, C., &; Sohler, C. (2003). Smoothed Motion Complexity. In ESA (Vol. 2832, pp. 161--171). Springer.https://doi.org/10.1007/978-3-540-39658-1_17 

Awerbuch, B., Brinkmann, A., &; Scheideler, C. (2003). Anycasting in Adversarial Systems: Routing and Admission Control. In ICALP (Vol. 2719, pp. 1153--1168). Springer.

Awerbuch, B., &; Scheideler, C. (2003). Peer-to-peer systems for prefix search. In PODC (pp. 123--132). ACM.

Czumaj, A., Riley, C., &; Scheideler, C. (2003). Perfectly Balanced Allocation. In RANDOM-APPROX (Vol. 2764, pp. 240--251). Springer.

Jia, L., Rajaraman, R., &; Scheideler, C. (2003). On local algorithms for topology control and routing in ad hoc networks. In SPAA (pp. 220--229). ACM.

Kothapalli, K., &; Scheideler, C. (2003). Information gathering in adversarial systems: lines and cycles. In SPAA (pp. 333--342). ACM.

Kolman, P., &; Scheideler, C. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, (3), 209--233.https://doi.org/10.1007/s00453-004-1086-1 

Awerbuch, B., &; Scheideler, C. (2004). Group Spreading: A Protocol for Provably Secure Distributed Name Service. In ICALP (Vol. 3142, pp. 183--195).

Riley, C., &; Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In IPDPS.

Awerbuch, B., &; Scheideler, C. (2004). Robust Distributed Name Service. In IPTPS (Vol. 3279, pp. 237--249).

Ateniese, G., Riley, C., &; Scheideler, C. (2004). Survivable Monitoring in Dynamic Networks. In IWIA (pp. 33--47).

Awerbuch, B., &; Scheideler, C. (2004). The hyperring: a low-congestion deterministic data structure for distributed environments. In SODA (pp. 318--327).

Awerbuch, B., &; Scheideler, C. (2004). Consistent and compact data management in distributed storage systems. In SPAA (pp. 44--53).

Bhargava, A., Kothapalli, K., Riley, C., Scheideler, C., &; Thober, M. (2004). Pagoda: a dynamic overlay network for routing, data management, and multicasting. In SPAA (pp. 170--179).

Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &; Scheideler, C. (2004). The effect of faults on network expansion. In SPAA (pp. 286--293). ACM.

Korzeniowski, M., &; Scheideler, C. (2005). Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In ISPAN (pp. 182--187).

Kothapalli, K., &; Scheideler, C. (2005). Supervised Peer-to-Peer Systems. In ISPAN (pp. 188--193).

Onus, M., W. Richa, A., Kothapalli, K., &; Scheideler, C. (2005). Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In ISPAN (pp. 346--351).

Kothapalli, K., Scheideler, C., Onus, M., &; W. Richa, A. (2005). Constant density spanners for wireless ad-hoc networks. In SPAA (pp. 116--125).

Scheideler, C. (2005). How to spread adversarial nodes?: rotate! In STOC (pp. 704--713).

Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA Workshop on Wireless Communications.

Kolman, P., &; Scheideler, C. (2006). Improved bounds for the unsplittable flow problem. J. Algorithms, 61(1), 20--44.https://doi.org/10.1016/j.jalgor.2004.07.006 

Ateniese, G., Riley, C., &; Scheideler, C. (2006). Survivable Monitoring in Dynamic Networks. IEEE Trans. Mob. Comput., (9), 1242--1254.https://doi.org/10.1109/TMC.2006.138 

Kothapalli, K., Scheideler, C., Onus, M., &; Schindelhauer, C. (2006). Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds. In IPDPS.

Awerbuch, B., &; Scheideler, C. (2006). Robust Random Number Generation for Peer-to-Peer Systems. In OPODIS (pp. 275--289).

Awerbuch, B., &; Scheideler, C. (2006). Towards a scalable and robust DHT. In SPAA (pp. 318--327).

Bagchi, A., Bhargava, A., Chaudhary, A., Eppstein, D., &; Scheideler, C. (2006). The Effect of Faults on Network Expansion. Theory Comput. Syst., (6), 903--928.https://doi.org/10.1007/s00224-006-1349-0 

Scheideler, C. (2006). Towards a paradigm for robust distributed algorithms and data structures. In 6th International HNI Symposium on New Trends in Parallel and Distributed Computing.

Bagchi, A., Chaudhary, A., Scheideler, C., &; Kolman, P. (2007). Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks. SIAM J. Discrete Math., (1), 141--157.https://doi.org/10.1137/S0895480102419743 

Onus, M., W. Richa, A., &; Scheideler, C. (2007). 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.https://doi.org/10.1137/1.9781611972870.10 

Awerbuch, B., &; Scheideler, C. (2007). Towards Scalable and Robust Overlay Networks. In 6th International workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007.

Awerbuch, B., &; Scheideler, C. (2007). 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 (pp. 370--371). ACM.https://doi.org/10.1145/1281100.1281178 

Awerbuch, B., &; Scheideler, C. (2007). A Denial-of-Service Resistant DHT. In Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings (Vol. 4731, pp. 33--47). Springer.https://doi.org/10.1007/978-3-540-75142-7_6 

W. Richa, A., &; Scheideler, C. (2007). Overlay Networks for Peer-to-Peer Networks. In Handbook of Approximation Algorithms and Metaheuristics.https://doi.org/10.1201/9781420010749.ch72 

Brinkmann, A., Effert, S., Meyer auf der Heide, F., &; Scheideler, C. (2007). Dynamic and redundant data placement. IEEE International Conference on Distributed Computing Systems (ICDCS).

Aggarwal, V., Feldmann, A., &; Scheideler, C. (2007). Can ISPs and P users cooperate for improved performance? ACM Computer Commucation Review.https://doi.org/10.1145/1273445.1273449 

Scheideler, C. (2008). Algorithms for Overlay Networks. Bulletin of the EATCS, 130--152.

Awerbuch, B., W. Richa, A., &; Scheideler, C. (2008). 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 (pp. 45--54). ACM.https://doi.org/10.1145/1400751.1400759 

Mense, M., &; Scheideler, C. (2008). 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 (pp. 1135--1144). SIAM.

Clouser, T., Nesterenko, M., &; Scheideler, C. (2008). 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 (Vol. 5340, pp. 124--140). Springer.https://doi.org/10.1007/978-3-540-89335-6_12 

Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen? In Taschenbuch der Algorithmen (pp. 229--236). Springer.https://doi.org/10.1007/978-3-540-76394-9_22 

D. Kleinberg, R., &; Scheideler, C. (2009). Foreword. Theory Comput. Syst., (2), 187.https://doi.org/10.1007/s00224-009-9202-x 

Awerbuch, B., &; Scheideler, C. (2009). Towards a Scalable and Robust DHT. Theory Comput. Syst., (2), 234--260.https://doi.org/10.1007/s00224-008-9099-9 

Awerbuch, B., &; Scheideler, C. (2009). Robust random number generation for peer-to-peer systems. Theor. Comput. Sci., (6–7), 453--466.https://doi.org/10.1016/j.tcs.2008.10.003 

Scheideler, C., &; Schmid, S. (2009). A Distributed and Oblivious Heap. In Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II (Vol. 5556, pp. 571--582). Springer.https://doi.org/10.1007/978-3-642-02930-1_47 

Jacob, R., Ritscher, S., Scheideler, C., &; Schmid, S. (2009). A Self-stabilizing and Local Delaunay Graph Construction. In Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings (Vol. 5878, pp. 771--780). Springer.https://doi.org/10.1007/978-3-642-10631-6_78 

Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2009). A distributed polylogarithmic time algorithm for self-stabilizing skip graphs. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009 (pp. 131--140).https://doi.org/10.1145/1582716.1582741 

Baumgart, M., Scheideler, C., &; Schmid, S. (2009). 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 (pp. 300--309).https://doi.org/10.1145/1583991.1584064 

Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2009). 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 (Vol. 5873, pp. 781--782). Springer.https://doi.org/10.1007/978-3-642-05118-0_58 

Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &; Scheideler, C. (2009). Stabilizing Consensus with the Power of Two Choices. In Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009 (Vol. 09371). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany.https://doi.org/10.1145/1989493.1989516 

Meyer auf der Heide, F., &; Scheideler, C. (2010). Algorithmische Grundlagen verteilter Speichersysteme. Informatik Spektrum, (5), 468--474.https://doi.org/10.1007/s00287-010-0470-2 

Gavoille, C., Patt-Shamir, B., &; Scheideler, C. (2010). Foreword. Theory of Computing Systems, (4), 809--810.https://doi.org/10.1007/s00224-010-9284-5 

Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &; Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (Vol. 6034, pp. 294--305). Springer.https://doi.org/10.1007/978-3-642-12200-2_27 

Richa, A. W., Zhang, J., Scheideler, C., &; Schmid, S. (2010). Brief announcement: towards robust medium access in multi-hop networks. In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010 (pp. 114--115). ACM.https://doi.org/10.1145/1835698.1835726 

Richa, A. W., Scheideler, C., Schmid, S., &; Zhang, J. (2010). A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 179--193). Springer.https://doi.org/10.1007/978-3-642-15763-9_17 

Doerr, B., Ann Goldberg, L., Minder, L., Sauerwald, T., &; Scheideler, C. (2010). Brief Announcement: Stabilizing Consensus with the Power of Two Choices. In Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings (Vol. 6343, pp. 528--530). Springer.https://doi.org/10.1007/978-3-642-15763-9_50 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Competitive and Fair Medium Access Despite Reactive Jamming. In 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011 (pp. 507--516). IEEE Computer Society.https://doi.org/10.1109/ICDCS.2011.8 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, @MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011 (pp. 33--36). ACM.https://doi.org/10.1145/2030686.2030697 

W. Richa, A., Scheideler, C., Schmid, S., &; Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011 (p. 15). ACM.https://doi.org/10.1145/2107502.2107522 

Kniesburges, S., Koutsopoulos, A., &; Scheideler, C. (2011). Re-Chord: a self-stabilizing chord overlay network. In SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011) (pp. 235--244).https://doi.org/10.1145/1989493.1989527 

Kniesburges, S., &; Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings (Vol. 6552, pp. 170--181). Springer.https://doi.org/10.1007/978-3-642-19094-0_18 

Scheideler, C., &; Graffi, K. (2011). Programming for Distributed Computing: From Physical to Logical Networks. In Computer Science, The Hardware, Software and Heart of It (pp. 155--168). Springer.https://doi.org/10.1007/978-1-4614-1168-0_9 

Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information? In Algorithms Unplugged (pp. 223--229). Springer.https://doi.org/10.1007/978-3-642-15328-0_22 

Kolman, P., &; Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany (pp. 129--140).https://doi.org/10.4230/LIPIcs.STACS.2011.129 

Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., &; Scheideler, C. (2011). Stabilizing consensus with the power of two choices. In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 149–158).https://doi.org/10.1145/1989493.1989516