Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.
LibreCat: /record/1940

Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.”10.1007/978-3-540-89335-6_12__Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, vol. 5340, Springer, 2008, pp. 124--140, doi:10.1007/978-3-540-89335-6_12.
LibreCat: /record/1941
DOI: 10.1007/978-3-540-89335-6_12

Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?”10.1007/978-3-540-76394-9_22__Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236, doi:10.1007/978-3-540-76394-9_22.
LibreCat: /record/1942
DOI: 10.1007/978-3-540-76394-9_22

Hegering, Heinz-Gerd, et al., editors. INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland. Vol. 133, 2008.
LibreCat: /record/1943

Vöcking, Berthold, et al. Taschenbuch Der Algorithmen. 2008.
LibreCat: /record/1945

Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit-Switched Networks.”10.1137/S0895480102419743__SIAM J. Discrete Math., no. 1, 2007, pp. 141--157, doi:10.1137/S0895480102419743.
LibreCat: /record/2017
DOI: 10.1137/S0895480102419743

Onus, Melih, et al. “Linearization: Locally Self-Stabilizing Sorting in Graphs.”10.1137/1.9781611972870.10__Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, ALENEX 2007, New Orleans, Louisiana, USA, January 6, 2007, 2007, doi:10.1137/1.9781611972870.10.
LibreCat: /record/2020
DOI: 10.1137/1.9781611972870.10

Awerbuch, Baruch, and Christian Scheideler. “Towards Scalable and Robust Overlay Networks.” 6th International Workshop on Peer-To-Peer Systems, IPTPS 2007, Bellevue, WA, USA, February 26-27, 2007, 2007.
LibreCat: /record/2022

Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.”10.1145/1281100.1281178__Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, ACM, 2007, pp. 370--371, doi:10.1145/1281100.1281178.
LibreCat: /record/2023
DOI: 10.1145/1281100.1281178

Awerbuch, Baruch, and Christian Scheideler. “A Denial-of-Service Resistant DHT.”10.1007/978-3-540-75142-7_6__Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, vol. 4731, Springer, 2007, pp. 33--47, doi:10.1007/978-3-540-75142-7_6.
LibreCat: /record/2024
DOI: 10.1007/978-3-540-75142-7_6

Aspnes, James, et al., editors. 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, Phillip, and Christian Scheideler, editors. 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, Andrea, and Christian Scheideler. “Overlay Networks for Peer-to-Peer Networks.”10.1201/9781420010749.ch72__Handbook of Approximation Algorithms and Metaheuristics., 2007, doi:10.1201/9781420010749.ch72.
LibreCat: /record/2028
DOI: 10.1201/9781420010749.ch72

Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.
LibreCat: /record/2214

Aggarwal, Vinay, et al. “Can ISPs and P Users Cooperate for Improved Performance?”10.1145/1273445.1273449__ACM Computer Commucation Review, 2007, doi:10.1145/1273445.1273449.
LibreCat: /record/2209
DOI: 10.1145/1273445.1273449

Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.”10.1016/j.jalgor.2004.07.006__J. Algorithms, vol. 61, no. 1, 2006, pp. 20--44, doi:10.1016/j.jalgor.2004.07.006.
LibreCat: /record/2029
DOI: 10.1016/j.jalgor.2004.07.006

Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.”10.1109/TMC.2006.138__IEEE Trans. Mob. Comput., no. 9, 2006, pp. 1242--1254, doi:10.1109/TMC.2006.138.
LibreCat: /record/2110
DOI: 10.1109/TMC.2006.138

Kothapalli, Kishore, et al. “Distributed Coloring in O/Spl Tilde/(/Spl Radic/(Log n)) Bit Rounds.” IPDPS, 2006.
LibreCat: /record/2111

Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.” OPODIS, 2006, pp. 275--289.
LibreCat: /record/2112

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

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.
LibreCat: /record/2043
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.
LibreCat: /record/2213

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

Kothapalli, Kishore, and Christian Scheideler. “Supervised Peer-to-Peer Systems.” ISPAN, 2005, pp. 188--193.
LibreCat: /record/2115

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

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

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

Scheideler, Christian. “Overlay Networks for Wireless Ad Hoc Networks.” IMA Workshop on Wireless Communications, 2005.
LibreCat: /record/2212

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.
LibreCat: /record/2119
DOI: 10.1007/s00453-004-1086-1

