[{"date_updated":"2022-01-06T06:53:56Z","intvolume":"       298","title":"Peer-to-Peer Based Parallel Web Computing","year":"2011","status":"public","publication_identifier":{"isbn":["978-3-942647-17-5"]},"author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"}],"user_id":"5786","volume":298,"_id":"18976","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","abstract":[{"lang":"eng","text":"Web computing is a variant of parallel computing where the idle times of PCs\r\ndonated by worldwide distributed users are employed to execute parallel\r\nprograms. In this thesis we consider a web computing variant with two\r\nimportant properties: First, we support the execution of coupled, massively\r\nparallel algorithms (rather than distributed data processing). And second,\r\nwe organize the system in peer-to-peer fashion.\r\n\r\nWe present the Paderborn University BSP-based Web Computing (PUB-Web) library,\r\nwhich supports the execution of parallel programs in the bulk-synchronous style\r\n(BSP) in such a web computing setting. In this thesis, we focus on important\r\ntechnical and algorithmic aspects, in particular: In order to schedule\r\nprocesses with respect to the currently available computing power, which\r\ncontinually changes in an unpredictable fashion, we need intelligent load\r\nbalancing algorithms and -- as a basic precondition -- the technical ability\r\nto migrate threads at runtime.\r\n\r\nTo achieve the latter in a way suitable for production use, compatible with\r\nrecent Java versions, available for all important platforms, and easy-to-use\r\nfor developers, we develop the PadMig thread migration and checkpointing\r\nlibrary.\r\n\r\nIn order to tackle the distributed load balancing problem, we present an\r\nalgorithm based on Distributed Heterogeneous Hash-Tables. In order to judge\r\nthe quality of the schedules produced, we perform extensive experiments to\r\ncompare several variants of the DHHT-based load balancer with the well-\r\nestablished Work Stealing algorithm, using realistic input data obtained by\r\nprofiling the utilization of several hundred PCs for a period of several\r\nmonths.\r\n\r\nBeside the available computing power, we finally also consider the network\r\nbandwidth as a secondary criterion for load balancing. For this purpose, we\r\ncluster the PUB-Web network according to bandwidth, employing a novel,\r\nfault-tolerant, adaptive, and scaling distributed clustering algorithm called\r\nDiDiC. In order to judge the quality of the clusterings produces by DiDiC,\r\nwe experimentally compare it to the well-established MCL algorithm using a\r\nsimulator."}],"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466:2-186"}]},"citation":{"chicago":"Gehweiler, Joachim. <i>Peer-to-Peer Based Parallel Web Computing</i>. Vol. 298. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","short":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Gehweiler J. <i>Peer-to-Peer Based Parallel Web Computing</i>. Vol 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","bibtex":"@book{Gehweiler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-Peer Based Parallel Web Computing}, volume={298}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Gehweiler, Joachim}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Gehweiler, J. (2011). <i>Peer-to-Peer Based Parallel Web Computing</i> (Vol. 298). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Gehweiler, Joachim. <i>Peer-to-Peer Based Parallel Web Computing</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"J. Gehweiler, <i>Peer-to-Peer Based Parallel Web Computing</i>, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-04T07:46:32Z"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-09-04T11:58:54Z","publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","citation":{"apa":"Briest, P., &#38; Raupach, C. (2011). The car sharing problem. In <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>. <a href=\"https://doi.org/10.1145/1989493.1989518\">https://doi.org/10.1145/1989493.1989518</a>","ieee":"P. Briest and C. Raupach, “The car sharing problem,” in <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>, 2011.","short":"P. Briest, C. Raupach, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","chicago":"Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011. <a href=\"https://doi.org/10.1145/1989493.1989518\">https://doi.org/10.1145/1989493.1989518</a>.","mla":"Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011, doi:<a href=\"https://doi.org/10.1145/1989493.1989518\">10.1145/1989493.1989518</a>.","ama":"Briest P, Raupach C. The car sharing problem. In: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>. ; 2011. doi:<a href=\"https://doi.org/10.1145/1989493.1989518\">10.1145/1989493.1989518</a>","bibtex":"@inproceedings{Briest_Raupach_2011, title={The car sharing problem}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989518\">10.1145/1989493.1989518</a>}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Briest, Patrick and Raupach, Christoph}, year={2011} }"},"user_id":"15415","doi":"10.1145/1989493.1989518","_id":"19026","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:53:57Z","year":"2011","status":"public","title":"The car sharing problem","publication_identifier":{"isbn":["9781450307437"]},"author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"full_name":"Raupach, Christoph","first_name":"Christoph","last_name":"Raupach"}]},{"date_created":"2020-09-04T13:31:29Z","place":"Universität Paderborn","department":[{"_id":"63"}],"type":"dissertation","citation":{"ieee":"S. Effert, <i>Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen</i>. Universität Paderborn, 2011.","apa":"Effert, S. (2011). <i>Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen</i>. Universität Paderborn.","chicago":"Effert, Sascha. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. Universität Paderborn, 2011.","short":"S. Effert, Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen, Universität Paderborn, 2011.","mla":"Effert, Sascha. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. 2011.","bibtex":"@book{Effert_2011, place={Universität Paderborn}, title={Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen}, author={Effert, Sascha}, year={2011} }","ama":"Effert S. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. Universität Paderborn; 2011."},"supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385"}]},"language":[{"iso":"eng"}],"_id":"19040","user_id":"15415","author":[{"last_name":"Effert","first_name":"Sascha","full_name":"Effert, Sascha"}],"title":"Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen","status":"public","year":"2011","date_updated":"2022-01-06T06:53:57Z"},{"publication_status":"published","date_updated":"2022-01-06T06:55:59Z","year":"2011","title":"Approximation Techniques for Utilitarian Mechanism Design","status":"public","author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"first_name":"Piotr","last_name":"Krysta","full_name":"Krysta, Piotr"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"user_id":"15415","doi":"10.1137/090772988","page":"1587-1622","language":[{"iso":"eng"}],"_id":"23739","abstract":[{"lang":"eng","text":"This paper deals with the design of efficiently computable incentive-compatible mechanisms for combinatorial optimization problems with single-minded agents each possibly having multiple private parameters. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonicity properties to ensure truthfulness. Since most of the known approximation techniques do not fulfill these properties, we study alternative techniques. Our first contribution is a quite general method to transform a pseudopolynomial algorithm into a monotone fully polynomial time approximation scheme (FPTAS). This can be applied to various problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multiunit auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion. In addition, we present a monotone PTAS for the generalized assignment problem with any constant number of private parameters per agent. The most efficient way to solve packing integer programs (PIPs) is linear programming–based randomized rounding, which also is in general not monotone. We show that primal-dual greedy algorithms achieve almost the same approximation ratios for PIPs as randomized rounding. The advantage is that these algorithms are inherently monotone. This way, we can significantly improve the approximation ratios of truthful mechanisms for various fundamental mechanism design problems like single-minded combinatorial auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual approximation algorithms can also be used for the winner determination in CAs with general bidders specifying their bids through an oracle.\r\n"}],"publication":"SIAM Journal on Computing","citation":{"mla":"Briest, Patrick, et al. “Approximation Techniques for Utilitarian Mechanism Design.” <i>SIAM Journal on Computing</i>, 2011, pp. 1587–622, doi:<a href=\"https://doi.org/10.1137/090772988\">10.1137/090772988</a>.","ama":"Briest P, Krysta P, Vöcking B. Approximation Techniques for Utilitarian Mechanism Design. <i>SIAM Journal on Computing</i>. 2011:1587-1622. doi:<a href=\"https://doi.org/10.1137/090772988\">10.1137/090772988</a>","bibtex":"@article{Briest_Krysta_Vöcking_2011, title={Approximation Techniques for Utilitarian Mechanism Design}, DOI={<a href=\"https://doi.org/10.1137/090772988\">10.1137/090772988</a>}, journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr and Vöcking, Berthold}, year={2011}, pages={1587–1622} }","apa":"Briest, P., Krysta, P., &#38; Vöcking, B. (2011). Approximation Techniques for Utilitarian Mechanism Design. <i>SIAM Journal on Computing</i>, 1587–1622. <a href=\"https://doi.org/10.1137/090772988\">https://doi.org/10.1137/090772988</a>","ieee":"P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” <i>SIAM Journal on Computing</i>, pp. 1587–1622, 2011.","chicago":"Briest, Patrick, Piotr Krysta, and Berthold Vöcking. “Approximation Techniques for Utilitarian Mechanism Design.” <i>SIAM Journal on Computing</i>, 2011, 1587–1622. <a href=\"https://doi.org/10.1137/090772988\">https://doi.org/10.1137/090772988</a>.","short":"P. Briest, P. Krysta, B. Vöcking, SIAM Journal on Computing (2011) 1587–1622."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2021-09-03T10:41:04Z"},{"citation":{"bibtex":"@article{Briest_Krysta_2011, title={Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems}, DOI={<a href=\"https://doi.org/10.1137/090752353\">10.1137/090752353</a>}, journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr}, year={2011}, pages={1554–1586} }","ama":"Briest P, Krysta P. Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. <i>SIAM Journal on Computing</i>. 2011:1554-1586. doi:<a href=\"https://doi.org/10.1137/090752353\">10.1137/090752353</a>","mla":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” <i>SIAM Journal on Computing</i>, 2011, pp. 1554–86, doi:<a href=\"https://doi.org/10.1137/090752353\">10.1137/090752353</a>.","chicago":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” <i>SIAM Journal on Computing</i>, 2011, 1554–86. <a href=\"https://doi.org/10.1137/090752353\">https://doi.org/10.1137/090752353</a>.","short":"P. Briest, P. Krysta, SIAM Journal on Computing (2011) 1554–1586.","ieee":"P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” <i>SIAM Journal on Computing</i>, pp. 1554–1586, 2011.","apa":"Briest, P., &#38; Krysta, P. (2011). Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. <i>SIAM Journal on Computing</i>, 1554–1586. <a href=\"https://doi.org/10.1137/090752353\">https://doi.org/10.1137/090752353</a>"},"publication":"SIAM Journal on Computing","abstract":[{"lang":"eng","text":"We investigate nonparametric multiproduct pricing problems, in which we want to find revenue maximizing prices for products $\\mathcal{P}$ based on a set of customer samples $\\mathcal{C}$. We mostly focus on the unit-demand case, in which products constitute strict substitutes and each customer aims to purchase a single product. In this setting a customer sample consists of a number of nonzero values for different products and possibly an additional product ranking. Once prices are fixed, each customer chooses to buy one of the products she can afford based on some predefined selection rule. We distinguish between the min-buying, max-buying, and rank-buying models. Some of our results also extend to single-minded pricing, in which case products are strict complements and every customer seeks to buy a single set of products, which she purchases if the sum of prices is below her valuation for that set. For the min-buying model we show that the revenue maximization problem is not approximable within factor $\\mathcal{O}(\\log^{\\varepsilon}|\\mathcal{C}|)$ for some constant $\\varepsilon>0$, unless $\\mathrm{NP}\\subseteq\\mathrm{DTIME}(n^{\\mathcal{O}(\\log\\log n)})$, thereby almost closing the gap between the known algorithmic results and previous lower bounds. We also prove inapproximability within $\\mathcal{O}(\\ell^{\\varepsilon})$, $\\ell$ being an upper bound on the number of nonzero values per customer, and $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ under slightly stronger assumptions and provide matching upper bounds. Surprisingly, these hardness results hold even if a price ladder constraint, i.e., a predefined order on the prices of all products, is given. Without the price ladder constraint we obtain similar hardness results for the special case of uniform valuations, i.e., the case that every customer has identical values for all the products she is interested in, assuming specific hardness of the balanced bipartite independent set problem in constant degree graphs or hardness of refuting random 3CNF formulas. Introducing a slightly more general problem definition in which customers are given as an explicit probability distribution, we obtain inapproximability within $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ assuming $\\mathrm{NP}\\nsubseteq\\bigcap_{\\delta>0}\\mathrm{BPTIME}(2^{\\mathcal{O}(n^{\\delta})})$. These results apply to single-minded pricing as well. For the max-buying model a polynomial-time approximation scheme exists if a price ladder is given. We give a matching lower bound by proving strong NP-hardness. Assuming limited product supply, we analyze a generic local search algorithm and prove that it is 2-approximate. Finally, we discuss implications for the rank-buying model.\r\n"}],"date_created":"2021-09-03T10:48:52Z","department":[{"_id":"63"}],"type":"journal_article","publication_identifier":{"issn":["0097-5397","1095-7111"]},"author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"full_name":"Krysta, Piotr","last_name":"Krysta","first_name":"Piotr"}],"year":"2011","status":"public","title":"Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems","publication_status":"published","date_updated":"2022-01-06T06:55:59Z","language":[{"iso":"eng"}],"_id":"23740","page":"1554-1586","user_id":"15415","doi":"10.1137/090752353"},{"language":[{"iso":"eng"}],"_id":"20709","doi":"10.1007/978-3-642-18381-2_15","user_id":"3902","publication_identifier":{"isbn":["9783642183805","9783642183812"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"last_name":"Hüllmann","first_name":"Martina","full_name":"Hüllmann, Martina"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Klaas, Alexander","last_name":"Klaas","first_name":"Alexander"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"last_name":"Märtens","first_name":"Marcus","full_name":"Märtens, Marcus"},{"full_name":"auf der Heide, Friedhelm Meyer","first_name":"Friedhelm Meyer","last_name":"auf der Heide"},{"full_name":"Raupach, Christoph","first_name":"Christoph","last_name":"Raupach"},{"first_name":"Kamil","last_name":"Swierkot","full_name":"Swierkot, Kamil"},{"id":"3902","first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel"},{"last_name":"Weddemann","first_name":"Christoph","full_name":"Weddemann, Christoph"},{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"}],"title":"Collisionless Gathering of Robots with an Extent","year":"2011","status":"public","date_updated":"2022-01-06T06:54:33Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-12-12T11:15:30Z","department":[{"_id":"63"}],"type":"book_chapter","citation":{"ieee":"A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an Extent,” in <i>SOFSEM 2011: Theory and Practice of Computer Science</i>, Berlin, Heidelberg, 2011.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.","mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” <i>SOFSEM 2011: Theory and Practice of Computer Science</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering of Robots with an Extent}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>}, booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and et al.}, year={2011} }","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>"},"publication":"SOFSEM 2011: Theory and Practice of Computer Science"},{"publication_status":"published","date_updated":"2022-01-06T06:54:33Z","status":"public","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","year":"2011","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Hüllmann, Martina","last_name":"Hüllmann","first_name":"Martina"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Klaas, Alexander","first_name":"Alexander","last_name":"Klaas"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"last_name":"Märtens","first_name":"Marcus","full_name":"Märtens, Marcus"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"Christoph","last_name":"Raupach","full_name":"Raupach, Christoph"},{"last_name":"Swierkot","first_name":"Kamil","full_name":"Swierkot, Kamil"},{"id":"3902","full_name":"Warner, Daniel","first_name":"Daniel","last_name":"Warner"},{"first_name":"Christoph","last_name":"Weddemann","full_name":"Weddemann, Christoph"},{"first_name":"Daniel","last_name":"Wonisch","full_name":"Wonisch, Daniel"}],"user_id":"3902","doi":"10.1007/978-3-642-22012-8_52","_id":"20710","language":[{"iso":"eng"}],"publication":"Automata, Languages and Programming","citation":{"chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” <i>Automata, Languages and Programming</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>","ieee":"A. Cord-Landwehr <i>et al.</i>, “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 2011."},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-12-12T12:22:41Z","place":"Berlin, Heidelberg"},{"date_created":"2020-08-24T14:01:49Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of The 25th European Simulation and Modelling Conference - ESM2011","citation":{"ama":"Renken H, Laroque C, Fischer M. An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In: <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>. ; 2011.","bibtex":"@inproceedings{Renken_Laroque_Fischer_2011, title={An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization}, booktitle={Proceedings of The 25th European Simulation and Modelling Conference - ESM2011}, author={Renken, Hendrik and Laroque, Christoph and Fischer, Matthias}, year={2011} }","mla":"Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>, 2011.","short":"H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011.","chicago":"Renken, Hendrik, Christoph Laroque, and Matthias Fischer. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” In <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>, 2011.","apa":"Renken, H., Laroque, C., &#38; Fischer, M. (2011). An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>.","ieee":"H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” in <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>, 2011."},"language":[{"iso":"eng"}],"_id":"18193","user_id":"15415","status":"public","year":"2011","title":"An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization","author":[{"last_name":"Renken","first_name":"Hendrik","full_name":"Renken, Hendrik"},{"first_name":"Christoph","last_name":"Laroque","full_name":"Laroque, Christoph"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}],"date_updated":"2022-01-06T06:53:26Z"},{"author":[{"full_name":"Suess, Tim","first_name":"Tim","last_name":"Suess"},{"first_name":"Clemens","last_name":"Koch","full_name":"Koch, Clemens"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"status":"public","title":"Parallel Out-of-Core Occlusion Culling","year":"2011","has_accepted_license":"1","date_updated":"2022-01-06T06:53:27Z","_id":"18194","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"15415","citation":{"mla":"Suess, Tim, et al. <i>Parallel Out-of-Core Occlusion Culling</i>. 2011.","apa":"Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2011). <i>Parallel Out-of-Core Occlusion Culling</i>.","ieee":"T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel Out-of-Core Occlusion Culling.” 2011.","short":"T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, (2011).","ama":"Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Parallel Out-of-Core Occlusion Culling. Published online 2011.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.","bibtex":"@article{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2011, title={Parallel Out-of-Core Occlusion Culling}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2011} }"},"file_date_updated":"2020-08-24T14:13:46Z","abstract":[{"text":"We present a parallel rendering system for PC-Clusters to visualize large 3D scenes. One single visualization node, equipped with a high-end graphics adapter, is supported by a group of backend nodes with weak graphics performance. The objects of the scene are distributed among these backend nodes, they serve two purposes: First, they provide an out-of-core memory system for the visualization node. Second, they assist the visualization node's rendering by performing visibility calculations and only sending visible objects to the visualization node. In order to obtain fast rendering with our system, we have to distribute the objects among the backend nodes in a way that does not only guarantee an even distribution of the objects, but also an even distribution of the visibility calculations and the amount of data send to the visualization node. We identify necessary properties of the distribution and argue that a random distribution is a good candidate. Further, in order to reduce the number of objects sent to the visualization node per frame, we employ an approximate hierarchical occlusion culling in each backend node. For this, they are equipped, in addition to the objects assigned to them, with simplified versions of the other objects of the 3D scene. The visualization node is equipped with 512 MiB video memory and supported by 15 backend nodes. This system is able to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model between 20 - 30 fps and thus allows a walkthrough in real-time.","lang":"eng"}],"date_created":"2020-08-24T14:14:10Z","file":[{"creator":"koala","date_created":"2020-08-24T14:13:46Z","file_name":"pre-03-2011-5220.pdf","file_size":3091853,"access_level":"closed","relation":"main_file","date_updated":"2020-08-24T14:13:46Z","file_id":"18195","success":1,"content_type":"application/pdf"}],"department":[{"_id":"63"}],"type":"preprint"},{"user_id":"15415","_id":"18568","language":[{"iso":"eng"}],"page":"234--239","date_updated":"2022-01-06T06:53:40Z","author":[{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"},{"full_name":"Hoefer, Martin","first_name":"Martin","last_name":"Hoefer"},{"first_name":"Alexander ","last_name":"Skopalik","full_name":"Skopalik, Alexander "},{"full_name":"Penn, Michal","first_name":"Michal","last_name":"Penn"},{"first_name":"Maria","last_name":"Polukarov","full_name":"Polukarov, Maria"}],"title":"Considerate Equilibrium","status":"public","year":"2011","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-28T12:23:42Z","related_material":{"link":[{"url":"http://ijcai.org/papers11/Papers/IJCAI11-050.pdf","relation":"confirmation"}]},"citation":{"ama":"Vöcking B, Hoefer M, Skopalik A, Penn M, Polukarov M. Considerate Equilibrium. In: <i>{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,</i>. ; 2011:234--239.","bibtex":"@inproceedings{Vöcking_Hoefer_Skopalik_Penn_Polukarov_2011, title={Considerate Equilibrium}, booktitle={{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,}, author={Vöcking, Berthold and Hoefer, Martin and Skopalik, Alexander  and Penn, Michal and Polukarov, Maria}, year={2011}, pages={234--239} }","mla":"Vöcking, Berthold, et al. “Considerate Equilibrium.” <i>{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,</i> 2011, pp. 234--239.","chicago":"Vöcking, Berthold, Martin Hoefer, Alexander  Skopalik, Michal Penn, and Maria Polukarov. “Considerate Equilibrium.” In <i>{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,</i> 234--239, 2011.","short":"B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, M. Polukarov, in: {IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011, pp. 234--239.","apa":"Vöcking, B., Hoefer, M., Skopalik, A., Penn, M., &#38; Polukarov, M. (2011). Considerate Equilibrium. In <i>{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,</i> (pp. 234--239).","ieee":"B. Vöcking, M. Hoefer, A. Skopalik, M. Penn, and M. Polukarov, “Considerate Equilibrium,” in <i>{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,</i> 2011, pp. 234--239."},"publication":"{IJCAI} 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence,"},{"file":[{"file_name":"657-flp_algosensors2011-Cord-Landwehr.pdf","access_level":"closed","file_size":454740,"relation":"main_file","date_updated":"2018-03-14T13:48:21Z","file_id":"1219","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-14T13:48:21Z"}],"date_created":"2017-10-17T12:43:00Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)","abstract":[{"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.","lang":"eng"}],"series_title":"LNCS","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-28209-6_3","title":"Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks","year":"2011","author":[{"full_name":"Abshoff, Sebastan","last_name":"Abshoff","first_name":"Sebastan"},{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"full_name":"Kempkes, Barbara ","first_name":"Barbara ","last_name":"Kempkes"},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"}],"date_updated":"2022-01-06T07:03:12Z","file_date_updated":"2018-03-14T13:48:21Z","citation":{"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>","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.","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} }","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>","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>.","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."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"page":"13-27","_id":"657","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1"},{"date_created":"2017-10-17T12:43:01Z","department":[{"_id":"63"}],"type":"mastersthesis","citation":{"mla":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","ama":"Swierkot K. <i>Complexity Classes for Local Computation</i>. Universität Paderborn; 2011.","bibtex":"@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }","apa":"Swierkot, K. (2011). <i>Complexity Classes for Local Computation</i>. Universität Paderborn.","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.","chicago":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011."},"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"publisher":"Universität Paderborn","_id":"663","language":[{"iso":"eng"}],"user_id":"477","author":[{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"}],"status":"public","title":"Complexity Classes for Local Computation","year":"2011","date_updated":"2022-01-06T07:03:13Z"},{"date_updated":"2022-01-06T07:03:14Z","author":[{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"title":"An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment","year":"2011","doi":"10.1007/978-3-642-31500-8_4","series_title":"LNCS","abstract":[{"lang":"eng","text":"Web Computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. The PUB-Web library developed by us supports this kind of usage of computing resources. A major problem for the efficient execution of such parallel programs is load balancing. In the Web Computing context, this problem becomes more difficult because of the dynamic behavior of the underlying \"parallel computer\": the set of available processors (donated PCs) as well as their availability (idle times) change over time in an unpredictable fashion.In this paper, we experimentally evaluate and compare load balancing algorithms in this scenario, namely a variant of the well-established Work Stealing algorithm and strategies based on a heterogeneous version of distributed hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic data sets for the job input streams and for the dynamics of the availability of the resources.Our experimental evaluations suggest that Work Stealing is the better strategy if the number of processes ready to run matches the number of available processors. But a suitable variant of DHHTs outperforms Work Stealing if there are significantly more processes ready to run than available processors."}],"publication":"Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)","department":[{"_id":"63"}],"type":"conference","date_created":"2017-10-17T12:43:01Z","file":[{"creator":"florida","date_created":"2018-03-14T13:45:57Z","relation":"main_file","date_updated":"2018-03-14T13:45:57Z","file_name":"664-PPAM11GKM_01.pdf","file_size":333335,"access_level":"closed","file_id":"1216","success":1,"content_type":"application/pdf"}],"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"15504","_id":"664","page":"31--40","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"mla":"Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2011, pp. 31--40, doi:<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>.","bibtex":"@inproceedings{Gehweiler_Kling_Meyer auf der Heide_2011, series={LNCS}, title={An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>}, booktitle={Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Gehweiler, Joachim and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2011}, pages={31--40}, collection={LNCS} }","ama":"Gehweiler J, Kling P, Meyer auf der Heide F. An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In: <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. LNCS. ; 2011:31--40. doi:<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>","ieee":"J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment,” in <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2011, pp. 31--40.","apa":"Gehweiler, J., Kling, P., &#38; Meyer auf der Heide, F. (2011). An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 31--40). <a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">https://doi.org/10.1007/978-3-642-31500-8_4</a>","short":"J. Gehweiler, P. Kling, F. Meyer auf der Heide, in: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40.","chicago":"Gehweiler, Joachim, Peter Kling, and Friedhelm Meyer auf der Heide. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” In <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 31--40. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">https://doi.org/10.1007/978-3-642-31500-8_4</a>."},"file_date_updated":"2018-03-14T13:45:57Z"},{"status":"public","title":"23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures","year":"2011","date_updated":"2022-01-06T07:03:14Z","_id":"667","language":[{"iso":"eng"}],"user_id":"477","doi":"10.1145/1989493","editor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Rajmohan ","last_name":"Rajaraman","full_name":"Rajaraman, Rajmohan "}],"citation":{"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>.","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>","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>.","short":"F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011.","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>","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} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:43:02Z","type":"conference_editor","department":[{"_id":"63"}]},{"user_id":"15415","page":"178-189","publisher":"Springer","_id":"16410","status":"public","citation":{"chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 178–89. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011, pp. 178–189.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i> (pp. 178–189). Springer. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>","ieee":"A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an Extent,” in <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 2011, no. 6543, pp. 178–189.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>. Springer; 2011:178-189. doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>","bibtex":"@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>}, number={6543}, booktitle={37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011}, pages={178–189} }","mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, no. 6543, Springer, 2011, pp. 178–89, doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>."},"doi":"10.1007/978-3-642-18381-2_15","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","title":"Collisionless Gathering of Robots with an Extent","year":"2011","author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Hüllmann","first_name":"Martina","full_name":"Hüllmann, Martina"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"last_name":"Klaas","first_name":"Alexander","full_name":"Klaas, Alexander"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"last_name":"Kurras","first_name":"Sven","full_name":"Kurras, Sven"},{"full_name":"Märtens, Marcus","first_name":"Marcus","last_name":"Märtens"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Raupach, Christoph","last_name":"Raupach","first_name":"Christoph"},{"last_name":"Swierkot","first_name":"Kamil","full_name":"Swierkot, Kamil"},{"full_name":"Warner, Daniel","first_name":"Daniel","last_name":"Warner"},{"last_name":"Weddemann","first_name":"Christoph","full_name":"Weddemann, Christoph"},{"first_name":"Daniel","last_name":"Wonisch","full_name":"Wonisch, Daniel"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-06T07:52:42Z","abstract":[{"text":"Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version.","lang":"eng"}],"publication":"37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)","issue":"6543"},{"publication":"Algorithms Unplugged","citation":{"chicago":"Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” In <i>Algorithms Unplugged</i>, 367–74. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">https://doi.org/10.1007/978-3-642-15328-0_38</a>.","short":"J. Gehweiler, F. Meyer auf der Heide, in: Algorithms Unplugged, Berlin, Heidelberg, 2011, pp. 367–374.","ieee":"J. Gehweiler and F. Meyer auf der Heide, “Bin Packing - How Do I Get My Stuff into the Boxes,” in <i>Algorithms Unplugged</i>, Berlin, Heidelberg, 2011, pp. 367–374.","apa":"Gehweiler, J., &#38; Meyer auf der Heide, F. (2011). Bin Packing - How Do I Get My Stuff into the Boxes. In <i>Algorithms Unplugged</i> (pp. 367–374). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">https://doi.org/10.1007/978-3-642-15328-0_38</a>","bibtex":"@inbook{Gehweiler_Meyer auf der Heide_2011, place={Berlin, Heidelberg}, title={Bin Packing - How Do I Get My Stuff into the Boxes}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">10.1007/978-3-642-15328-0_38</a>}, booktitle={Algorithms Unplugged}, author={Gehweiler, Joachim and Meyer auf der Heide, Friedhelm}, year={2011}, pages={367–374} }","ama":"Gehweiler J, Meyer auf der Heide F. Bin Packing - How Do I Get My Stuff into the Boxes. In: <i>Algorithms Unplugged</i>. Berlin, Heidelberg; 2011:367-374. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">10.1007/978-3-642-15328-0_38</a>","mla":"Gehweiler, Joachim, and Friedhelm Meyer auf der Heide. “Bin Packing - How Do I Get My Stuff into the Boxes.” <i>Algorithms Unplugged</i>, 2011, pp. 367–74, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_38\">10.1007/978-3-642-15328-0_38</a>."},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-06T10:10:39Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","title":"Bin Packing - How Do I Get My Stuff into the Boxes","year":"2011","status":"public","publication_identifier":{"isbn":["9783642153273","9783642153280"]},"author":[{"last_name":"Gehweiler","first_name":"Joachim","full_name":"Gehweiler, Joachim"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"user_id":"15415","doi":"10.1007/978-3-642-15328-0_38","page":"367-374","language":[{"iso":"eng"}],"_id":"16412"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-06T13:48:10Z","citation":{"bibtex":"@inproceedings{Rajaraman_Meyer auf der Heide_2011, title={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, DOI={<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>}, author={Rajaraman, Rajmohan and Meyer auf der Heide, Friedhelm}, year={2011} }","ama":"Rajaraman R, Meyer auf der Heide F. Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. In: ; 2011. doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>","mla":"Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>. 2011, doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>.","chicago":"Rajaraman, Rajmohan, and Friedhelm Meyer auf der Heide. “Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11,” 2011. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>.","short":"R. Rajaraman, F. Meyer auf der Heide, in: 2011.","ieee":"R. Rajaraman and F. Meyer auf der Heide, “Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11,” 2011.","apa":"Rajaraman, R., &#38; Meyer auf der Heide, F. (2011). Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>"},"user_id":"15415","doi":"10.1145/1989493","_id":"16428","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","author":[{"full_name":"Rajaraman, Rajmohan","first_name":"Rajmohan","last_name":"Rajaraman"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"isbn":["9781450307437"]},"title":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","year":"2011","status":"public"},{"date_created":"2020-04-07T06:46:06Z","type":"journal_article","department":[{"_id":"63"}],"publication":"Computer Science Review","citation":{"mla":"Degener, Bastian, et al. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” <i>Computer Science Review</i>, 2011, pp. 57–68, doi:<a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">10.1016/j.cosrev.2010.09.005</a>.","ama":"Degener B, Fekete SP, Kempkes B, Meyer auf der Heide F. A survey on relay placement with runtime and approximation guarantees. <i>Computer Science Review</i>. 2011:57-68. doi:<a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">10.1016/j.cosrev.2010.09.005</a>","bibtex":"@article{Degener_Fekete_Kempkes_Meyer auf der Heide_2011, title={A survey on relay placement with runtime and approximation guarantees}, DOI={<a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">10.1016/j.cosrev.2010.09.005</a>}, journal={Computer Science Review}, author={Degener, Bastian and Fekete, Sándor P. and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={57–68} }","apa":"Degener, B., Fekete, S. P., Kempkes, B., &#38; Meyer auf der Heide, F. (2011). A survey on relay placement with runtime and approximation guarantees. <i>Computer Science Review</i>, 57–68. <a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">https://doi.org/10.1016/j.cosrev.2010.09.005</a>","ieee":"B. Degener, S. P. Fekete, B. Kempkes, and F. Meyer auf der Heide, “A survey on relay placement with runtime and approximation guarantees,” <i>Computer Science Review</i>, pp. 57–68, 2011.","short":"B. Degener, S.P. Fekete, B. Kempkes, F. Meyer auf der Heide, Computer Science Review (2011) 57–68.","chicago":"Degener, Bastian, Sándor P. Fekete, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “A Survey on Relay Placement with Runtime and Approximation Guarantees.” <i>Computer Science Review</i>, 2011, 57–68. <a href=\"https://doi.org/10.1016/j.cosrev.2010.09.005\">https://doi.org/10.1016/j.cosrev.2010.09.005</a>."},"page":"57-68","language":[{"iso":"eng"}],"_id":"16447","doi":"10.1016/j.cosrev.2010.09.005","user_id":"15415","status":"public","title":"A survey on relay placement with runtime and approximation guarantees","year":"2011","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"full_name":"Fekete, Sándor P.","first_name":"Sándor P.","last_name":"Fekete"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_identifier":{"issn":["1574-0137"]},"date_updated":"2022-01-06T06:52:50Z","publication_status":"published"},{"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","status":"public","year":"2011","title":"Energy-efficient strategies for building short chains of mobile robots locally","author":[{"first_name":"Philipp","last_name":"Brandes","full_name":"Brandes, Philipp"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"user_id":"15415","doi":"10.1016/j.tcs.2012.10.056","page":"138-149","_id":"16451","language":[{"iso":"eng"}],"publication":"SIROCCO '11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity","citation":{"ieee":"P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-efficient strategies for building short chains of mobile robots locally,” in <i>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i>, 2011, pp. 138–149.","apa":"Brandes, P., Degener, B., Kempkes, B., &#38; Meyer auf der Heide, F. (2011). Energy-efficient strategies for building short chains of mobile robots locally. In <i>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i> (pp. 138–149). <a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">https://doi.org/10.1016/j.tcs.2012.10.056</a>","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity, 2011, pp. 138–149.","chicago":"Brandes, Philipp, Bastian Degener, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” In <i>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i>, 138–49, 2011. <a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">https://doi.org/10.1016/j.tcs.2012.10.056</a>.","mla":"Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” <i>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i>, 2011, pp. 138–49, doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">10.1016/j.tcs.2012.10.056</a>.","bibtex":"@inproceedings{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, title={Energy-efficient strategies for building short chains of mobile robots locally}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">10.1016/j.tcs.2012.10.056</a>}, booktitle={SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={138–149} }","ama":"Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-efficient strategies for building short chains of mobile robots locally. In: <i>SIROCCO ’11: Proc. of the 18th International Colloquium on Structural Information and Communication Complexity</i>. ; 2011:138-149. doi:<a href=\"https://doi.org/10.1016/j.tcs.2012.10.056\">10.1016/j.tcs.2012.10.056</a>"},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-07T12:12:23Z"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-07T12:31:24Z","citation":{"ama":"Degener B, Kempkes B, Langner T, Meyer auf der Heide F, Pietrzyk P, Wattenhofer R. A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>. ; 2011. doi:<a href=\"https://doi.org/10.1145/1989493.1989515\">10.1145/1989493.1989515</a>","bibtex":"@inproceedings{Degener_Kempkes_Langner_Meyer auf der Heide_Pietrzyk_Wattenhofer_2011, title={A tight runtime bound for synchronous gathering of autonomous robots with limited visibility}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989515\">10.1145/1989493.1989515</a>}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Degener, Bastian and Kempkes, Barbara and Langner, Tobias and Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Wattenhofer, Roger}, year={2011} }","mla":"Degener, Bastian, et al. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011, doi:<a href=\"https://doi.org/10.1145/1989493.1989515\">10.1145/1989493.1989515</a>.","chicago":"Degener, Bastian, Barbara Kempkes, Tobias Langner, Friedhelm Meyer auf der Heide, Peter Pietrzyk, and Roger Wattenhofer. “A Tight Runtime Bound for Synchronous Gathering of Autonomous Robots with Limited Visibility.” In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011. <a href=\"https://doi.org/10.1145/1989493.1989515\">https://doi.org/10.1145/1989493.1989515</a>.","short":"B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, R. Wattenhofer, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","apa":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., &#38; Wattenhofer, R. (2011). A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>. <a href=\"https://doi.org/10.1145/1989493.1989515\">https://doi.org/10.1145/1989493.1989515</a>","ieee":"B. Degener, B. Kempkes, T. Langner, F. Meyer auf der Heide, P. Pietrzyk, and R. Wattenhofer, “A tight runtime bound for synchronous gathering of autonomous robots with limited visibility,” in <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>, 2011."},"publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","doi":"10.1145/1989493.1989515","user_id":"15415","_id":"16453","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","publication_identifier":{"isbn":["9781450307437"]},"author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Langner, Tobias","first_name":"Tobias","last_name":"Langner"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Pietrzyk, Peter","last_name":"Pietrzyk","first_name":"Peter"},{"last_name":"Wattenhofer","first_name":"Roger","full_name":"Wattenhofer, Roger"}],"status":"public","year":"2011","title":"A tight runtime bound for synchronous gathering of autonomous robots with limited visibility"}]