Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.”10.1007/978-3-642-12200-2_27__LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, vol. 6034, Springer, 2010, pp. 294--305, doi:10.1007/978-3-642-12200-2_27.
LibreCat: /record/1905
DOI: 10.1007/978-3-642-12200-2_27

Richa, Andrea W., et al. “Brief Announcement: Towards Robust Medium Access in Multi-Hop Networks.”10.1145/1835698.1835726__Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, ACM, 2010, pp. 114--115, doi:10.1145/1835698.1835726.
LibreCat: /record/1906
DOI: 10.1145/1835698.1835726

Richa, Andrea W., et al. “A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks.”10.1007/978-3-642-15763-9_17__Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer, 2010, pp. 179--193, doi:10.1007/978-3-642-15763-9_17.
LibreCat: /record/1907
DOI: 10.1007/978-3-642-15763-9_17

Doerr, Benjamin, et al. “Brief Announcement: Stabilizing Consensus with the Power of Two Choices.”10.1007/978-3-642-15763-9_50__Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings, vol. 6343, Springer, 2010, pp. 528--530, doi:10.1007/978-3-642-15763-9_50.
LibreCat: /record/1908
DOI: 10.1007/978-3-642-15763-9_50

D. Kleinberg, Robert, and Christian Scheideler. “Foreword.”10.1007/s00224-009-9202-x__Theory Comput. Syst., no. 2, 2009, p. 187, doi:10.1007/s00224-009-9202-x.
LibreCat: /record/1925
DOI: 10.1007/s00224-009-9202-x

Awerbuch, Baruch, and Christian Scheideler. “Towards a Scalable and Robust DHT.”10.1007/s00224-008-9099-9__Theory Comput. Syst., no. 2, 2009, pp. 234--260, doi:10.1007/s00224-008-9099-9.
LibreCat: /record/1927
DOI: 10.1007/s00224-008-9099-9

Awerbuch, Baruch, and Christian Scheideler. “Robust Random Number Generation for Peer-to-Peer Systems.”10.1016/j.tcs.2008.10.003__Theor. Comput. Sci., no. 6–7, 2009, pp. 453--466, doi:10.1016/j.tcs.2008.10.003.
LibreCat: /record/1928
DOI: 10.1016/j.tcs.2008.10.003

Scheideler, Christian, and Stefan Schmid. “A Distributed and Oblivious Heap.”10.1007/978-3-642-02930-1_47__Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, vol. 5556, Springer, 2009, pp. 571--582, doi:10.1007/978-3-642-02930-1_47.
LibreCat: /record/1929
DOI: 10.1007/978-3-642-02930-1_47

Jacob, Riko, et al. “A Self-Stabilizing and Local Delaunay Graph Construction.”10.1007/978-3-642-10631-6_78__Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, vol. 5878, Springer, 2009, pp. 771--780, doi:10.1007/978-3-642-10631-6_78.
LibreCat: /record/1930
DOI: 10.1007/978-3-642-10631-6_78

Jacob, Riko, et al. “A Distributed Polylogarithmic Time Algorithm for Self-Stabilizing Skip Graphs.”10.1145/1582716.1582741__Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, 2009, pp. 131--140, doi:10.1145/1582716.1582741.
LibreCat: /record/1932
DOI: 10.1145/1582716.1582741

Baumgart, Matthias, et al. “A DoS-Resilient Information System for Dynamic Data Management.”10.1145/1583991.1584064__SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, Calgary, Alberta, Canada, August 11-13, 2009, 2009, pp. 300--309, doi:10.1145/1583991.1584064.
LibreCat: /record/1933
DOI: 10.1145/1583991.1584064

Gall, Dominik, et al. “Brief Announcement: On the Time Complexity of Distributed Topological Self-Stabilization.”10.1007/978-3-642-05118-0_58__Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, vol. 5873, Springer, 2009, pp. 781--782, doi:10.1007/978-3-642-05118-0_58.
LibreCat: /record/1934
DOI: 10.1007/978-3-642-05118-0_58

Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”10.1145/1989493.1989516__Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009, vol. 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, 2009, doi:10.1145/1989493.1989516.
LibreCat: /record/1935
DOI: 10.1145/1989493.1989516

Scheideler, Christian. “Algorithms for Overlay Networks.” Bulletin of the EATCS, 2008, pp. 130--152.
LibreCat: /record/1937

Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.”10.1145/1400751.1400759__Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54, doi:10.1145/1400751.1400759.
LibreCat: /record/1938
DOI: 10.1145/1400751.1400759

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

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

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

Awerbuch, Baruch, et al. “Simple Routing Strategies for Adversarial Systems.” FOCS, IEEE Computer Society, 2001, pp. 158--167.
LibreCat: /record/2140

Berenbrink, Petra, et al. “SIMLAB-A Simulation Environment for Storage Area Networks.” PDP, IEEE Computer Society, 2001, pp. 227--234.
LibreCat: /record/2141

