[{"user_id":"15415","title":"Convergence of local communication chain strategies via linear transformations","date_created":"2020-04-07T12:33:00Z","status":"public","publication_status":"published","publication_identifier":{"isbn":["9781450307437"]},"publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","department":[{"_id":"63"}],"author":[{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"doi":"10.1145/1989493.1989517","date_updated":"2022-01-06T06:52:50Z","_id":"16454","language":[{"iso":"eng"}],"year":"2011","citation":{"ama":"Kling P, Meyer auf der Heide F. Convergence of local communication chain strategies via linear transformations. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11. ; 2011. doi:10.1145/1989493.1989517","apa":"Kling, P., & Meyer auf der Heide, F. (2011). Convergence of local communication chain strategies via linear transformations. In Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11. https://doi.org/10.1145/1989493.1989517","chicago":"Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.” In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011. https://doi.org/10.1145/1989493.1989517.","mla":"Kling, Peter, and Friedhelm Meyer auf der Heide. “Convergence of Local Communication Chain Strategies via Linear Transformations.” Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011, doi:10.1145/1989493.1989517.","bibtex":"@inproceedings{Kling_Meyer auf der Heide_2011, title={Convergence of local communication chain strategies via linear transformations}, DOI={10.1145/1989493.1989517}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2011} }","short":"P. Kling, F. Meyer auf der Heide, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","ieee":"P. Kling and F. Meyer auf der Heide, “Convergence of local communication chain strategies via linear transformations,” in Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11, 2011."},"type":"conference"},{"title":"Building Simple Formations in Large Societies of Tiny Mobile Robots","user_id":"15415","publication":"Procedia Computer Science","department":[{"_id":"63"}],"author":[{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publication_status":"published","publication_identifier":{"issn":["1877-0509"]},"date_created":"2020-04-07T12:35:11Z","status":"public","date_updated":"2022-01-06T06:52:50Z","_id":"16455","doi":"10.1016/j.procs.2011.09.049","page":"153-155","type":"journal_article","year":"2011","citation":{"ieee":"B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Building Simple Formations in Large Societies of Tiny Mobile Robots,” Procedia Computer Science, pp. 153–155, 2011.","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, Procedia Computer Science (2011) 153–155.","bibtex":"@article{Degener_Kempkes_Meyer auf der Heide_2011, title={Building Simple Formations in Large Societies of Tiny Mobile Robots}, DOI={10.1016/j.procs.2011.09.049}, journal={Procedia Computer Science}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011}, pages={153–155} }","mla":"Degener, Bastian, et al. “Building Simple Formations in Large Societies of Tiny Mobile Robots.” Procedia Computer Science, 2011, pp. 153–55, doi:10.1016/j.procs.2011.09.049.","chicago":"Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Building Simple Formations in Large Societies of Tiny Mobile Robots.” Procedia Computer Science, 2011, 153–55. https://doi.org/10.1016/j.procs.2011.09.049.","apa":"Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science, 153–155. https://doi.org/10.1016/j.procs.2011.09.049","ama":"Degener B, Kempkes B, Meyer auf der Heide F. Building Simple Formations in Large Societies of Tiny Mobile Robots. Procedia Computer Science. 2011:153-155. doi:10.1016/j.procs.2011.09.049"},"language":[{"iso":"eng"}]},{"year":"2011","type":"book_chapter","citation":{"mla":"Degener, Bastian, et al. “Energy-Awareness in Self-Organising Robotic Exploration Teams.” Organic Computing — A Paradigm Shift for Complex Systems, 2011, doi:10.1007/978-3-0348-0130-0_35.","bibtex":"@inbook{Degener_Kempkes_Meyer auf der Heide_2011, place={Basel}, title={Energy-Awareness in Self-organising Robotic Exploration Teams}, DOI={10.1007/978-3-0348-0130-0_35}, booktitle={Organic Computing — A Paradigm Shift for Complex Systems}, author={Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011} }","chicago":"Degener, Bastian, Barbara Kempkes, and Friedhelm Meyer auf der Heide. “Energy-Awareness in Self-Organising Robotic Exploration Teams.” In Organic Computing — A Paradigm Shift for Complex Systems. Basel, 2011. https://doi.org/10.1007/978-3-0348-0130-0_35.","apa":"Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Awareness in Self-organising Robotic Exploration Teams. In Organic Computing — A Paradigm Shift for Complex Systems. Basel. https://doi.org/10.1007/978-3-0348-0130-0_35","ama":"Degener B, Kempkes B, Meyer auf der Heide F. Energy-Awareness in Self-organising Robotic Exploration Teams. In: Organic Computing — A Paradigm Shift for Complex Systems. Basel; 2011. doi:10.1007/978-3-0348-0130-0_35","ieee":"B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Awareness in Self-organising Robotic Exploration Teams,” in Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011.","short":"B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Organic Computing — A Paradigm Shift for Complex Systems, Basel, 2011."},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-0348-0130-0_35","date_updated":"2022-01-06T06:52:50Z","_id":"16456","publication_status":"published","publication_identifier":{"isbn":["9783034801294","9783034801300"]},"status":"public","date_created":"2020-04-07T12:36:17Z","author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Organic Computing — A Paradigm Shift for Complex Systems","department":[{"_id":"63"}],"title":"Energy-Awareness in Self-organising Robotic Exploration Teams","user_id":"15415","place":"Basel"},{"language":[{"iso":"eng"}],"citation":{"mla":"Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” Structural Information and Communication Complexity, 2011, doi:10.1007/978-3-642-22212-2_13.","bibtex":"@inbook{Brandes_Degener_Kempkes_Meyer auf der Heide_2011, place={Berlin, Heidelberg}, title={Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally}, DOI={10.1007/978-3-642-22212-2_13}, booktitle={Structural Information and Communication Complexity}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011} }","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 Structural Information and Communication Complexity. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22212-2_13.","ama":"Brandes P, Degener B, Kempkes B, Meyer auf der Heide F. Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In: Structural Information and Communication Complexity. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22212-2_13","apa":"Brandes, P., Degener, B., Kempkes, B., & Meyer auf der Heide, F. (2011). Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In Structural Information and Communication Complexity. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22212-2_13","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 Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 2011."},"type":"book_chapter","year":"2011","_id":"16459","date_updated":"2022-01-06T06:52:50Z","doi":"10.1007/978-3-642-22212-2_13","author":[{"last_name":"Brandes","full_name":"Brandes, Philipp","first_name":"Philipp"},{"first_name":"Bastian","full_name":"Degener, Bastian","last_name":"Degener"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication":"Structural Information and Communication Complexity","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-08T06:52:53Z","publication_status":"published","publication_identifier":{"isbn":["9783642222115","9783642222122"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","user_id":"15415","title":"Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally"},{"year":"2011","type":"journal_article","citation":{"mla":"Hsu, D. Frank, et al. “EDITORIAL.” Journal of Interconnection Networks, 2011, pp. vii–viii, doi:10.1142/s0219265911002885.","bibtex":"@article{Hsu_Magga_Ho_Hromkovic_Lau_Meyer auf der Heide_2011, title={EDITORIAL}, DOI={10.1142/s0219265911002885}, journal={Journal of Interconnection Networks}, author={Hsu, D. Frank and Magga, Bruce M. and Ho, Howard C. T. and Hromkovic, Juraj and Lau, Francis C. M. and Meyer auf der Heide, Friedhelm}, year={2011}, pages={vii–viii} }","chicago":"Hsu, D. Frank, Bruce M. Magga, Howard C. T. Ho, Juraj Hromkovic, Francis C. M. Lau, and Friedhelm Meyer auf der Heide. “EDITORIAL.” Journal of Interconnection Networks, 2011, vii–viii. https://doi.org/10.1142/s0219265911002885.","ama":"Hsu DF, Magga BM, Ho HCT, Hromkovic J, Lau FCM, Meyer auf der Heide F. EDITORIAL. Journal of Interconnection Networks. 2011:vii-viii. doi:10.1142/s0219265911002885","apa":"Hsu, D. F., Magga, B. M., Ho, H. C. T., Hromkovic, J., Lau, F. C. M., & Meyer auf der Heide, F. (2011). EDITORIAL. Journal of Interconnection Networks, vii–viii. https://doi.org/10.1142/s0219265911002885","ieee":"D. F. Hsu, B. M. Magga, H. C. T. Ho, J. Hromkovic, F. C. M. Lau, and F. Meyer auf der Heide, “EDITORIAL,” Journal of Interconnection Networks, pp. vii–viii, 2011.","short":"D.F. Hsu, B.M. Magga, H.C.T. Ho, J. Hromkovic, F.C.M. Lau, F. Meyer auf der Heide, Journal of Interconnection Networks (2011) vii–viii."},"page":"vii-viii","language":[{"iso":"eng"}],"doi":"10.1142/s0219265911002885","_id":"17009","date_updated":"2022-01-06T06:53:01Z","publication_identifier":{"issn":["0219-2659","1793-6713"]},"publication_status":"published","status":"public","date_created":"2020-05-18T13:35:10Z","author":[{"last_name":"Hsu","full_name":"Hsu, D. Frank","first_name":"D. Frank"},{"full_name":"Magga, Bruce M.","first_name":"Bruce M.","last_name":"Magga"},{"full_name":"Ho, Howard C. T.","first_name":"Howard C. T.","last_name":"Ho"},{"first_name":"Juraj","full_name":"Hromkovic, Juraj","last_name":"Hromkovic"},{"last_name":"Lau","full_name":"Lau, Francis C. M.","first_name":"Francis C. M."},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"department":[{"_id":"63"}],"publication":"Journal of Interconnection Networks","title":"EDITORIAL","user_id":"15415"},{"year":"2011","type":"book_chapter","citation":{"ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52","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 Automata, Languages and Programming. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22012-8_52","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 Automata, Languages and Programming. Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.","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={10.1007/978-3-642-22012-8_52}, 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} }","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.","ieee":"A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","_id":"16409","doi":"10.1007/978-3-642-22012-8_52","department":[{"_id":"63"}],"publication":"Automata, Languages and Programming","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"},{"first_name":"Matthias","full_name":"Fischer, Matthias","last_name":"Fischer","id":"146"},{"last_name":"Hüllmann","full_name":"Hüllmann, Martina","first_name":"Martina"},{"first_name":"Barbara","full_name":"Kempkes, Barbara","last_name":"Kempkes"},{"last_name":"Klaas","first_name":"Alexander","full_name":"Klaas, Alexander"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"last_name":"Kurras","first_name":"Sven","full_name":"Kurras, Sven"},{"full_name":"Märtens, Marcus","first_name":"Marcus","last_name":"Märtens"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Raupach","first_name":"Christoph","full_name":"Raupach, Christoph"},{"last_name":"Swierkot","full_name":"Swierkot, Kamil","first_name":"Kamil"},{"last_name":"Warner","full_name":"Warner, Daniel","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"date_created":"2020-04-06T07:47:55Z","status":"public","abstract":[{"text":"Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes.\r\n","lang":"eng"}],"place":"Berlin, Heidelberg","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","user_id":"15415"},{"date_updated":"2022-01-06T06:54:09Z","_id":"19678","intvolume":" 6534","doi":"10.1007/978-3-642-18318-8_5","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"type":"conference","year":"2010","citation":{"ieee":"P. Briest and H. Röglin, “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers,” in Workshop on Approximation and Online Algorithms (WAOA), 2010, vol. 6534.","short":"P. Briest, H. Röglin, in: Workshop on Approximation and Online Algorithms (WAOA), Springer, 2010.","mla":"Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.” Workshop on Approximation and Online Algorithms (WAOA), vol. 6534, Springer, 2010, doi:10.1007/978-3-642-18318-8_5.","bibtex":"@inproceedings{Briest_Röglin_2010, series={Lecture Notes in Computer Science}, title={The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers}, volume={6534}, DOI={10.1007/978-3-642-18318-8_5}, booktitle={Workshop on Approximation and Online Algorithms (WAOA)}, publisher={Springer}, author={Briest, Patrick and Röglin, Heiko}, year={2010}, collection={Lecture Notes in Computer Science} }","apa":"Briest, P., & Röglin, H. (2010). The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In Workshop on Approximation and Online Algorithms (WAOA) (Vol. 6534). Springer. https://doi.org/10.1007/978-3-642-18318-8_5","ama":"Briest P, Röglin H. The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers. In: Workshop on Approximation and Online Algorithms (WAOA). Vol 6534. Lecture Notes in Computer Science. Springer; 2010. doi:10.1007/978-3-642-18318-8_5","chicago":"Briest, Patrick, and Heiko Röglin. “The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers.” In Workshop on Approximation and Online Algorithms (WAOA), Vol. 6534. Lecture Notes in Computer Science. Springer, 2010. https://doi.org/10.1007/978-3-642-18318-8_5."},"user_id":"15415","title":"The Power of Uncertainty: Bundle-Pricing for Unit-Demand Customers","department":[{"_id":"63"}],"publication":"Workshop on Approximation and Online Algorithms (WAOA)","publisher":"Springer","author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"first_name":"Heiko","full_name":"Röglin, Heiko","last_name":"Röglin"}],"date_created":"2020-09-24T14:13:19Z","status":"public","volume":6534},{"department":[{"_id":"63"}],"publication":"International Parallel & Distributed Processing Symposium (IPDPS)","author":[{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Pietrzyk, Peter","first_name":"Peter","last_name":"Pietrzyk"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"}],"date_created":"2020-09-28T08:25:37Z","status":"public","title":"A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ","user_id":"15415","year":"2010","type":"conference","citation":{"bibtex":"@inproceedings{Degener_Pietrzyk_Kempkes_2010, title={A local, distributed constant-factor approximation algorithm for the dynamic facility location problem }, DOI={10.1109/IPDPS.2010.5470349}, booktitle={International Parallel & Distributed Processing Symposium (IPDPS)}, author={Degener, Bastian and Pietrzyk, Peter and Kempkes, Barbara}, year={2010} }","mla":"Degener, Bastian, et al. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .” International Parallel & Distributed Processing Symposium (IPDPS), 2010, doi:10.1109/IPDPS.2010.5470349.","apa":"Degener, B., Pietrzyk, P., & Kempkes, B. (2010). A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In International Parallel & Distributed Processing Symposium (IPDPS). https://doi.org/10.1109/IPDPS.2010.5470349","ama":"Degener B, Pietrzyk P, Kempkes B. A local, distributed constant-factor approximation algorithm for the dynamic facility location problem . In: International Parallel & Distributed Processing Symposium (IPDPS). ; 2010. doi:10.1109/IPDPS.2010.5470349","chicago":"Degener, Bastian, Peter Pietrzyk, and Barbara Kempkes. “A Local, Distributed Constant-Factor Approximation Algorithm for the Dynamic Facility Location Problem .” In International Parallel & Distributed Processing Symposium (IPDPS), 2010. https://doi.org/10.1109/IPDPS.2010.5470349.","ieee":"B. Degener, P. Pietrzyk, and B. Kempkes, “A local, distributed constant-factor approximation algorithm for the dynamic facility location problem ,” in International Parallel & Distributed Processing Symposium (IPDPS), 2010.","short":"B. Degener, P. Pietrzyk, B. Kempkes, in: International Parallel & Distributed Processing Symposium (IPDPS), 2010."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:10Z","_id":"19711","doi":"10.1109/IPDPS.2010.5470349"},{"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-642-05118-0_43","date_updated":"2022-01-06T06:54:12Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642051173","9783642051180"]},"publication_status":"published","department":[{"_id":"63"}],"title":"Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks","page":"624--639","year":"2010","citation":{"short":"M. Mense, C. Schindelhauer, in: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, pp. 624--639.","ieee":"M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, vol. 5873, pp. 624--639.","chicago":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” In Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 5873:624--639. Lecture Notes in Computer Science, 2010. https://doi.org/10.1007/978-3-642-05118-0_43.","apa":"Mense, M., & Schindelhauer, C. (2010). Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (Vol. 5873, pp. 624--639). https://doi.org/10.1007/978-3-642-05118-0_43","ama":"Mense M, Schindelhauer C. Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In: Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems. Vol 5873. Lecture Notes in Computer Science. ; 2010:624--639. doi:10.1007/978-3-642-05118-0_43","bibtex":"@inproceedings{Mense_Schindelhauer_2010, series={Lecture Notes in Computer Science}, title={Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks}, volume={5873}, DOI={10.1007/978-3-642-05118-0_43}, booktitle={Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems}, author={Mense, Mario and Schindelhauer, Christian}, year={2010}, pages={624--639}, collection={Lecture Notes in Computer Science} }","mla":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 5873, 2010, pp. 624--639, doi:10.1007/978-3-642-05118-0_43."},"type":"conference","intvolume":" 5873","_id":"19796","date_created":"2020-09-30T12:12:33Z","status":"public","volume":5873,"publication":"Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems","author":[{"last_name":"Mense","full_name":"Mense, Mario","first_name":"Mario"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"user_id":"15415","abstract":[{"text":"We introduce the Read-Write-Coding-System (RWC) a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k \\leq r,w \\leq n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear $\\left(n,k,d\\right)$-codes that have (a) minimum distance d=n-r+1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r=k and thus, w=n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.","lang":"eng"}]},{"status":"public","date_created":"2020-10-01T09:39:13Z","publication_status":"published","publication_identifier":{"isbn":["9781424497270"]},"author":[{"first_name":"Thomas","full_name":"Janson, Thomas","last_name":"Janson"},{"full_name":"Mahlmann, Peter","first_name":"Peter","last_name":"Mahlmann"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"publication":"Proceedings of the 16th International Conference on Parallel and Distributed Systems","department":[{"_id":"63"}],"user_id":"15415","title":"A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs","abstract":[{"lang":"eng","text":"We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to overcome their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow range queries, and DHTs for load balancing. Simple handshake operations with provable guarantees are used for maintenance and self-stabilization. Efficiency of load balancing, fast data access, and robustness are proven by rigorous analysis."}],"language":[{"iso":"eng"}],"citation":{"mla":"Janson, Thomas, et al. “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs.” Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010, doi:10.1109/icpads.2010.42.","bibtex":"@inproceedings{Janson_Mahlmann_Schindelhauer_2010, title={A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs}, DOI={10.1109/icpads.2010.42}, booktitle={Proceedings of the 16th International Conference on Parallel and Distributed Systems}, author={Janson, Thomas and Mahlmann, Peter and Schindelhauer, Christian}, year={2010} }","chicago":"Janson, Thomas, Peter Mahlmann, and Christian Schindelhauer. “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs.” In Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010. https://doi.org/10.1109/icpads.2010.42.","ama":"Janson T, Mahlmann P, Schindelhauer C. A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In: Proceedings of the 16th International Conference on Parallel and Distributed Systems. ; 2010. doi:10.1109/icpads.2010.42","apa":"Janson, T., Mahlmann, P., & Schindelhauer, C. (2010). A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs. In Proceedings of the 16th International Conference on Parallel and Distributed Systems. https://doi.org/10.1109/icpads.2010.42","ieee":"T. Janson, P. Mahlmann, and C. Schindelhauer, “A Self-Stabilizing Locality-Aware Peer-to-Peer Network Combining Random Networks, Search Trees, and DHTs,” in Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010.","short":"T. Janson, P. Mahlmann, C. Schindelhauer, in: Proceedings of the 16th International Conference on Parallel and Distributed Systems, 2010."},"year":"2010","type":"conference","doi":"10.1109/icpads.2010.42","date_updated":"2022-01-06T06:54:13Z","_id":"19824"}]