Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.” SPAA, 2006, pp. 318--327.

Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.”10.1007/s00224-006-1349-0__Theory Comput. Syst., no. 6, 2006, pp. 903--928, doi:10.1007/s00224-006-1349-0.

Scheideler, Christian. “Towards a Paradigm for Robust Distributed Algorithms and Data Structures.” 6th International HNI Symposium on New Trends in Parallel and Distributed Computing, 2006.

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

Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” ISPAN, 2005, pp. 188--193.

Onus, Melih, et al. “Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks.” ISPAN, 2005, pp. 346--351.

Kothapalli, Kishore, et al. “Constant Density Spanners for Wireless Ad-Hoc Networks.” SPAA, 2005, pp. 116--125.

Scheideler, Christian. “How to Spread Adversarial Nodes?: Rotate!” STOC, 2005, pp. 704--713.

Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA Workshop on Wireless Communications, 2005.

Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.”10.1007/s00453-004-1086-1__Algorithmica, no. 3, 2004, pp. 209--233, doi:10.1007/s00453-004-1086-1.