Aspnes J, Scheideler C, Arora A, Madden S, eds. Distributed Computing in Sensor Systems, Third IEEE International Conference, DCOSS 2007, Santa Fe, NM, USA, June 18-20, 2007, Proceedings. Vol 4549.; 2007. doi:10.1007/978-3-540-73090-3
LibreCat: /record/2025
DOI: 10.1007/978-3-540-73090-3

B. Gibbons P, Scheideler C, 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.
LibreCat: /record/2027

W. Richa A, Scheideler C. Overlay Networks for Peer-to-Peer Networks. In: Handbook of Approximation Algorithms and Metaheuristics. ; 2007. doi:10.1201/9781420010749.ch72
LibreCat: /record/2028
DOI: 10.1201/9781420010749.ch72

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

Aggarwal V, Feldmann A, Scheideler C. Can ISPs and P users cooperate for improved performance? ACM Computer Commucation Review. 2007. doi:10.1145/1273445.1273449
LibreCat: /record/2209
DOI: 10.1145/1273445.1273449

Kolman P, Scheideler C. Improved bounds for the unsplittable flow problem. J Algorithms. 2006;61(1):20--44. doi:10.1016/j.jalgor.2004.07.006
LibreCat: /record/2029
DOI: 10.1016/j.jalgor.2004.07.006

Ateniese G, Riley C, Scheideler C. Survivable Monitoring in Dynamic Networks. IEEE Trans Mob Comput. 2006;(9):1242--1254. doi:10.1109/TMC.2006.138
LibreCat: /record/2110
DOI: 10.1109/TMC.2006.138

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

Awerbuch B, Scheideler C. Robust Random Number Generation for Peer-to-Peer Systems. In: OPODIS. Lecture Notes in Computer Science. ; 2006:275--289.
LibreCat: /record/2112

Awerbuch B, Scheideler C. Towards a scalable and robust DHT. In: SPAA. ; 2006:318--327.
LibreCat: /record/2113

Bagchi A, Bhargava A, Chaudhary A, Eppstein D, Scheideler C. The Effect of Faults on Network Expansion. Theory Comput Syst. 2006;(6):903--928. doi:10.1007/s00224-006-1349-0
LibreCat: /record/2043
DOI: 10.1007/s00224-006-1349-0

Scheideler C. Towards a paradigm for robust distributed algorithms and data structures. In: 6th International HNI Symposium on New Trends in Parallel and Distributed Computing. ; 2006.
LibreCat: /record/2213

Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In: ISPAN. ; 2005:182--187.
LibreCat: /record/2114

Kothapalli K, Scheideler C. Supervised Peer-to-Peer Systems. In: ISPAN. ; 2005:188--193.
LibreCat: /record/2115

Onus M, W. Richa A, Kothapalli K, Scheideler C. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In: ISPAN. ; 2005:346--351.
LibreCat: /record/2116

Kothapalli K, Scheideler C, Onus M, W. Richa A. Constant density spanners for wireless ad-hoc networks. In: SPAA. ; 2005:116--125.
LibreCat: /record/2117

Scheideler C. How to spread adversarial nodes?: rotate! In: STOC. ; 2005:704--713.
LibreCat: /record/2118

Scheideler C. Overlay networks for wireless ad hoc networks. In: IMA Workshop on Wireless Communications. ; 2005.
LibreCat: /record/2212

Kolman P, Scheideler C. Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica. 2004;(3):209--233. doi:10.1007/s00453-004-1086-1
LibreCat: /record/2119
DOI: 10.1007/s00453-004-1086-1

Awerbuch B, Scheideler C. Group Spreading: A Protocol for Provably Secure Distributed Name Service. In: ICALP. Vol 3142. Lecture Notes in Computer Science. ; 2004:183--195.
LibreCat: /record/2120