[{"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":169564,"file_name":"577-SSS2012Richa-Scheideler.pdf","file_id":"1569","access_level":"closed","date_updated":"2018-03-21T13:09:19Z","creator":"florida","date_created":"2018-03-21T13:09:19Z"}],"status":"public","editor":[{"first_name":"Andrea W.","full_name":"Richa, Andrea W.","last_name":"Richa"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"abstract":[{"lang":"eng","text":"SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems."}],"type":"conference_editor","file_date_updated":"2018-03-21T13:09:19Z","ddc":["040"],"user_id":"15504","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"577","citation":{"apa":"Richa, A. W., &#38; Scheideler, C. (Eds.). (2012). <i>Stabilization, Safety, and Security of Distributed Systems</i>. Presented at the Stabilization, Safety, and Security of Distributed Systems (SSS), Paderborn, Germany. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>","bibtex":"@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security of Distributed Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>}, year={2012} }","mla":"Richa, Andrea W., and Christian Scheideler, editors. <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>.","short":"A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed Systems, 2012.","ieee":"A. W. Richa and C. Scheideler, Eds., <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012.","chicago":"Richa, Andrea W., and Christian Scheideler, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>.","ama":"Richa AW, Scheideler C, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>.; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>"},"year":"2012","has_accepted_license":"1","doi":"10.1007/978-3-642-33536-5","conference":{"location":"Paderborn, Germany","end_date":"2012-10-04","start_date":"2012-10-01","name":"Stabilization, Safety, and Security of Distributed Systems (SSS)"},"title":"Stabilization, Safety, and Security of Distributed Systems","date_created":"2017-10-17T12:42:44Z","date_updated":"2022-01-06T07:02:39Z"},{"publication":"Transactions on Algorithms","type":"journal_article","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":329282,"file_id":"1266","access_level":"closed","file_name":"579-a30-damerow.pdf","date_updated":"2018-03-15T09:04:58Z","creator":"florida","date_created":"2018-03-15T09:04:58Z"}],"abstract":[{"lang":"eng","text":"A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space."}],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"477","_id":"579","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-15T09:04:58Z","ddc":["040"],"issue":"3","has_accepted_license":"1","page":"30","citation":{"mla":"Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>, no. 3, ACM, 2012, p. 30, doi:<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>.","bibtex":"@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }","short":"V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.","apa":"Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., &#38; Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. <i>Transactions on Algorithms</i>, (3), 30. <a href=\"https://doi.org/10.1145/2229163.2229174\">https://doi.org/10.1145/2229163.2229174</a>","ama":"Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. <i>Transactions on Algorithms</i>. 2012;(3):30. doi:<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>","ieee":"V. Damerow <i>et al.</i>, “Smoothed analysis of left-to-right maxima with applications,” <i>Transactions on Algorithms</i>, no. 3, p. 30, 2012.","chicago":"Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>, no. 3 (2012): 30. <a href=\"https://doi.org/10.1145/2229163.2229174\">https://doi.org/10.1145/2229163.2229174</a>."},"year":"2012","date_created":"2017-10-17T12:42:45Z","author":[{"full_name":"Damerow, Valentina","last_name":"Damerow","first_name":"Valentina"},{"full_name":"Manthey, Bodo","last_name":"Manthey","first_name":"Bodo"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Harald","last_name":"Räcke","full_name":"Räcke, Harald"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"first_name":"Till","last_name":"Tantau","full_name":"Tantau, Till"}],"date_updated":"2022-01-06T07:02:41Z","publisher":"ACM","doi":"10.1145/2229163.2229174","title":"Smoothed analysis of left-to-right maxima with applications"},{"date_updated":"2022-01-06T07:02:42Z","date_created":"2017-10-17T12:42:45Z","author":[{"first_name":"Maximilian","last_name":"Drees","full_name":"Drees, Maximilian"},{"first_name":"Martina","last_name":"Hüllmann (married name: Eikel)","full_name":"Hüllmann (married name: Eikel), Martina"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"title":"Self-Organizing Particle Systems","doi":"10.1109/IPDPS.2012.116","has_accepted_license":"1","year":"2012","page":"1272-1283","citation":{"ama":"Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1272-1283. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>","chicago":"Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1272–83, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>.","ieee":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–1283.","mla":"Drees, Maximilian, et al. “Self-Organizing Particle Systems.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–83, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>.","short":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","bibtex":"@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }","apa":"Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., &#38; Scheideler, C. (2012). Self-Organizing Particle Systems. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1272–1283). <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>"},"_id":"581","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","ddc":["040"],"file_date_updated":"2018-03-15T08:39:33Z","language":[{"iso":"eng"}],"publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","abstract":[{"text":"Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-15T08:39:33Z","date_updated":"2018-03-15T08:39:33Z","access_level":"closed","file_name":"581-IPDPS2012-Scheideler_Huellmann.pdf","file_id":"1263","file_size":373131}]},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"department":[{"_id":"79"}],"user_id":"477","_id":"582","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"bibtex":"@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2012} }","short":"T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach, Universität Paderborn, 2012.","mla":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","apa":"Strothmann, T. F. (2012). <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn.","chicago":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ieee":"T. F. Strothmann, <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ama":"Strothmann TF. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn; 2012."},"year":"2012","title":"Self-Optimizing Binary Search Trees - A Game Theoretic Approach","date_created":"2017-10-17T12:42:45Z","author":[{"full_name":"Strothmann, Thim Frederik","id":"11319","last_name":"Strothmann","first_name":"Thim Frederik"}],"date_updated":"2022-01-06T07:02:42Z","publisher":"Universität Paderborn"},{"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T06:45:25Z","creator":"florida","date_updated":"2018-03-15T06:45:25Z","file_id":"1241","file_name":"623-PODC-2012_01.pdf","access_level":"closed","file_size":210382}],"abstract":[{"lang":"eng","text":"This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed."}],"publication":"Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)","type":"conference","file_date_updated":"2018-03-15T06:45:25Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"623","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"page":"291-300","citation":{"apa":"Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i> (pp. 291–300). <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>","mla":"Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300, doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>.","bibtex":"@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }","short":"A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.","ama":"Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>. ; 2012:291-300. doi:<a href=\"https://doi.org/10.1145/2332432.2332488\">10.1145/2332432.2332488</a>","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 2012, pp. 291–300.","chicago":"Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin  Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In <i>Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)</i>, 291–300, 2012. <a href=\"https://doi.org/10.1145/2332432.2332488\">https://doi.org/10.1145/2332432.2332488</a>."},"year":"2012","has_accepted_license":"1","doi":"10.1145/2332432.2332488","title":"Competitive and fair throughput for co-existing networks under adversarial interference","date_created":"2017-10-17T12:42:53Z","author":[{"first_name":"Andrea W.","last_name":"Richa","full_name":"Richa, Andrea W."},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"first_name":"Jin ","last_name":"Zhang","full_name":"Zhang, Jin "}],"date_updated":"2022-01-06T07:02:58Z"},{"department":[{"_id":"79"}],"user_id":"15504","series_title":"LNCS","_id":"625","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T06:44:09Z","ddc":["040"],"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","type":"conference","status":"public","file":[{"file_name":"625-disc12adjBAshort.pdf","access_level":"closed","file_id":"1240","file_size":717284,"creator":"florida","date_created":"2018-03-15T06:44:09Z","date_updated":"2018-03-15T06:44:09Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties."}],"date_created":"2017-10-17T12:42:53Z","author":[{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Chen","full_name":"Avin, Chen","last_name":"Avin"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Bernhard","full_name":"Häupler, Bernhard","last_name":"Häupler"},{"last_name":"Lotker","full_name":"Lotker, Zvi","first_name":"Zvi"}],"date_updated":"2022-01-06T07:02:58Z","doi":"10.1007/978-3-642-33651-5_47","title":"Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures","has_accepted_license":"1","page":"439-440","citation":{"chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 439–40. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>.","ieee":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–440.","ama":"Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:439-440. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>","apa":"Schmid, S., Avin, C., Scheideler, C., Häupler, B., &#38; Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 439–440). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">https://doi.org/10.1007/978-3-642-33651-5_47</a>","bibtex":"@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }","mla":"Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 439–40, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_47\">10.1007/978-3-642-33651-5_47</a>.","short":"S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440."},"year":"2012"},{"publication":"Proceedings of the 26th International Symposium on Distributed Computing (DISC)","type":"conference","abstract":[{"lang":"eng","text":"The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT)."}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":184095,"access_level":"closed","file_id":"1239","file_name":"626-Predecessor-Kniesburges_Scheideler.pdf","date_updated":"2018-03-15T06:42:40Z","creator":"florida","date_created":"2018-03-15T06:42:40Z"}],"_id":"626","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-15T06:42:40Z","has_accepted_license":"1","year":"2012","page":"435-436","citation":{"ama":"Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2012:435-436. doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>","ieee":"S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–436.","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 435–36. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>.","bibtex":"@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i>, 2012, pp. 435–36, doi:<a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">10.1007/978-3-642-33651-5_45</a>.","short":"S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.","apa":"Kniesburges, S., &#38; Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In <i>Proceedings of the 26th International Symposium on Distributed Computing (DISC)</i> (pp. 435–436). <a href=\"https://doi.org/10.1007/978-3-642-33651-5_45\">https://doi.org/10.1007/978-3-642-33651-5_45</a>"},"date_updated":"2022-01-06T07:02:59Z","date_created":"2017-10-17T12:42:54Z","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"title":"Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems","doi":"10.1007/978-3-642-33651-5_45"},{"year":"2012","page":"72--83","citation":{"apa":"Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., &#38; Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 72--83). <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>","short":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.","mla":"Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83, doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>.","bibtex":"@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83}, collection={LNCS} }","ama":"Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2012:72--83. doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">10.1007/978-3-642-33996-7_7</a>","ieee":"A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 72--83.","chicago":"Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 72--83. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33996-7_7\">https://doi.org/10.1007/978-3-642-33996-7_7</a>."},"has_accepted_license":"1","title":"Basic Network Creation Games with Communication Interests","doi":"10.1007/978-3-642-33996-7_7","date_updated":"2022-01-06T07:02:59Z","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"last_name":"Huellmann (married name: Eikel)","full_name":"Huellmann (married name: Eikel), Martina","first_name":"Martina"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"full_name":"Setzer, Alexander","id":"11108","last_name":"Setzer","first_name":"Alexander"}],"date_created":"2017-10-17T12:42:54Z","abstract":[{"text":"Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers.","lang":"eng"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1238","access_level":"closed","file_name":"628-FULL_paper_bncs_with_interests.pdf","file_size":300591,"date_created":"2018-03-15T06:42:01Z","creator":"florida","date_updated":"2018-03-15T06:42:01Z"}],"publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","type":"conference","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T06:42:01Z","_id":"628","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"},{"_id":"63"}],"series_title":"LNCS","user_id":"477"},{"file_date_updated":"2018-03-15T06:35:58Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"632","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","file":[{"file_size":220213,"access_level":"closed","file_name":"632-SODA2012-Scheideler_01.pdf","file_id":"1234","date_updated":"2018-03-15T06:35:58Z","creator":"florida","date_created":"2018-03-15T06:35:58Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems."}],"publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","type":"conference","doi":"10.1137/1.9781611973099.64","title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-10-17T12:42:55Z","date_updated":"2022-01-06T07:03:01Z","page":"800-810","citation":{"chicago":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 800–810, 2012. <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>.","ieee":"P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–810.","ama":"Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2012:800-810. doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>","bibtex":"@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }","mla":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–10, doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>.","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","apa":"Kolman, P., &#38; Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i> (pp. 800–810). <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>"},"year":"2012","has_accepted_license":"1"},{"page":"1261--1271","citation":{"short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }","mla":"Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1261--1271). <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1261--1271, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process for Small-World Networks. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1261--1271. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>"},"year":"2012","has_accepted_license":"1","doi":"10.1109/IPDPS.2012.115","title":"A Self-Stabilization Process for Small-World Networks","date_created":"2017-10-17T12:42:56Z","author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T07:03:04Z","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":210176,"file_id":"1230","access_level":"closed","file_name":"640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf","date_updated":"2018-03-14T14:13:13Z","date_created":"2018-03-14T14:13:13Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network."}],"publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","file_date_updated":"2018-03-14T14:13:13Z","ddc":["040"],"department":[{"_id":"79"}],"user_id":"15504","_id":"640","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"title":"Competitive and Fair Medium Access Despite Reactive Jamming","doi":"10.1109/ICDCS.2011.8","date_updated":"2022-01-06T06:53:54Z","publisher":"IEEE Computer Society","date_created":"2018-03-28T07:08:13Z","author":[{"first_name":"Andrea","last_name":"W. Richa","full_name":"W. Richa, Andrea"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"year":"2011","page":"507--516","citation":{"ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive and Fair Medium Access Despite Reactive Jamming. In: <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i>. IEEE Computer Society; 2011:507--516. doi:<a href=\"https://doi.org/10.1109/ICDCS.2011.8\">10.1109/ICDCS.2011.8</a>","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair Medium Access Despite Reactive Jamming,” in <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i>, 2011, pp. 507--516.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Medium Access Despite Reactive Jamming.” In <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i>, 507--516. IEEE Computer Society, 2011. <a href=\"https://doi.org/10.1109/ICDCS.2011.8\">https://doi.org/10.1109/ICDCS.2011.8</a>.","apa":"W. Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2011). Competitive and Fair Medium Access Despite Reactive Jamming. In <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i> (pp. 507--516). IEEE Computer Society. <a href=\"https://doi.org/10.1109/ICDCS.2011.8\">https://doi.org/10.1109/ICDCS.2011.8</a>","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Competitive and Fair Medium Access Despite Reactive Jamming}, DOI={<a href=\"https://doi.org/10.1109/ICDCS.2011.8\">10.1109/ICDCS.2011.8</a>}, booktitle={2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011}, publisher={IEEE Computer Society}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={507--516} }","mla":"W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive Jamming.” <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i>, IEEE Computer Society, 2011, pp. 507--516, doi:<a href=\"https://doi.org/10.1109/ICDCS.2011.8\">10.1109/ICDCS.2011.8</a>.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516."},"publication_identifier":{"isbn":["978-0-7695-4364-2"]},"_id":"1891","department":[{"_id":"79"}],"user_id":"15504","status":"public","publication":"2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011","type":"conference"},{"doi":"10.1145/2030686.2030697","title":"Towards jamming-resistant and competitive medium access in the SINR model","date_created":"2018-03-28T07:09:07Z","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Jin","last_name":"Zhang","full_name":"Zhang, Jin"}],"date_updated":"2022-01-06T06:53:54Z","publisher":"ACM","citation":{"ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant and competitive medium access in the SINR model,” in <i>Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i>, 2011, pp. 33--36.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” In <i>Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i>, 33--36. ACM, 2011. <a href=\"https://doi.org/10.1145/2030686.2030697\">https://doi.org/10.1145/2030686.2030697</a>.","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Towards jamming-resistant and competitive medium access in the SINR model. In: <i>Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i>. ACM; 2011:33--36. doi:<a href=\"https://doi.org/10.1145/2030686.2030697\">10.1145/2030686.2030697</a>","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36.","mla":"W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” <i>Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i>, ACM, 2011, pp. 33--36, doi:<a href=\"https://doi.org/10.1145/2030686.2030697\">10.1145/2030686.2030697</a>.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant and competitive medium access in the SINR model}, DOI={<a href=\"https://doi.org/10.1145/2030686.2030697\">10.1145/2030686.2030697</a>}, booktitle={Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }","apa":"W. Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In <i>Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i> (pp. 33--36). ACM. <a href=\"https://doi.org/10.1145/2030686.2030697\">https://doi.org/10.1145/2030686.2030697</a>"},"page":"33--36","year":"2011","publication_identifier":{"isbn":["978-1-4503-0868-7"]},"user_id":"15504","department":[{"_id":"79"}],"_id":"1892","status":"public","type":"conference","publication":"Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011"},{"date_updated":"2022-01-06T06:53:54Z","publisher":"ACM","date_created":"2018-03-28T07:09:54Z","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"last_name":"Schmid","full_name":"Schmid, Stefan","first_name":"Stefan"},{"last_name":"Zhang","full_name":"Zhang, Jin","first_name":"Jin"}],"title":"Self-stabilizing leader election for single-hop wireless networks despite jamming","doi":"10.1145/2107502.2107522","publication_identifier":{"isbn":["978-1-4503-0722-2"]},"year":"2011","citation":{"ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Self-stabilizing leader election for single-hop wireless networks despite jamming. In: <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i>. ACM; 2011:15. doi:<a href=\"https://doi.org/10.1145/2107502.2107522\">10.1145/2107502.2107522</a>","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader election for single-hop wireless networks despite jamming,” in <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i>, 2011, p. 15.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” In <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i>, 15. ACM, 2011. <a href=\"https://doi.org/10.1145/2107502.2107522\">https://doi.org/10.1145/2107502.2107522</a>.","apa":"W. Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i> (p. 15). ACM. <a href=\"https://doi.org/10.1145/2107502.2107522\">https://doi.org/10.1145/2107502.2107522</a>","mla":"W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i>, ACM, 2011, p. 15, doi:<a href=\"https://doi.org/10.1145/2107502.2107522\">10.1145/2107502.2107522</a>.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing leader election for single-hop wireless networks despite jamming}, DOI={<a href=\"https://doi.org/10.1145/2107502.2107522\">10.1145/2107502.2107522</a>}, booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={15} }","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 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."},"page":"15","_id":"1893","user_id":"15504","department":[{"_id":"79"}],"type":"conference","publication":"Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011","status":"public"},{"type":"conference","publication":"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)","status":"public","_id":"1895","user_id":"15504","department":[{"_id":"79"}],"publication_identifier":{"isbn":["978-1-4503-0743-7"]},"year":"2011","citation":{"ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: a self-stabilizing chord overlay network. In: <i>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)</i>. ; 2011:235--244. doi:<a href=\"https://doi.org/10.1145/1989493.1989527\">10.1145/1989493.1989527</a>","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing chord overlay network,” in <i>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)</i>, 2011, pp. 235--244.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” In <i>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)</i>, 235--244, 2011. <a href=\"https://doi.org/10.1145/1989493.1989527\">https://doi.org/10.1145/1989493.1989527</a>.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2011). Re-Chord: a self-stabilizing chord overlay network. In <i>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)</i> (pp. 235--244). <a href=\"https://doi.org/10.1145/1989493.1989527\">https://doi.org/10.1145/1989493.1989527</a>","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: 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.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord: a self-stabilizing chord overlay network}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989527\">10.1145/1989493.1989527</a>}, booktitle={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)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2011}, pages={235--244} }","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>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)</i>, 2011, pp. 235--244, doi:<a href=\"https://doi.org/10.1145/1989493.1989527\">10.1145/1989493.1989527</a>."},"page":"235--244","date_updated":"2022-01-06T06:53:55Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2018-03-28T07:12:49Z","title":"Re-Chord: a self-stabilizing chord overlay network","doi":"10.1145/1989493.1989527"},{"title":"Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems","doi":"10.1007/978-3-642-19094-0_18","date_updated":"2022-01-06T06:53:56Z","publisher":"Springer","volume":6552,"date_created":"2018-03-28T07:17:05Z","author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"year":"2011","page":"170--181","intvolume":"      6552","citation":{"apa":"Kniesburges, S., &#38; Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i> (Vol. 6552, pp. 170--181). Springer. <a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">https://doi.org/10.1007/978-3-642-19094-0_18</a>","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, vol. 6552, Springer, 2011, pp. 170--181, doi:<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>.","bibtex":"@inproceedings{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}, volume={6552}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>}, booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170--181}, collection={Lecture Notes in Computer Science} }","short":"S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, Springer, 2011, pp. 170--181.","ama":"Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181. doi:<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, 6552:170--181. Lecture Notes in Computer Science. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">https://doi.org/10.1007/978-3-642-19094-0_18</a>.","ieee":"S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems,” in <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, 2011, vol. 6552, pp. 170--181."},"publication_identifier":{"isbn":["978-3-642-19093-3"]},"_id":"1899","department":[{"_id":"79"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","status":"public","publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings","type":"conference"},{"status":"public","type":"book_chapter","publication":"Computer Science, The Hardware, Software and Heart of It","_id":"1900","user_id":"15504","department":[{"_id":"79"}],"year":"2011","citation":{"ama":"Scheideler C, Graffi K. Programming for Distributed Computing: From Physical to Logical Networks. In: <i>Computer Science, The Hardware, Software and Heart of It</i>. Springer; 2011:155--168. doi:<a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">10.1007/978-1-4614-1168-0_9</a>","ieee":"C. Scheideler and K. Graffi, “Programming for Distributed Computing: From Physical to Logical Networks,” in <i>Computer Science, The Hardware, Software and Heart of It</i>, Springer, 2011, pp. 155--168.","chicago":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” In <i>Computer Science, The Hardware, Software and Heart of It</i>, 155--168. Springer, 2011. <a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">https://doi.org/10.1007/978-1-4614-1168-0_9</a>.","bibtex":"@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing: From Physical to Logical Networks}, DOI={<a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">10.1007/978-1-4614-1168-0_9</a>}, booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer}, author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168} }","short":"C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.","mla":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” <i>Computer Science, The Hardware, Software and Heart of It</i>, Springer, 2011, pp. 155--168, doi:<a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">10.1007/978-1-4614-1168-0_9</a>.","apa":"Scheideler, C., &#38; Graffi, K. (2011). Programming for Distributed Computing: From Physical to Logical Networks. In <i>Computer Science, The Hardware, Software and Heart of It</i> (pp. 155--168). Springer. <a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">https://doi.org/10.1007/978-1-4614-1168-0_9</a>"},"page":"155--168","publication_identifier":{"isbn":["978-1-4614-1167-3"]},"title":"Programming for Distributed Computing: From Physical to Logical Networks","doi":"10.1007/978-1-4614-1168-0_9","publisher":"Springer","date_updated":"2022-01-06T06:53:57Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"}],"date_created":"2018-03-28T07:17:53Z"},{"_id":"1901","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"book_chapter","publication":"Algorithms Unplugged","title":"Broadcasting - How Can I Quickly Disseminate Information?","doi":"10.1007/978-3-642-15328-0_22","publisher":"Springer","date_updated":"2022-01-06T06:53:57Z","author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2018-03-28T07:18:43Z","year":"2011","citation":{"apa":"Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information? In <i>Algorithms Unplugged</i> (pp. 223--229). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">https://doi.org/10.1007/978-3-642-15328-0_22</a>","mla":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” <i>Algorithms Unplugged</i>, Springer, 2011, pp. 223--229, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">10.1007/978-3-642-15328-0_22</a>.","bibtex":"@inbook{Scheideler_2011, title={Broadcasting - How Can I Quickly Disseminate Information?}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">10.1007/978-3-642-15328-0_22</a>}, booktitle={Algorithms Unplugged}, publisher={Springer}, author={Scheideler, Christian}, year={2011}, pages={223--229} }","short":"C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.","ieee":"C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,” in <i>Algorithms Unplugged</i>, Springer, 2011, pp. 223--229.","chicago":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” In <i>Algorithms Unplugged</i>, 223--229. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">https://doi.org/10.1007/978-3-642-15328-0_22</a>.","ama":"Scheideler C. Broadcasting - How Can I Quickly Disseminate Information? In: <i>Algorithms Unplugged</i>. Springer; 2011:223--229. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">10.1007/978-3-642-15328-0_22</a>"},"page":"223--229","publication_identifier":{"isbn":["978-3-642-15327-3"]}},{"_id":"1902","department":[{"_id":"79"}],"user_id":"15504","status":"public","type":"book","title":"Algorithms Unplugged","doi":"10.1007/978-3-642-15328-0","date_updated":"2022-01-06T06:53:57Z","author":[{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"},{"last_name":"Alt","full_name":"Alt, Helmut","first_name":"Helmut"},{"first_name":"Martin","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin"},{"first_name":"Rüdiger","last_name":"Reischuk","full_name":"Reischuk, Rüdiger"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"first_name":"Heribert","full_name":"Vollmer, Heribert","last_name":"Vollmer"},{"last_name":"Wagner","full_name":"Wagner, Dorothea","first_name":"Dorothea"}],"date_created":"2018-03-28T07:19:31Z","year":"2011","citation":{"chicago":"Vöcking, Berthold, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, and Dorothea Wagner. <i>Algorithms Unplugged</i>, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0\">https://doi.org/10.1007/978-3-642-15328-0</a>.","ieee":"B. Vöcking <i>et al.</i>, <i>Algorithms Unplugged</i>. 2011.","ama":"Vöcking B, Alt H, Dietzfelbinger M, et al. <i>Algorithms Unplugged</i>.; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>","short":"B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Algorithms Unplugged, 2011.","mla":"Vöcking, Berthold, et al. <i>Algorithms Unplugged</i>. 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>.","bibtex":"@book{Vöcking_Alt_Dietzfelbinger_Reischuk_Scheideler_Vollmer_Wagner_2011, title={Algorithms Unplugged}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>}, author={Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}, year={2011} }","apa":"Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H., &#38; Wagner, D. (2011). <i>Algorithms Unplugged</i>. <a href=\"https://doi.org/10.1007/978-3-642-15328-0\">https://doi.org/10.1007/978-3-642-15328-0</a>"},"publication_identifier":{"isbn":["978-3-642-15327-3"]}},{"_id":"1924","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"conference","publication":"28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","doi":"10.4230/LIPIcs.STACS.2011.129","date_updated":"2022-01-06T06:54:00Z","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_created":"2018-03-29T08:44:00Z","year":"2011","citation":{"apa":"Kolman, P., &#38; Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i> (pp. 129--140). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">https://doi.org/10.4230/LIPIcs.STACS.2011.129</a>","bibtex":"@inproceedings{Kolman_Scheideler_2011, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>}, booktitle={28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany}, author={Kolman, Petr and Scheideler, Christian}, year={2011}, pages={129--140} }","short":"P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140.","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 2011, pp. 129--140, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>.","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” in <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 2011, pp. 129--140.","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” In <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 129--140, 2011. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">https://doi.org/10.4230/LIPIcs.STACS.2011.129</a>.","ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In: <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>. ; 2011:129--140. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>"},"page":"129--140"},{"citation":{"ama":"Setzer A. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn; 2011.","ieee":"A. Setzer, <i>Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","chicago":"Setzer, Alexander. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","apa":"Setzer, A. (2011). <i>Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk</i>. Universität Paderborn.","bibtex":"@book{Setzer_2011, title={Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2011} }","mla":"Setzer, Alexander. <i>Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk</i>. Universität Paderborn, 2011.","short":"A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011."},"year":"2011","title":"Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk","author":[{"last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108","first_name":"Alexander"}],"date_created":"2020-08-17T08:08:13Z","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:24Z","status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"_id":"17997"}]