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

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 
LibreCat: /record/2043
DOI: 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.
LibreCat: /record/2213

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

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

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

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

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

Scheideler, C. (2005). Overlay networks for wireless ad hoc networks. In IMA Workshop on Wireless Communications.
LibreCat: /record/2212

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 
LibreCat: /record/2119
DOI: 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).
LibreCat: /record/2120

Riley, C., &; Scheideler, C. (2004). A Distributed Hash Table for Computational Grids. In IPDPS.
LibreCat: /record/2121

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

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

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

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

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).
LibreCat: /record/2126

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

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.
LibreCat: /record/19790

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 
LibreCat: /record/2128
DOI: 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.
LibreCat: /record/2129

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

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

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.
LibreCat: /record/2132

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

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

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

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

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

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

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 
LibreCat: /record/2139
DOI: 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.
LibreCat: /record/2140

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

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

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 
LibreCat: /record/2143
DOI: 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 
LibreCat: /record/2145
DOI: 10.1137/S0097539799353431

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

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).
LibreCat: /record/2147

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.
LibreCat: /record/2148

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

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.
LibreCat: /record/2150

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).
LibreCat: /record/2211

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 
LibreCat: /record/2151
DOI: 10.1007/s002240000123

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

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

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).
LibreCat: /record/2210

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

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

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

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

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.
LibreCat: /record/2175

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

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 
LibreCat: /record/2182
DOI: 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).
LibreCat: /record/2183

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

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.
LibreCat: /record/2186

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 
LibreCat: /record/2187
DOI: 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).
LibreCat: /record/2207

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).
LibreCat: /record/2208