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.

B. Awerbuch, A. Brinkmann, and C. Scheideler, “Anycasting in Adversarial Systems: Routing and Admission Control,” in ICALP, 2003, vol. 2719, pp. 1153--1168.

B. Awerbuch and C. Scheideler, “Peer-to-peer systems for prefix search,” in PODC, 2003, pp. 123--132.

A. Czumaj, C. Riley, and C. Scheideler, “Perfectly Balanced Allocation,” in RANDOM-APPROX, 2003, vol. 2764, pp. 240--251.

L. Jia, R. Rajaraman, and C. Scheideler, “On local algorithms for topology control and routing in ad hoc networks,” in SPAA, 2003, pp. 220--229.

K. Kothapalli and C. Scheideler, “Information gathering in adversarial systems: lines and cycles,” in SPAA, 2003, pp. 333--342.

U. Feige and C. Scheideler, “Improved Bounds for Acyclic Job Shop Scheduling,” Combinatorica, no. 3, pp. 361--399, 2002.

P. Kolman and C. Scheideler, “Improved bounds for the unsplittable flow problem,” in SODA, 2002, pp. 184--193.

A. Brinkmann, K. Salzwedel, and C. Scheideler, “Compact, adaptive placement schemes for non-uniform requirements,” in SPAA, 2002, pp. 53--62.

A. Bagchi, A. Chaudhary, C. Scheideler, and P. Kolman, “Algorithms for fault-tolerant routing in circuit switched networks,” in SPAA, 2002, pp. 265--274.

C. Scheideler, “Models and Techniques for Communication in Dynamic Networks,” in STACS, 2002, vol. 2285, pp. 27--49.

F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols,” Combinatorica, vol. 21, no. 1, pp. 95--138, 2001.