Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS Attacks.”10.1145/2809806__Transactions on Parallel Computing, no. 3, ACM, 2015, pp. 18:1--18:33, doi:10.1145/2809806.
LibreCat: /record/284
DOI: 10.1145/2809806

Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.”10.4230/LIPIcs.OPODIS.2015.24__Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS), 2015, doi:10.4230/LIPIcs.OPODIS.2015.24.
LibreCat: /record/241
DOI: 10.4230/LIPIcs.OPODIS.2015.24

Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”10.1007/978-3-319-21741-3_14__Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2015, pp. 201–16, doi:10.1007/978-3-319-21741-3_14.
LibreCat: /record/242
DOI: 10.1007/978-3-319-21741-3_14

Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed Locally Self-Adjusting Binary Search Trees.”10.1007/978-3-319-15612-5_16__Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM), 2015, pp. 175--186, doi:10.1007/978-3-319-15612-5_16.
LibreCat: /record/243
DOI: 10.1007/978-3-319-15612-5_16

Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”10.1016/j.tcs.2014.11.027__Theoretical Computer Science, Elsevier, 2015, pp. 67–79, doi:10.1016/j.tcs.2014.11.027.
LibreCat: /record/327
DOI: 10.1016/j.tcs.2014.11.027

Koutsopoulos, Andreas. Dynamics and Efficiency in Topological Self-Stabilization. Universität Paderborn, 2015.
LibreCat: /record/304

Kniesburges, Sebastian. Distributed Data Structures and the Power of Topological Self-Stabilization. Universität Paderborn, 2015.
LibreCat: /record/305

Feldmann, Michael. Monotonic Searchability for Distributed Sorted Lists and De Bruijn Graphs. Universität Paderborn, 2015.
LibreCat: /record/278

Götte, Thorsten. Covering and Bridging Im Selbstorganisierenden Partikelsystem Amoebabot. Universität Paderborn, 2015.
LibreCat: /record/18003

Isenberg, Daniel. 3D-Nesting in Der SLM-Technologie. 2015.
LibreCat: /record/18004

Korfmacher, Christian. Implementierung Und Analyse von Cone-DHT. Universität Paderborn, 2015.
LibreCat: /record/18005

Sundermeier, Jannik. Implementierung Eines Selbststabilisierenden Verteilten Stacks. Universität Paderborn, 2015.
LibreCat: /record/18006

Knollmann, Till. Implementierung Einer Selbststabilisierenden Datenstruktur Für Das Längste Gemeinsame Präfix. Universität Paderborn, 2015.
LibreCat: /record/18024

Derakhshandeh, Zahra, et al. “Leader Election and Shape Formation with Self-Organizing Programmable Matter.”10.1007/978-3-319-21999-8_8__DNA Computing and Molecular Programming - 21st International Conference, DNA 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings, vol. 9211, 2015, pp. 117--132, doi:10.1007/978-3-319-21999-8_8.
LibreCat: /record/1850
DOI: 10.1007/978-3-319-21999-8_8

Derakhshandeh, Zahra, et al. “An Algorithmic Framework for Shape Formation Problems in Self-Organizing Particle Systems.”10.1145/2800795.2800829__Proceedings of the Second Annual International Conference on Nanoscale Computing and Communication, NANOCOM’ 15, Boston, MA, USA, September 21-22, 2015, ACM, 2015, pp. 21:1--21:2, doi:10.1145/2800795.2800829.
LibreCat: /record/1851
DOI: 10.1145/2800795.2800829

Derakhshandeh, Zahra, et al. “Brief Announcement: On the Feasibility of Leader Election and Shape Formation with Self-Organizing Programmable Matter.”10.1145/2767386.2767451__Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC 2015, Donostia-San Sebasti\rquote an, Spain, July 21 - 23, 2015, ACM, 2015, pp. 67--69, doi:10.1145/2767386.2767451.
LibreCat: /record/1852
DOI: 10.1145/2767386.2767451

Koutsopoulos, Andreas, et al. “Brief Announcement: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”10.1145/2755573.2755614__Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, ACM, 2015, pp. 77--79, doi:10.1145/2755573.2755614.
LibreCat: /record/1853
DOI: 10.1145/2755573.2755614

Scheideler, Christian, editor. Structural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Montserrat, Spain, July 14-16, 2015, Post-Proceedings. 2015, doi:10.1007/978-3-319-25258-2.
LibreCat: /record/1854
DOI: 10.1007/978-3-319-25258-2

