[{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T06:42:01Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"628","user_id":"477","series_title":"LNCS","department":[{"_id":"79"},{"_id":"63"}],"abstract":[{"lang":"eng","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-15T06:42:01Z","date_updated":"2018-03-15T06:42:01Z","access_level":"closed","file_name":"628-FULL_paper_bncs_with_interests.pdf","file_id":"1238","file_size":300591}],"status":"public","type":"conference","publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","title":"Basic Network Creation Games with Communication Interests","doi":"10.1007/978-3-642-33996-7_7","date_updated":"2022-01-06T07:02:59Z","date_created":"2017-10-17T12:42:54Z","author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"first_name":"Martina","last_name":"Huellmann (married name: Eikel)","full_name":"Huellmann (married name: Eikel), Martina"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Alexander","id":"11108","full_name":"Setzer, Alexander","last_name":"Setzer"}],"year":"2012","citation":{"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>.","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.","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} }","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>.","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>"},"page":"72--83","has_accepted_license":"1"},{"type":"conference","publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","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."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":220213,"file_name":"632-SODA2012-Scheideler_01.pdf","access_level":"closed","file_id":"1234","date_updated":"2018-03-15T06:35:58Z","creator":"florida","date_created":"2018-03-15T06:35:58Z"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"632","user_id":"15504","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T06:35:58Z","has_accepted_license":"1","year":"2012","citation":{"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>","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.","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>.","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>","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","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>."},"page":"800-810","date_updated":"2022-01-06T07:03:01Z","author":[{"first_name":"Petr","last_name":"Kolman","full_name":"Kolman, Petr"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2017-10-17T12:42:55Z","title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","doi":"10.1137/1.9781611973099.64"},{"type":"conference","publication":"Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1232","file_name":"636-Online_Facility_Location.pdf","file_size":173049,"creator":"florida","date_created":"2018-03-14T14:14:21Z","date_updated":"2018-03-14T14:14:21Z"}],"status":"public","abstract":[{"text":"We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax.","lang":"eng"}],"series_title":"LNCS","user_id":"15504","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"636","file_date_updated":"2018-03-14T14:14:21Z","ddc":["040"],"has_accepted_license":"1","citation":{"chicago":"Meyer auf der Heide, Friedhelm, Peter Pietrzyk, and Peter Kling. “An Algorithm for Facility Leasing.” In <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 61–72. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">https://doi.org/10.1007/978-3-642-31104-8_6</a>.","ieee":"F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility Leasing,” in <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72.","ama":"Meyer auf der Heide F, Pietrzyk P, Kling P. An Algorithm for Facility Leasing. In: <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>. LNCS. ; 2012:61-72. doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>","short":"F. Meyer auf der Heide, P. Pietrzyk, P. Kling, in: Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO), 2012, pp. 61–72.","bibtex":"@inproceedings{Meyer auf der Heide_Pietrzyk_Kling_2012, series={LNCS}, title={An Algorithm for Facility Leasing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>}, booktitle={Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)}, author={Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter}, year={2012}, pages={61–72}, collection={LNCS} }","mla":"Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72, doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>.","apa":"Meyer auf der Heide, F., Pietrzyk, P., &#38; Kling, P. (2012). An Algorithm for Facility Leasing. In <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i> (pp. 61–72). <a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">https://doi.org/10.1007/978-3-642-31104-8_6</a>"},"page":"61-72","year":"2012","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"}],"date_created":"2017-10-17T12:42:56Z","date_updated":"2022-01-06T07:03:02Z","doi":"10.1007/978-3-642-31104-8_6","title":"An Algorithm for Facility Leasing"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:03Z","author":[{"id":"25078","full_name":"Eidens, Fabian","last_name":"Eidens","first_name":"Fabian"}],"date_created":"2017-10-17T12:42:56Z","title":"Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken","year":"2012","citation":{"chicago":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","ieee":"F. Eidens, <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","ama":"Eidens F. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn; 2012.","apa":"Eidens, F. (2012). <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn.","mla":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","bibtex":"@book{Eidens_2012, title={Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2012} }","short":"F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken, Universität Paderborn, 2012."},"_id":"638","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"63"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"date_updated":"2022-01-06T07:03:04Z","date_created":"2017-10-17T12:42:56Z","author":[{"last_name":"Kniesburges","full_name":"Kniesburges, Sebastian","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"title":"A Self-Stabilization Process for Small-World Networks","doi":"10.1109/IPDPS.2012.115","has_accepted_license":"1","year":"2012","citation":{"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>.","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.","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>","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>.","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} }","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","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>"},"page":"1261--1271","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"640","user_id":"15504","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-14T14:13:13Z","type":"conference","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","abstract":[{"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.","lang":"eng"}],"file":[{"file_name":"640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf","access_level":"closed","file_id":"1230","file_size":210176,"date_created":"2018-03-14T14:13:13Z","creator":"florida","date_updated":"2018-03-14T14:13:13Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public"},{"type":"mastersthesis","year":"2012","citation":{"short":"J. Schluessler, A Forensic Framework for Automatic Information Retrieval in Distributed Systems, Universität Paderborn, 2012.","mla":"Schluessler, Jonathan. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","bibtex":"@book{Schluessler_2012, title={A Forensic Framework for Automatic Information Retrieval in Distributed Systems}, publisher={Universität Paderborn}, author={Schluessler, Jonathan}, year={2012} }","apa":"Schluessler, J. (2012). <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn.","ieee":"J. Schluessler, <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","chicago":"Schluessler, Jonathan. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn, 2012.","ama":"Schluessler J. <i>A Forensic Framework for Automatic Information Retrieval in Distributed Systems</i>. Universität Paderborn; 2012."},"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_updated":"2022-01-06T07:03:04Z","publisher":"Universität Paderborn","_id":"641","author":[{"first_name":"Jonathan","last_name":"Schluessler","full_name":"Schluessler, Jonathan"}],"date_created":"2017-10-17T12:42:57Z","user_id":"15504","title":"A Forensic Framework for Automatic Information Retrieval in Distributed Systems"},{"status":"public","type":"bachelorsthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"5","name":"SFB 901 - Subproject A1"}],"_id":"17997","user_id":"477","department":[{"_id":"79"}],"year":"2011","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.","short":"A. Setzer, Lokale Online-Strategien Zur Linearen Anordnung von Teilnehmern in Einem Peer-to-Peer Netzwerk, Universität Paderborn, 2011.","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."},"title":"Lokale Online-Strategien zur linearen Anordnung von Teilnehmern in einem Peer-to-Peer Netzwerk","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:53:24Z","author":[{"last_name":"Setzer","full_name":"Setzer, Alexander","id":"11108","first_name":"Alexander"}],"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_created":"2020-08-17T08:08:13Z"},{"type":"mastersthesis","status":"public","user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"648","language":[{"iso":"eng"}],"citation":{"bibtex":"@book{Brandes_2011, title={Robust Distributed Computation in Dynamic Networks}, publisher={Universität Paderborn}, author={Brandes, Philipp}, year={2011} }","mla":"Brandes, Philipp. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","short":"P. Brandes, Robust Distributed Computation in Dynamic Networks, Universität Paderborn, 2011.","apa":"Brandes, P. (2011). <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn.","ama":"Brandes P. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn; 2011.","chicago":"Brandes, Philipp. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","ieee":"P. Brandes, <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011."},"year":"2011","author":[{"first_name":"Philipp","last_name":"Brandes","full_name":"Brandes, Philipp"}],"supervisor":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:58Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:06Z","title":"Robust Distributed Computation in Dynamic Networks"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"654","language":[{"iso":"eng"}],"file_date_updated":"2018-03-14T13:50:18Z","ddc":["040"],"type":"conference","publication":"Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)","file":[{"date_created":"2018-03-14T13:50:18Z","creator":"florida","date_updated":"2018-03-14T13:50:18Z","file_id":"1221","file_name":"654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf","access_level":"closed","file_size":327680,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"lang":"eng","text":"Research on peer-to-peer (p2p) and distributed systems needs evaluation tools to predict and observe the behavior of protocols and mechanisms in large scale networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems aiming at the evaluation of interdependencies in multi-layered p2p systems. The simulator is written in Java, is event-based and mainly used in p2p research projects. The main development of PeerfactSim.KOM started in 2005 and is driven since 2006 by the project “QuaP2P”,which aims at the systematic improvement and benchmarking of p2p systems. Further users of the simulator are working in the project “On-the-fly Computing” aiming at researching p2p-based service oriented architectures. Both projects state severe requirements on the evaluation of multi-layered and large-scale distributed systems. We describe the architecture of PeerfactSim.KOM supporting these requirements in Section II, present the workflow, selected experiences and lessons learned in Section III and conclude the overview in Section IV."}],"date_created":"2017-10-17T12:42:59Z","author":[{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"}],"date_updated":"2022-01-06T07:03:11Z","doi":"10.1109/P2P.2011.6038673","title":"PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned","has_accepted_license":"1","citation":{"ama":"Graffi K. PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In: <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>. ; 2011:154-155. doi:<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>","ieee":"K. Graffi, “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned,” in <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 2011, pp. 154–155.","chicago":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” In <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 154–55, 2011. <a href=\"https://doi.org/10.1109/P2P.2011.6038673\">https://doi.org/10.1109/P2P.2011.6038673</a>.","bibtex":"@inproceedings{Graffi_2011, title={PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned}, DOI={<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>}, booktitle={Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)}, author={Graffi, Kalman}, year={2011}, pages={154–155} }","mla":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 2011, pp. 154–55, doi:<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>.","short":"K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–155.","apa":"Graffi, K. (2011). PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i> (pp. 154–155). <a href=\"https://doi.org/10.1109/P2P.2011.6038673\">https://doi.org/10.1109/P2P.2011.6038673</a>"},"page":"154-155","year":"2011"},{"abstract":[{"lang":"eng","text":"We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the algorithms can cope with measurement errors and take into account that communication costs between sensor nodes do not necessarily increase linearly with the distance, but can be represented by a polynomial. Since it cannot always be expected that sensor nodes execute algorithms in a synchronized way, our algorithms are executed in an asynchronous model (but they are still able to break symmetry that might occur when two neighboring nodes act at exactly the same time). Furthermore, they can deal with dynamic scenarios: if a node moves, the solution is updated and the update affects only nodes in the local neighborhood. Finally, the algorithms are robust in the sense that incorrect behavior of some nodes during some round will, in the end, still result in a good approximation. The first algorithm runs in expected O(log_{1+\\epsilon} n) communication rounds and yields a \\my^4(1+4\\my^2(1+\\epsilon)^{1/p})^p approximation, while the second has a running time of expected O(log^2_{1+\\epsilon} n) communication rounds and an approximation factor of \\my^4(1 + 2(1 + \\epsilon)^{1/p})^p. Here, \\epsilon > 0 is an arbitrarily small constant, p the exponent of the polynomial representing the communication costs, and \\my the relative measurement error."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-14T13:48:21Z","date_updated":"2018-03-14T13:48:21Z","file_id":"1219","access_level":"closed","file_name":"657-flp_algosensors2011-Cord-Landwehr.pdf","file_size":454740}],"status":"public","type":"conference","publication":"Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)","ddc":["040"],"file_date_updated":"2018-03-14T13:48:21Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"657","user_id":"477","series_title":"LNCS","department":[{"_id":"63"}],"year":"2011","citation":{"ieee":"S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks,” in <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 2011, pp. 13–27.","chicago":"Abshoff, Sebastan, Andreas Cord-Landwehr, Bastian Degener, Barbara  Kempkes, and Peter Pietrzyk. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” In <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 13–27. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">https://doi.org/10.1007/978-3-642-28209-6_3</a>.","ama":"Abshoff S, Cord-Landwehr A, Degener B, Kempkes B, Pietrzyk P. Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In: <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>. LNCS. ; 2011:13-27. doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>","bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Degener_Kempkes_Pietrzyk_2011, series={LNCS}, title={Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>}, booktitle={Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)}, author={Abshoff, Sebastan and Cord-Landwehr, Andreas and Degener, Bastian and Kempkes, Barbara  and Pietrzyk, Peter}, year={2011}, pages={13–27}, collection={LNCS} }","short":"S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, P. Pietrzyk, in: Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.","mla":"Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 2011, pp. 13–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>.","apa":"Abshoff, S., Cord-Landwehr, A., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2011). Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i> (pp. 13–27). <a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">https://doi.org/10.1007/978-3-642-28209-6_3</a>"},"page":"13-27","has_accepted_license":"1","title":"Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks","doi":"10.1007/978-3-642-28209-6_3","date_updated":"2022-01-06T07:03:12Z","date_created":"2017-10-17T12:43:00Z","author":[{"full_name":"Abshoff, Sebastan","last_name":"Abshoff","first_name":"Sebastan"},{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"first_name":"Barbara ","full_name":"Kempkes, Barbara ","last_name":"Kempkes"},{"first_name":"Peter","full_name":"Pietrzyk, Peter","last_name":"Pietrzyk"}]},{"department":[{"_id":"79"}],"series_title":"LNCS","user_id":"15504","_id":"662","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-14T13:46:48Z","ddc":["040"],"publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","type":"conference","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"662-SSS2011-Corona-Scheideler.pdf","file_id":"1217","file_size":305543,"creator":"florida","date_created":"2018-03-14T13:46:48Z","date_updated":"2018-03-14T13:46:48Z"}],"abstract":[{"text":"We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph.","lang":"eng"}],"date_created":"2017-10-17T12:43:01Z","author":[{"full_name":"Nesterenko, Mikhail","last_name":"Nesterenko","first_name":"Mikhail"},{"full_name":"Mohd, Rizal","last_name":"Mohd","first_name":"Rizal"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2022-01-06T07:03:13Z","doi":"10.1007/978-3-642-24550-3_27","title":"Corona: A Stabilizing Deterministic Message-Passing Skip List","has_accepted_license":"1","page":"356--370","citation":{"ieee":"M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” in <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 356--370.","chicago":"Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 356--370. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">https://doi.org/10.1007/978-3-642-24550-3_27</a>.","ama":"Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing Skip List. In: <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2011:356--370. doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>","apa":"Nesterenko, M., Mohd, R., &#38; Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 356--370). <a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">https://doi.org/10.1007/978-3-642-24550-3_27</a>","bibtex":"@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona: A Stabilizing Deterministic Message-Passing Skip List}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS} }","mla":"Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 356--370, doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>.","short":"M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370."},"year":"2011"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"663","citation":{"ama":"Swierkot K. <i>Complexity Classes for Local Computation</i>. Universität Paderborn; 2011.","chicago":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","ieee":"K. Swierkot, <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","short":"K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011.","bibtex":"@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }","mla":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","apa":"Swierkot, K. (2011). <i>Complexity Classes for Local Computation</i>. Universität Paderborn."},"year":"2011","title":"Complexity Classes for Local Computation","date_created":"2017-10-17T12:43:01Z","author":[{"first_name":"Kamil","last_name":"Swierkot","full_name":"Swierkot, Kamil"}],"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T07:03:13Z","publisher":"Universität Paderborn"},{"user_id":"477","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"665","language":[{"iso":"ger"}],"type":"mastersthesis","status":"public","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"full_name":"Wette, Philip","last_name":"Wette","first_name":"Philip"}],"date_created":"2017-10-17T12:43:01Z","date_updated":"2022-01-06T07:03:14Z","publisher":"Universität Paderborn","title":"Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord","citation":{"ama":"Wette P. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn; 2011.","ieee":"P. Wette, <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","chicago":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","short":"P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, Universität Paderborn, 2011.","mla":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","bibtex":"@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2011} }","apa":"Wette, P. (2011). <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn."},"year":"2011"},{"user_id":"477","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"667","language":[{"iso":"eng"}],"type":"conference_editor","status":"public","editor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"last_name":"Rajaraman","full_name":"Rajaraman, Rajmohan ","first_name":"Rajmohan "}],"date_created":"2017-10-17T12:43:02Z","date_updated":"2022-01-06T07:03:14Z","doi":"10.1145/1989493","title":"23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures","citation":{"apa":"Meyer auf der Heide, F., &#38; Rajaraman, R. (Eds.). (2011). <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>","bibtex":"@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures}, DOI={<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>}, year={2011} }","mla":"Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011, doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>.","short":"F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011.","ieee":"F. Meyer auf der Heide and R. Rajaraman, Eds., <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011.","chicago":"Meyer auf der Heide, Friedhelm, and Rajmohan  Rajaraman, eds. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2011. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>.","ama":"Meyer auf der Heide F, Rajaraman R, eds. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>.; 2011. doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>"},"year":"2011"}]