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. “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

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

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

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

Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Algorithmische Grundlagen Verteilter Speichersysteme.”10.1007/s00287-010-0470-2__Informatik Spektrum, no. 5, 2010, pp. 468--474, doi:10.1007/s00287-010-0470-2.
LibreCat: /record/1903
DOI: 10.1007/s00287-010-0470-2

Gavoille, Cyril, et al. “Foreword.”10.1007/s00224-010-9284-5__Theory of Computing Systems, no. 4, 2010, pp. 809--810, doi:10.1007/s00224-010-9284-5.
LibreCat: /record/1904
DOI: 10.1007/s00224-010-9284-5

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

W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive Jamming.”10.1109/ICDCS.2011.8__2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516, doi:10.1109/ICDCS.2011.8.
LibreCat: /record/1891
DOI: 10.1109/ICDCS.2011.8

W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.”10.1145/2030686.2030697__Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, @MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36, doi:10.1145/2030686.2030697.
LibreCat: /record/1892
DOI: 10.1145/2030686.2030697

W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.”10.1145/2107502.2107522__Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15, doi:10.1145/2107502.2107522.
LibreCat: /record/1893
DOI: 10.1145/2107502.2107522

Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.”10.1145/1989493.1989527__SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244, doi:10.1145/1989493.1989527.
LibreCat: /record/1895
DOI: 10.1145/1989493.1989527

Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.”10.1007/978-3-642-19094-0_18__WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, vol. 6552, Springer, 2011, pp. 170--181, doi:10.1007/978-3-642-19094-0_18.
LibreCat: /record/1899
DOI: 10.1007/978-3-642-19094-0_18

Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.”10.1007/978-1-4614-1168-0_9__Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168, doi:10.1007/978-1-4614-1168-0_9.
LibreCat: /record/1900
DOI: 10.1007/978-1-4614-1168-0_9

Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?”10.1007/978-3-642-15328-0_22__Algorithms Unplugged, Springer, 2011, pp. 223--229, doi:10.1007/978-3-642-15328-0_22.
LibreCat: /record/1901
DOI: 10.1007/978-3-642-15328-0_22

Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.”10.4230/LIPIcs.STACS.2011.129__28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140, doi:10.4230/LIPIcs.STACS.2011.129.
LibreCat: /record/1924
DOI: 10.4230/LIPIcs.STACS.2011.129

Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.”10.1145/1989493.1989516__Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–58, doi:10.1145/1989493.1989516.
LibreCat: /record/645
DOI: 10.1145/1989493.1989516