Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings
J. Aspnes, C. Scheideler, A. Arora, S. Madden, eds., Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings, 2007.

SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007
P. B. Gibbons, C. Scheideler, eds., SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, June 9-11, 2007, ACM, 2007.

Overlay Networks for Peer-to-Peer Networks
A. W. Richa, C. Scheideler, in: Handbook of Approximation Algorithms and Metaheuristics., 2007.

Dynamic and redundant data placement
A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.

Can ISPs and P users cooperate for improved performance?
V. Aggarwal, A. Feldmann, C. Scheideler, ACM Computer Commucation Review (2007).

Improved bounds for the unsplittable flow problem
P. Kolman, C. Scheideler, J. Algorithms 61 (2006) 20--44.

Survivable Monitoring in Dynamic Networks
G. Ateniese, C. Riley, C. Scheideler, IEEE Trans. Mob. Comput. (2006) 1242--1254.

Distributed coloring in O/spl tilde/(/spl radic/(log n)) bit rounds
K. Kothapalli, C. Scheideler, M. Onus, C. Schindelhauer, in: IPDPS, 2006.

Robust Random Number Generation for Peer-to-Peer Systems
B. Awerbuch, C. Scheideler, in: OPODIS, 2006, pp. 275--289.

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

The Effect of Faults on Network Expansion
A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, C. Scheideler, Theory Comput. Syst. (2006) 903--928.

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

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

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

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

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

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

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

Simple On-Line Algorithms for the Maximum Disjoint Paths Problem
P. Kolman, C. Scheideler, Algorithmica (2004) 209--233.

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