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