B. Awerbuch and C. Scheideler, “Towards a scalable and robust DHT,” in SPAA, 2006, pp. 318--327.

A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The Effect of Faults on Network Expansion,” Theory Comput. Syst., no. 6, pp. 903--928, 2006.

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

M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005, pp. 182--187.

K. Kothapalli and C. Scheideler, “Supervised Peer-to-Peer Systems,” in ISPAN, 2005, pp. 188--193.

M. Onus, A. W. Richa, K. Kothapalli, and C. Scheideler, “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks,” in ISPAN, 2005, pp. 346--351.

K. Kothapalli, C. Scheideler, M. Onus, and A. W. Richa, “Constant density spanners for wireless ad-hoc networks,” in SPAA, 2005, pp. 116--125.

C. Scheideler, “How to spread adversarial nodes?: rotate!,” in STOC, 2005, pp. 704--713.

C. Scheideler, “Overlay networks for wireless ad hoc networks,” in IMA Workshop on Wireless Communications, 2005.

P. Kolman and C. Scheideler, “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem,” Algorithmica, no. 3, pp. 209--233, 2004.

B. Awerbuch and C. Scheideler, “Group Spreading: A Protocol for Provably Secure Distributed Name Service,” in ICALP, 2004, vol. 3142, pp. 183--195.

C. Riley and C. Scheideler, “A Distributed Hash Table for Computational Grids,” in IPDPS, 2004.

B. Awerbuch and C. Scheideler, “Robust Distributed Name Service,” in IPTPS, 2004, vol. 3279, pp. 237--249.

G. Ateniese, C. Riley, and C. Scheideler, “Survivable Monitoring in Dynamic Networks,” in IWIA, 2004, pp. 33--47.

B. Awerbuch and C. Scheideler, “The hyperring: a low-congestion deterministic data structure for distributed environments,” in SODA, 2004, pp. 318--327.

B. Awerbuch and C. Scheideler, “Consistent and compact data management in distributed storage systems,” in SPAA, 2004, pp. 44--53.

A. Bhargava, K. Kothapalli, C. Riley, C. Scheideler, and M. Thober, “Pagoda: a dynamic overlay network for routing, data management, and multicasting,” in SPAA, 2004, pp. 170--179.

A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler, “The effect of faults on network expansion,” in SPAA, 2004, pp. 286--293.

C. Scheideler, K. Salzwedel, F. Meyer auf der Heide, A. Brinkmann, M. Vodisek, and U. Rückert, “Storage Management as Means to cope with Exponential Information Growth,” in Proceedings of SSGRR 2003, 2003.

V. Damerow, F. Meyer auf der Heide, H. Räcke, C. Scheideler, and C. Sohler, “Smoothed Motion Complexity,” in ESA, 2003, vol. 2832, pp. 161--171.