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