Kolman, Petr, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” SPAA, 2001, pp. 38--47.
LibreCat: /record/2142

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad Hoc Wireless Networks.”10.1007/s002240010006__Theory Comput. Syst., vol. 33, no. 5/6, 2000, pp. 337--391, doi:10.1007/s002240010006.
LibreCat: /record/2143
DOI: 10.1007/s002240010006

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.”10.1137/S0097539799353431__SIAM J. Comput., vol. 30, no. 4, 2000, pp. 1126--1155, doi:10.1137/S0097539799353431.
LibreCat: /record/2145
DOI: 10.1137/S0097539799353431

Berenbrink, Petra, et al. “Distributed Path Selection for Storage Networks.” PDPTA, 2000.
LibreCat: /record/2146

Czumaj, Artur, and Christian Scheideler. “Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” SODA, 2000, pp. 30--39.
LibreCat: /record/2147

Czumaj, Artur, and Christian Scheideler. “Coloring Nonuniform Hypergraphs: A New Algorithmic Approach to the General Lovász Local Lemma.” Random Struct. Algorithms, vol. 17, no. 3–4, 2000, pp. 213--237.
LibreCat: /record/2148

Brinkmann, André, et al. “Efficient, Distributed Data Placement Strategies for Storage Area Networks (Extended Abstract).” SPAA, 2000, pp. 119--128.
LibreCat: /record/2149

Czumaj, Artur, and Christian Scheideler. “A New Algorithm Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems (Extended Abstract).” STOC, ACM, 2000, pp. 38--47.
LibreCat: /record/2150

Czumaj, Artur, and Christian Scheideler. “A New Algorithmic Approach to the General Lovász Local Lemma with Applications to Scheduling and Satisfiability Problems .” 32nd ACM Symposium on Theory of Computing, 2000, pp. 38–47.
LibreCat: /record/2211

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.”10.1007/s002240000123__Theory Comput. Syst., vol. 32, no. 3, 1999, pp. 387--420, doi:10.1007/s002240000123.
LibreCat: /record/2151
DOI: 10.1007/s002240000123

Berenbrink, Petra, and Christian Scheideler. “Locally Efficient On-Line Strategies for Routing Packets Along Fixed Paths.” SODA, 1999, pp. 112--121.
LibreCat: /record/2164

Berenbrink, Petra, et al. “Simple Competitive Request Scheduling Strategies.” SPAA, 1999, pp. 33--42.
LibreCat: /record/2165

Berenbrink, Petra, et al. “Design of the PRESTO Multimedia Storage Network (Extended Abstract).” International Workshop on Communication and Data Management in Large Networks (CDMLarge), 1999, pp. 2–12.
LibreCat: /record/2210

Scheideler, Christian, and Berthold Vöcking. “From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols.” STOC, 1999, pp. 215--224.
LibreCat: /record/2166

Scheideler, Christian, and Berthold Vöcking. “Universal Continuous Routing Strategies.”10.1007/s002240000096__Theory Comput. Syst., vol. 31, no. 4, 1998, pp. 425--449, doi:10.1007/s002240000096.
LibreCat: /record/2168
DOI: 10.1007/s002240000096

Adler, Micah, and Christian Scheideler. “Efficient Communication Strategies for Ad-Hoc Wireless Networks (Extended Abstract).” SPAA, 1998, pp. 259--268.
LibreCat: /record/2169

Feige, Uriel, and Christian Scheideler. “Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract).” STOC, 1998, pp. 624--633.
LibreCat: /record/2170

Bock, Stefan, et al. “Optimal Wormhole Routing in the (n, d)-Torus.” IPPS, IEEE Computer Society, 1997, pp. 326--332.
LibreCat: /record/2175

Flammini, Michele, and Christian Scheideler. “Simple, Efficient Routing Schemes for All-Optical Networks.” SPAA, 1997, pp. 170--179.
LibreCat: /record/2179

Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.”10.1016/0304-3975(96)00032-1__Theor. Comput. Sci., no. 2, 1996, pp. 245--281, doi:10.1016/0304-3975(96)00032-1.
LibreCat: /record/2182
DOI: 10.1016/0304-3975(96)00032-1

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” FOCS, 1996, pp. 370--379.
LibreCat: /record/2183

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” SOFSEM, vol. 1175, Springer, 1996, pp. 16--33.
LibreCat: /record/2184

Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” STOC, ACM, 1996, pp. 356--365.
LibreCat: /record/2186

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.”10.1007/3-540-60313-1_154__ESA, 1995, pp. 341--354, doi:10.1007/3-540-60313-1_154.
LibreCat: /record/2187
DOI: 10.1007/3-540-60313-1_154

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” SPAA, 1995, pp. 137--146.
LibreCat: /record/2207

Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” STACS, 1995, pp. 267--278.
LibreCat: /record/2208