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

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 
LibreCat: /record/2023
DOI: 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 
LibreCat: /record/2024
DOI: 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 
LibreCat: /record/2028
DOI: 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).
LibreCat: /record/2214

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 
LibreCat: /record/2209
DOI: 10.1145/1273445.1273449

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 
LibreCat: /record/2029
DOI: 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 
LibreCat: /record/2110
DOI: 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.
LibreCat: /record/2111

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

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