Janiuk, Jens, et al. “Secure Distributed Data Structures for Peer-to-Peer-Based Social Networks.”10.1109/CTS.2014.6867595__Proceedings of the International Conference on Collaboration Technologies and Systems (CTS), 2014, pp. 396–405, doi:10.1109/CTS.2014.6867595.
LibreCat: /record/367
DOI: 10.1109/CTS.2014.6867595

Scheideler, Christian, et al. “RoBuSt: A Crash-Failure-Resistant Distributed Storage System.”10.1007/978-3-319-14472-6_8__Proceedings of the 18th International Conference on Principles of Distributed Systems (OPODIS), 2014, pp. 107--122, doi:10.1007/978-3-319-14472-6_8.
LibreCat: /record/371
DOI: 10.1007/978-3-319-14472-6_8

Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.”10.1007/s00224-012-9431-2__Theory of Computing Systems, no. 3, Springer, 2014, pp. 591–612, doi:10.1007/s00224-012-9431-2.
LibreCat: /record/378
DOI: 10.1007/s00224-012-9431-2

Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.”10.1145/2635818__Transactions on Algorithms, no. 4, ACM, 2014, doi:10.1145/2635818.
LibreCat: /record/387
DOI: 10.1145/2635818

Luo, Linghui. Ein Selbst-Stabilisierender Algorithmus Für Das Finite Sleep Problem in Skip+ Graphen. Universität Paderborn, 2014.
LibreCat: /record/18001

Hinnenthal, Kristian. Formbildung Selbstorganisierender Partikelsysteme. 2014.
LibreCat: /record/18002

Jacob, Riko, et al. “SKIP*: A Self-Stabilizing Skip Graph.”10.1145/2629695__J. ACM, no. 6, 2014, pp. 36:1--36:26, doi:10.1145/2629695.
LibreCat: /record/1858
DOI: 10.1145/2629695

Derakhshandeh, Zahra, et al. “Brief Announcement: Amoebot - a New Model for Programmable Matter.”10.1145/2612669.2612712__26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’14, Prague, Czech Republic - June 23 - 25, 2014, ACM, 2014, pp. 220--222, doi:10.1145/2612669.2612712.
LibreCat: /record/1863
DOI: 10.1145/2612669.2612712

Ogierman, Adrian, et al. “Competitive MAC under Adversarial SINR.”10.1109/INFOCOM.2014.6848224__Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014, pp. 2751--2759, doi:10.1109/INFOCOM.2014.6848224.
LibreCat: /record/446
DOI: 10.1109/INFOCOM.2014.6848224

Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management in the Cloud.”10.1007/978-3-319-09620-9_1__Proceedings of the 21st International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
LibreCat: /record/459
DOI: 10.1007/978-3-319-09620-9_1

Gall, Dominik, et al. “A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization.”10.1007/s00224-013-9504-x__Theory of Computing Systems, no. 1, Springer, 2014, pp. 110–35, doi:10.1007/s00224-013-9504-x.
LibreCat: /record/464
DOI: 10.1007/s00224-013-9504-x

Foreback, Dianne, et al. “On Stabilizing Departures in Overlay Networks.”10.1007/978-3-319-11764-5_4__Proceedings of the 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2014, pp. 48--62, doi:10.1007/978-3-319-11764-5_4.
LibreCat: /record/393
DOI: 10.1007/978-3-319-11764-5_4

Scheideler, Christian, et al. “Minimum Linear Arrangement of Series-Parallel Graphs.” Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 2014, pp. 168--180.
LibreCat: /record/397

Feldotto, Matthias, et al. “HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths.”10.1109/P2P.2014.6934300__Proceedings of the 14th IEEE International Conference on Peer-to-Peer Computing (P), 2014, pp. 1–10, doi:10.1109/P2P.2014.6934300.
LibreCat: /record/412
DOI: 10.1109/P2P.2014.6934300
arXiv: 1408.0395

W. Richa, Andr\rquote ea, et al. “Competitive Throughput in Multi-Hop Wireless Networks despite Adaptive Jamming.”10.1007/s00446-012-0180-x__Distributed Computing, no. 3, 2013, pp. 159--171, doi:10.1007/s00446-012-0180-x.
LibreCat: /record/1868
DOI: 10.1007/s00446-012-0180-x