Awerbuch, Baruch, and Christian Scheideler. “Group Spreading: A Protocol for Provably Secure Distributed Name Service.” ICALP, vol. 3142, 2004, pp. 183--195.
LibreCat: /record/2120

Riley, Chris, and Christian Scheideler. “A Distributed Hash Table for Computational Grids.” IPDPS, 2004.
LibreCat: /record/2121

Awerbuch, Baruch, and Christian Scheideler. “Robust Distributed Name Service.” IPTPS, vol. 3279, 2004, pp. 237--249.
LibreCat: /record/2122

Ateniese, Giuseppe, et al. “Survivable Monitoring in Dynamic Networks.” IWIA, 2004, pp. 33--47.
LibreCat: /record/2123

Awerbuch, Baruch, and Christian Scheideler. “The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments.” SODA, 2004, pp. 318--327.
LibreCat: /record/2124

Awerbuch, Baruch, and Christian Scheideler. “Consistent and Compact Data Management in Distributed Storage Systems.” SPAA, 2004, pp. 44--53.
LibreCat: /record/2125

Bhargava, Ankur, et al. “Pagoda: A Dynamic Overlay Network for Routing, Data Management, and Multicasting.” SPAA, 2004, pp. 170--179.
LibreCat: /record/2126

Bagchi, Amitabha, et al. “The Effect of Faults on Network Expansion.” SPAA, ACM, 2004, pp. 286--293.
LibreCat: /record/2127

Scheideler, Christian, et al. “Storage Management as Means to Cope with Exponential Information Growth.” Proceedings of SSGRR 2003, 2003.
LibreCat: /record/19790

Damerow, Valentina, et al. “Smoothed Motion Complexity.”10.1007/978-3-540-39658-1_17__ESA, vol. 2832, Springer, 2003, pp. 161--171, doi:10.1007/978-3-540-39658-1_17.
LibreCat: /record/2128
DOI: 10.1007/978-3-540-39658-1_17

Awerbuch, Baruch, et al. “Anycasting in Adversarial Systems: Routing and Admission Control.” ICALP, vol. 2719, Springer, 2003, pp. 1153--1168.
LibreCat: /record/2129

Awerbuch, Baruch, and Christian Scheideler. “Peer-to-Peer Systems for Prefix Search.” PODC, ACM, 2003, pp. 123--132.
LibreCat: /record/2130

Czumaj, Artur, et al. “Perfectly Balanced Allocation.” RANDOM-APPROX, vol. 2764, Springer, 2003, pp. 240--251.
LibreCat: /record/2131

Jia, Lujun, et al. “On Local Algorithms for Topology Control and Routing in Ad Hoc Networks.” SPAA, ACM, 2003, pp. 220--229.
LibreCat: /record/2132

Kothapalli, Kishore, and Christian Scheideler. “Information Gathering in Adversarial Systems: Lines and Cycles.” SPAA, ACM, 2003, pp. 333--342.
LibreCat: /record/2133

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling.”10.1007/s004930200018__Combinatorica, no. 3, 2002, pp. 361--399, doi:10.1007/s004930200018.
LibreCat: /record/2134
DOI: 10.1007/s004930200018

Kolman, Petr, and Christian Scheideler. “Improved Bounds for the Unsplittable Flow Problem.” SODA, ACM/SIAM, 2002, pp. 184--193.
LibreCat: /record/2135

Brinkmann, André, et al. “Compact, Adaptive Placement Schemes for Non-Uniform Requirements.” SPAA, 2002, pp. 53--62.
LibreCat: /record/2136

Bagchi, Amitabha, et al. “Algorithms for Fault-Tolerant Routing in Circuit Switched Networks.” SPAA, 2002, pp. 265--274.
LibreCat: /record/2137

Scheideler, Christian. “Models and Techniques for Communication in Dynamic Networks.” STACS, vol. 2285, Springer, 2002, pp. 27--49.
LibreCat: /record/2138

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols.”10.1007/s004930170007__Combinatorica, vol. 21, no. 1, 2001, pp. 95--138, doi:10.1007/s004930170007.
LibreCat: /record/2139
DOI: 10.1007/s004930170007