Mohd Nor, Rizal, et al. “Corona:  A Stabilizing Deterministic Message-Passing Skip List.”10.1016/j.tcs.2012.08.029__Theor. Comput. Sci., 2013, pp. 119--129, doi:10.1016/j.tcs.2012.08.029.
LibreCat: /record/1870
DOI: 10.1016/j.tcs.2012.08.029

W. Richa, Andrea, et al. “An Efficient and Fair MAC Protocol Robust to Reactive Interference.”10.1109/TNET.2012.2210241__IEEE/ACM Trans. Netw., no. 3, 2013, pp. 760--771, doi:10.1109/TNET.2012.2210241.
LibreCat: /record/1871
DOI: 10.1109/TNET.2012.2210241

Blumentritt, Fritz. Cliquenbildung in Verteilten Systemen. Universität Paderborn, 2013.
LibreCat: /record/18000

Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.”10.1007/s00224-013-9454-3__Theory of Computing Systems, no. 2, Springer, 2013, pp. 341–63, doi:10.1007/s00224-013-9454-3.
LibreCat: /record/476
DOI: 10.1007/s00224-013-9454-3

Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P and Cloud Systems: The Wikipedia Case.”10.1109/ICC.2013.6655082__Proceedings of the International Conference on Communications (ICC’13), 2013, pp. 3444–49, doi:10.1109/ICC.2013.6655082.
LibreCat: /record/481
DOI: 10.1109/ICC.2013.6655082

Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.”10.1109/IPDPS.2013.40__Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406, doi:10.1109/IPDPS.2013.40.
LibreCat: /record/513
DOI: 10.1109/IPDPS.2013.40

Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.”10.1145/2486159.2486186__Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.
LibreCat: /record/519
DOI: 10.1145/2486159.2486186

Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.
LibreCat: /record/522

Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.”10.1109/ICCCN.2013.6614118__Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7, doi:10.1109/ICCCN.2013.6614118.
LibreCat: /record/541
DOI: 10.1109/ICCCN.2013.6614118

Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.”10.1007/978-3-642-41527-2_37__Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.
LibreCat: /record/542
DOI: 10.1007/978-3-642-41527-2_37

Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.”10.1109/HPCSim.2013.6641399__Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106, doi:10.1109/HPCSim.2013.6641399.
LibreCat: /record/544
DOI: 10.1109/HPCSim.2013.6641399

Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.”10.1109/NetSys.2013.11__Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34, doi:10.1109/NetSys.2013.11.
LibreCat: /record/546
DOI: 10.1109/NetSys.2013.11

Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.”10.1109/P2P.2013.6688720__Proceedings of the International Conference on Peer-to-Peer Computing (P’13), 2013, pp. 1–5, doi:10.1109/P2P.2013.6688720.
LibreCat: /record/548
DOI: 10.1109/P2P.2013.6688720

Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013.
LibreCat: /record/555

Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.”10.1109/NetSys.2013.9__Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9.
LibreCat: /record/559
DOI: 10.1109/NetSys.2013.9

Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.”10.1007/978-3-319-03578-9_14__Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14.
LibreCat: /record/564
DOI: 10.1007/978-3-319-03578-9_14

Dolev, Shlomi, and Christian Scheideler. “Editorial for Algorithmic Aspects of Wireless Sensor Networks.”10.1016/j.tcs.2012.07.012__Theor. Comput. Sci., 2012, p. 1, doi:10.1016/j.tcs.2012.07.012.
LibreCat: /record/1882
DOI: 10.1016/j.tcs.2012.07.012

Monien, Burkhard, and Christian Scheideler. “Selfish Distributed Optimization.”10.1007/978-3-642-32820-6_1__Euro-Par 2012 Parallel Processing - 18th International Conference, Euro-Par 2012, Rhodes Island, Greece, August 27-31, 2012. Proceedings, vol. 7484, Springer, 2012, pp. 1--2, doi:10.1007/978-3-642-32820-6_1.
LibreCat: /record/1884
DOI: 10.1007/978-3-642-32820-6_1

Meith, Frank Ingo. Jamming-Resistente MAC-Protokolle. 2012.
LibreCat: /record/17999

Jacob, Riko, et al. “Towards Higher-Dimensional Topological Self-Stabilization: A Distributed Algorithm for Delaunay Graphs.”10.1016/j.tcs.2012.07.029__Theoretical Computer Science, Elsevier, 2012, pp. 137–48, doi:10.1016/j.tcs.2012.07.029.
LibreCat: /record/570
DOI: 10.1016/j.tcs.2012.07.029

Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.”10.1016/j.tcs.2011.12.079__Theoretical Computer Science, Elsevier, 2012, pp. 18–35, doi:10.1016/j.tcs.2011.12.079.
LibreCat: /record/574
DOI: 10.1016/j.tcs.2011.12.079

Richa, Andrea W., and Christian Scheideler, editors. Stabilization, Safety, and Security of Distributed Systems. 2012, doi:10.1007/978-3-642-33536-5.
LibreCat: /record/577
DOI: 10.1007/978-3-642-33536-5

Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.”10.1145/2229163.2229174__Transactions on Algorithms, no. 3, ACM, 2012, p. 30, doi:10.1145/2229163.2229174.
LibreCat: /record/579
DOI: 10.1145/2229163.2229174

Drees, Maximilian, et al. “Self-Organizing Particle Systems.”10.1109/IPDPS.2012.116__Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–83, doi:10.1109/IPDPS.2012.116.
LibreCat: /record/581
DOI: 10.1109/IPDPS.2012.116

Strothmann, Thim Frederik. Self-Optimizing Binary Search Trees - A Game Theoretic Approach. Universität Paderborn, 2012.
LibreCat: /record/582

Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.”10.1145/2332432.2332488__Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300, doi:10.1145/2332432.2332488.
LibreCat: /record/623
DOI: 10.1145/2332432.2332488

Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.”10.1007/978-3-642-33651-5_47__Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.
LibreCat: /record/625
DOI: 10.1007/978-3-642-33651-5_47

Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.”10.1007/978-3-642-33651-5_45__Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.
LibreCat: /record/626
DOI: 10.1007/978-3-642-33651-5_45

Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.”10.1007/978-3-642-33996-7_7__Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83, doi:10.1007/978-3-642-33996-7_7.
LibreCat: /record/628
DOI: 10.1007/978-3-642-33996-7_7

Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.”10.1137/1.9781611973099.64__Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–10, doi:10.1137/1.9781611973099.64.
LibreCat: /record/632
DOI: 10.1137/1.9781611973099.64

Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.”10.1109/IPDPS.2012.115__Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271, doi:10.1109/IPDPS.2012.115.
LibreCat: /record/640
DOI: 10.1109/IPDPS.2012.115

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

Vöcking, Berthold, et al. Algorithms Unplugged. 2011, doi:10.1007/978-3-642-15328-0.
LibreCat: /record/1902
DOI: 10.1007/978-3-642-15328-0

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

Setzer, Alexander. Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk. Universität Paderborn, 2011.
LibreCat: /record/17997

Sascha, Brauer. Implementierung Eines Verfahrens Zur Lösung Des 3-Mincut-Problems. 2011.
LibreCat: /record/17998

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

Richa, Andrea W., and Christian Scheideler. “Self-Stabilizing DeBruijn Networks.”10.1007/978-3-642-24550-3_31__Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 416–30, doi:10.1007/978-3-642-24550-3_31.
LibreCat: /record/646
DOI: 10.1007/978-3-642-24550-3_31

Brandes, Philipp. Robust Distributed Computation in Dynamic Networks. Universität Paderborn, 2011.
LibreCat: /record/648

Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.”10.1109/P2P.2011.6038673__Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–55, doi:10.1109/P2P.2011.6038673.
LibreCat: /record/654
DOI: 10.1109/P2P.2011.6038673

Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.”10.1007/978-3-642-24550-3_27__Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370, doi:10.1007/978-3-642-24550-3_27.
LibreCat: /record/662
DOI: 10.1007/978-3-642-24550-3_27

Wette, Philip. Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord. Universität Paderborn, 2011.
LibreCat: /record/665

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

Scheideler, Christian, editor. Algorithms for Sensor Systems - 6th International Workshop on Algorithms for Sensor Systems, Wireless Ad Hoc Networks, and Autonomous Mobile Entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010, Revised Selected Papers. 2010, doi:10.1007/978-3-642-16988-5.
LibreCat: /record/1909
DOI: 10.1007/978-3-642-16988-5

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, et al. “An O(Log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model.”10.1145/1374618.1374632__Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, ACM, 2008, pp. 91--100, doi:10.1145/1374618.1374632.
LibreCat: /record/1926
DOI: 10.1145/1374618.1374632

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