[{"publication":"Advances in Cryptology – EUROCRYPT 2012","citation":{"mla":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” <i>Advances in Cryptology – EUROCRYPT 2012</i>, Springer Berlin Heidelberg, 2012, pp. 537–53, doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">10.1007/978-3-642-29011-4_32</a>.","ama":"Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. In: <i>Advances in Cryptology – EUROCRYPT 2012</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:537-553. doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">10.1007/978-3-642-29011-4_32</a>","bibtex":"@inbook{Kakvi_Kiltz_2012, place={Berlin, Heidelberg}, title={Optimal Security Proofs for Full Domain Hash, Revisited}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">10.1007/978-3-642-29011-4_32</a>}, booktitle={Advances in Cryptology – EUROCRYPT 2012}, publisher={Springer Berlin Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike}, year={2012}, pages={537–553} }","apa":"Kakvi, S., &#38; Kiltz, E. (2012). Optimal Security Proofs for Full Domain Hash, Revisited. In <i>Advances in Cryptology – EUROCRYPT 2012</i> (pp. 537–553). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">https://doi.org/10.1007/978-3-642-29011-4_32</a>","ieee":"S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” in <i>Advances in Cryptology – EUROCRYPT 2012</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 537–553.","short":"S. Kakvi, E. Kiltz, in: Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 537–553.","chicago":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” In <i>Advances in Cryptology – EUROCRYPT 2012</i>, 537–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">https://doi.org/10.1007/978-3-642-29011-4_32</a>."},"extern":"1","place":"Berlin, Heidelberg","date_created":"2018-05-25T12:36:44Z","type":"book_chapter","department":[{"_id":"558"}],"title":"Optimal Security Proofs for Full Domain Hash, Revisited","status":"public","year":"2012","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642290107","9783642290114"]},"author":[{"id":"66268","first_name":"Saqib","last_name":"Kakvi","full_name":"Kakvi, Saqib"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"}],"date_updated":"2022-01-06T06:58:47Z","publication_status":"published","page":"537-553","main_file_link":[{"url":"https://doi.org/10.1007/s00145-017-9257-9"}],"publisher":"Springer Berlin Heidelberg","_id":"2919","doi":"10.1007/978-3-642-29011-4_32","user_id":"66268"},{"publication":"Experimental Algorithms","citation":{"apa":"Kempkes, B., &#38; Meyer auf der Heide, F. (2012). Continuous Local Strategies for Robotic Formation Problems. In <i>Experimental Algorithms</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">https://doi.org/10.1007/978-3-642-30850-5_2</a>","ieee":"B. Kempkes and F. Meyer auf der Heide, “Continuous Local Strategies for Robotic Formation Problems,” in <i>Experimental Algorithms</i>, Berlin, Heidelberg, 2012.","short":"B. Kempkes, F. Meyer auf der Heide, in: Experimental Algorithms, Berlin, Heidelberg, 2012.","chicago":"Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies for Robotic Formation Problems.” In <i>Experimental Algorithms</i>. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">https://doi.org/10.1007/978-3-642-30850-5_2</a>.","mla":"Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies for Robotic Formation Problems.” <i>Experimental Algorithms</i>, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">10.1007/978-3-642-30850-5_2</a>.","ama":"Kempkes B, Meyer auf der Heide F. Continuous Local Strategies for Robotic Formation Problems. In: <i>Experimental Algorithms</i>. Berlin, Heidelberg; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">10.1007/978-3-642-30850-5_2</a>","bibtex":"@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Continuous Local Strategies for Robotic Formation Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-30850-5_2\">10.1007/978-3-642-30850-5_2</a>}, booktitle={Experimental Algorithms}, author={Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2012} }"},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-07T06:41:18Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","title":"Continuous Local Strategies for Robotic Formation Problems","year":"2012","status":"public","author":[{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642308499","9783642308505"]},"user_id":"15415","doi":"10.1007/978-3-642-30850-5_2","language":[{"iso":"eng"}],"_id":"16445"},{"user_id":"15415","doi":"10.1007/978-3-642-28209-6_2","_id":"16448","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","year":"2012","title":"Local, Self-organizing Strategies for Robotic Formation Problems","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642282089","9783642282096"]},"author":[{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-07T06:51:14Z","place":"Berlin, Heidelberg","publication":"Algorithms for Sensor Systems","citation":{"apa":"Kempkes, B., &#38; Meyer auf der Heide, F. (2012). Local, Self-organizing Strategies for Robotic Formation Problems. In <i>Algorithms for Sensor Systems</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">https://doi.org/10.1007/978-3-642-28209-6_2</a>","ieee":"B. Kempkes and F. Meyer auf der Heide, “Local, Self-organizing Strategies for Robotic Formation Problems,” in <i>Algorithms for Sensor Systems</i>, Berlin, Heidelberg, 2012.","chicago":"Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing Strategies for Robotic Formation Problems.” In <i>Algorithms for Sensor Systems</i>. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">https://doi.org/10.1007/978-3-642-28209-6_2</a>.","short":"B. Kempkes, F. Meyer auf der Heide, in: Algorithms for Sensor Systems, Berlin, Heidelberg, 2012.","mla":"Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing Strategies for Robotic Formation Problems.” <i>Algorithms for Sensor Systems</i>, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">10.1007/978-3-642-28209-6_2</a>.","ama":"Kempkes B, Meyer auf der Heide F. Local, Self-organizing Strategies for Robotic Formation Problems. In: <i>Algorithms for Sensor Systems</i>. Berlin, Heidelberg; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">10.1007/978-3-642-28209-6_2</a>","bibtex":"@inbook{Kempkes_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, title={Local, Self-organizing Strategies for Robotic Formation Problems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28209-6_2\">10.1007/978-3-642-28209-6_2</a>}, booktitle={Algorithms for Sensor Systems}, author={Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2012} }"}},{"_id":"16516","user_id":"15701","doi":"10.1007/978-3-642-29843-1_9","author":[{"full_name":"Baier, Robert","last_name":"Baier","first_name":"Robert"},{"full_name":"Molo, Mirko Hessel-von","first_name":"Mirko Hessel-von","last_name":"Molo"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642298424","9783642298431"]},"status":"public","title":"Newton’s Method and Secant Method for Set-Valued Mappings","year":"2012","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","date_created":"2020-04-15T07:59:49Z","place":"Berlin, Heidelberg","department":[{"_id":"101"}],"type":"book_chapter","citation":{"short":"R. Baier, M.H. Molo, in: Large-Scale Scientific Computing, Berlin, Heidelberg, 2012.","chicago":"Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method for Set-Valued Mappings.” In <i>Large-Scale Scientific Computing</i>. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">https://doi.org/10.1007/978-3-642-29843-1_9</a>.","ieee":"R. Baier and M. H. Molo, “Newton’s Method and Secant Method for Set-Valued Mappings,” in <i>Large-Scale Scientific Computing</i>, Berlin, Heidelberg, 2012.","apa":"Baier, R., &#38; Molo, M. H. (2012). Newton’s Method and Secant Method for Set-Valued Mappings. In <i>Large-Scale Scientific Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">https://doi.org/10.1007/978-3-642-29843-1_9</a>","bibtex":"@inbook{Baier_Molo_2012, place={Berlin, Heidelberg}, title={Newton’s Method and Secant Method for Set-Valued Mappings}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">10.1007/978-3-642-29843-1_9</a>}, booktitle={Large-Scale Scientific Computing}, author={Baier, Robert and Molo, Mirko Hessel-von}, year={2012} }","ama":"Baier R, Molo MH. Newton’s Method and Secant Method for Set-Valued Mappings. In: <i>Large-Scale Scientific Computing</i>. Berlin, Heidelberg; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">10.1007/978-3-642-29843-1_9</a>","mla":"Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method for Set-Valued Mappings.” <i>Large-Scale Scientific Computing</i>, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-29843-1_9\">10.1007/978-3-642-29843-1_9</a>."},"publication":"Large-Scale Scientific Computing"},{"publication":"Computer Security – ESORICS 2012","citation":{"short":"T. Jager, S. Schinzel, J. Somorovsky, in: Computer Security – ESORICS 2012, Berlin, Heidelberg, 2012.","chicago":"Jager, Tibor, Sebastian Schinzel, and Juraj Somorovsky. “Bleichenbacher’s Attack Strikes Again: Breaking PKCS#1 v1.5 in XML Encryption.” In <i>Computer Security – ESORICS 2012</i>. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33167-1_43\">https://doi.org/10.1007/978-3-642-33167-1_43</a>.","apa":"Jager, T., Schinzel, S., &#38; Somorovsky, J. (2012). Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption. In <i>Computer Security – ESORICS 2012</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-33167-1_43\">https://doi.org/10.1007/978-3-642-33167-1_43</a>","ieee":"T. Jager, S. Schinzel, and J. Somorovsky, “Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption,” in <i>Computer Security – ESORICS 2012</i>, Berlin, Heidelberg, 2012.","ama":"Jager T, Schinzel S, Somorovsky J. Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption. In: <i>Computer Security – ESORICS 2012</i>. Berlin, Heidelberg; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-33167-1_43\">10.1007/978-3-642-33167-1_43</a>","bibtex":"@inbook{Jager_Schinzel_Somorovsky_2012, place={Berlin, Heidelberg}, title={Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33167-1_43\">10.1007/978-3-642-33167-1_43</a>}, booktitle={Computer Security – ESORICS 2012}, author={Jager, Tibor and Schinzel, Sebastian and Somorovsky, Juraj}, year={2012} }","mla":"Jager, Tibor, et al. “Bleichenbacher’s Attack Strikes Again: Breaking PKCS#1 v1.5 in XML Encryption.” <i>Computer Security – ESORICS 2012</i>, 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-33167-1_43\">10.1007/978-3-642-33167-1_43</a>."},"type":"book_chapter","date_created":"2020-02-15T09:31:47Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2022-01-06T06:52:39Z","year":"2012","title":"Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption","status":"public","author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor"},{"first_name":"Sebastian","last_name":"Schinzel","full_name":"Schinzel, Sebastian"},{"id":"83504","orcid":"0000-0002-3593-7720","first_name":"Juraj","last_name":"Somorovsky","full_name":"Somorovsky, Juraj"}],"publication_identifier":{"isbn":["9783642331664","9783642331671"],"issn":["0302-9743","1611-3349"]},"user_id":"83504","doi":"10.1007/978-3-642-33167-1_43","_id":"15891","language":[{"iso":"eng"}]},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-33179-4_48","title":"Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes","year":"2012","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642331787","9783642331794"]},"author":[{"full_name":"Suess, Tim","first_name":"Tim","last_name":"Suess"},{"full_name":"Koch, Clemens","first_name":"Clemens","last_name":"Koch"},{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","intvolume":"      7431","date_created":"2020-04-06T07:40:57Z","type":"conference","department":[{"_id":"63"}],"publication":"Advances in Visual Computing","abstract":[{"text":"We present a parallel rendering system for heterogeneous PC clusters to visualize massive models. One single, powerful visualization node is supported by a group of backend nodes with weak graphics performance. While the visualization node renders the visible objects, the backend nodes asynchronously perform visibility tests and supply the front end with visible scene objects. The visualization node stores only currently visible objects in its memory, while the scene is distributed among the backend nodes’ memory without redundancy. To efficiently compute the occlusion tests in spite of that each backend node stores only a fraction of the original geometry, we complete the scene by adding highly simplified versions of the objects stored on other nodes. We test our system with 15 backend nodes. It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with 20, to 30,fps and thus allows a walk-through in real-time.\r\n","lang":"eng"}],"page":"502-512","_id":"16408","user_id":"15415","volume":7431,"status":"public","place":"Berlin, Heidelberg","citation":{"ieee":"T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,” in <i>Advances in Visual Computing</i>, 2012, vol. 7431, pp. 502–512, doi: <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>.","apa":"Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2012). Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. <i>Advances in Visual Computing</i>, <i>7431</i>, 502–512. <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">https://doi.org/10.1007/978-3-642-33179-4_48</a>","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.” In <i>Advances in Visual Computing</i>, 7431:502–12. Lecture Notes in Computer Science. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">https://doi.org/10.1007/978-3-642-33179-4_48</a>.","short":"T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2012, pp. 502–512.","mla":"Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.” <i>Advances in Visual Computing</i>, vol. 7431, 2012, pp. 502–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>.","bibtex":"@inproceedings{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}, volume={7431}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>}, booktitle={Advances in Visual Computing}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2012}, pages={502–512}, collection={Lecture Notes in Computer Science} }","ama":"Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In: <i>Advances in Visual Computing</i>. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512. doi:<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>"}},{"doi":"10.1007/978-3-642-21283-3_55","user_id":"15415","volume":5777,"page":"442--449","_id":"20183","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:21Z","publication_status":"published","intvolume":"      5777","title":"Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System","status":"public","year":"2011","publication_identifier":{"isbn":["9783642212826","9783642212833"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"last_name":"Schmickl","first_name":"Thomas","full_name":"Schmickl, Thomas"},{"last_name":"Crailsheim","first_name":"Karl","full_name":"Crailsheim, Karl"}],"type":"conference","department":[{"_id":"63"},{"_id":"238"}],"date_created":"2020-10-22T12:27:11Z","publication":"10th European Conference on Artificial Life (ECAL'09)","citation":{"bibtex":"@inproceedings{Hamann_Schmickl_Crailsheim_2011, title={Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System}, volume={5777}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>}, booktitle={10th European Conference on Artificial Life (ECAL’09)}, author={Hamann, Heiko and Schmickl, Thomas and Crailsheim, Karl}, year={2011}, pages={442--449} }","ama":"Hamann H, Schmickl T, Crailsheim K. Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System. In: <i>10th European Conference on Artificial Life (ECAL’09)</i>. Vol 5777. ; 2011:442--449. doi:<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>","mla":"Hamann, Heiko, et al. “Evolving for Creativity: Maximizing Complexity in a Self-Organized Multi-Particle System.” <i>10th European Conference on Artificial Life (ECAL’09)</i>, vol. 5777, 2011, pp. 442--449, doi:<a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">10.1007/978-3-642-21283-3_55</a>.","short":"H. Hamann, T. Schmickl, K. Crailsheim, in: 10th European Conference on Artificial Life (ECAL’09), 2011, pp. 442--449.","chicago":"Hamann, Heiko, Thomas Schmickl, and Karl Crailsheim. “Evolving for Creativity: Maximizing Complexity in a Self-Organized Multi-Particle System.” In <i>10th European Conference on Artificial Life (ECAL’09)</i>, 5777:442--449, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">https://doi.org/10.1007/978-3-642-21283-3_55</a>.","ieee":"H. Hamann, T. Schmickl, and K. Crailsheim, “Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System,” in <i>10th European Conference on Artificial Life (ECAL’09)</i>, 2011, vol. 5777, pp. 442--449.","apa":"Hamann, H., Schmickl, T., &#38; Crailsheim, K. (2011). Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System. In <i>10th European Conference on Artificial Life (ECAL’09)</i> (Vol. 5777, pp. 442--449). <a href=\"https://doi.org/10.1007/978-3-642-21283-3_55\">https://doi.org/10.1007/978-3-642-21283-3_55</a>"}},{"title":"Modeling Agents and Agent Systems","year":"2011","status":"public","author":[{"id":"315","last_name":"Lettmann","first_name":"Theodor","orcid":"0000-0001-5859-2457","full_name":"Lettmann, Theodor"},{"full_name":"Baumann, Michael","first_name":"Michael","last_name":"Baumann"},{"full_name":"Eberling, Markus","first_name":"Markus","last_name":"Eberling"},{"first_name":"Thomas","last_name":"Kemmerich","full_name":"Kemmerich, Thomas"}],"publication_identifier":{"isbn":["9783642240157","9783642240164"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:59:10Z","page":"157-181","publisher":"Springer Berlin Heidelberg","_id":"3332","language":[{"iso":"eng"}],"user_id":"315","doi":"10.1007/978-3-642-24016-4_9","publication":"Transactions on Computational Collective Intelligence V","citation":{"bibtex":"@article{Lettmann_Baumann_Eberling_Kemmerich_2011, title={Modeling Agents and Agent Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">10.1007/978-3-642-24016-4_9</a>}, journal={Transactions on Computational Collective Intelligence V}, publisher={Springer Berlin Heidelberg}, author={Lettmann, Theodor and Baumann, Michael and Eberling, Markus and Kemmerich, Thomas}, year={2011}, pages={157–181} }","chicago":"Lettmann, Theodor, Michael Baumann, Markus Eberling, and Thomas Kemmerich. “Modeling Agents and Agent Systems.” <i>Transactions on Computational Collective Intelligence V</i>, 2011, 157–81. <a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">https://doi.org/10.1007/978-3-642-24016-4_9</a>.","short":"T. Lettmann, M. Baumann, M. Eberling, T. Kemmerich, Transactions on Computational Collective Intelligence V (2011) 157–181.","ama":"Lettmann T, Baumann M, Eberling M, Kemmerich T. Modeling Agents and Agent Systems. <i>Transactions on Computational Collective Intelligence V</i>. 2011:157-181. doi:<a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">10.1007/978-3-642-24016-4_9</a>","ieee":"T. Lettmann, M. Baumann, M. Eberling, and T. Kemmerich, “Modeling Agents and Agent Systems,” <i>Transactions on Computational Collective Intelligence V</i>, pp. 157–181, 2011.","mla":"Lettmann, Theodor, et al. “Modeling Agents and Agent Systems.” <i>Transactions on Computational Collective Intelligence V</i>, Springer Berlin Heidelberg, 2011, pp. 157–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">10.1007/978-3-642-24016-4_9</a>.","apa":"Lettmann, T., Baumann, M., Eberling, M., &#38; Kemmerich, T. (2011). Modeling Agents and Agent Systems. <i>Transactions on Computational Collective Intelligence V</i>, 157–181. <a href=\"https://doi.org/10.1007/978-3-642-24016-4_9\">https://doi.org/10.1007/978-3-642-24016-4_9</a>"},"date_created":"2018-06-25T09:22:18Z","type":"journal_article"},{"date_created":"2020-12-12T11:15:30Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"SOFSEM 2011: Theory and Practice of Computer Science","citation":{"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>.","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>","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} }","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>","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.","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.","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>."},"language":[{"iso":"eng"}],"_id":"20709","user_id":"3902","doi":"10.1007/978-3-642-18381-2_15","year":"2011","title":"Collisionless Gathering of Robots with an Extent","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"full_name":"Hüllmann, Martina","first_name":"Martina","last_name":"Hüllmann"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Klaas, Alexander","last_name":"Klaas","first_name":"Alexander"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"full_name":"Märtens, Marcus","first_name":"Marcus","last_name":"Märtens"},{"full_name":"auf der Heide, Friedhelm Meyer","last_name":"auf der Heide","first_name":"Friedhelm Meyer"},{"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"}],"publication_status":"published","date_updated":"2022-01-06T06:54:33Z"},{"user_id":"3902","doi":"10.1007/978-3-642-22012-8_52","_id":"20710","language":[{"iso":"eng"}],"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","author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, 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"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"first_name":"Sven","last_name":"Kurras","full_name":"Kurras, Sven"},{"last_name":"Märtens","first_name":"Marcus","full_name":"Märtens, Marcus"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Raupach","first_name":"Christoph","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","last_name":"Swierkot","first_name":"Kamil"},{"id":"3902","full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-12-12T12:22:41Z","place":"Berlin, Heidelberg","publication":"Automata, Languages and Programming","citation":{"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>","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>.","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.","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>.","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.","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>","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} }"}},{"intvolume":"      6762","date_updated":"2022-01-06T07:03:00Z","publication_status":"published","author":[{"last_name":"Nebe","first_name":"Karsten","full_name":"Nebe, Karsten"},{"full_name":"Klompmaker, Florian","last_name":"Klompmaker","first_name":"Florian"},{"last_name":"Jung","first_name":"Helge","full_name":"Jung, Helge"},{"id":"30457","full_name":"Fischer, Holger Gerhard","first_name":"Holger Gerhard","last_name":"Fischer"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642216046","9783642216053"]},"title":"Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction","year":"2011","doi":"10.1007/978-3-642-21605-3_11","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","publication":"Human-Computer Interaction. Interaction Techniques and Environments.","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"type":"book_chapter","date_created":"2018-12-18T12:55:26Z","conference":{"location":"Orlando, USA","name":"International Conference on Interaction Techniques and Environments as part of HCI International 2011","start_date":"2011-07-09","end_date":"2011-07-14"},"status":"public","editor":[{"full_name":"Jacko, Julie Anne","last_name":"Jacko","first_name":"Julie Anne"}],"volume":6762,"user_id":"30457","_id":"6293","publisher":"Springer Berlin Heidelberg","page":"100-109","citation":{"short":"K. Nebe, F. Klompmaker, H. Jung, H.G. Fischer, in: J.A. Jacko (Ed.), Human-Computer Interaction. Interaction Techniques and Environments., Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 100–109.","chicago":"Nebe, Karsten, Florian Klompmaker, Helge Jung, and Holger Gerhard Fischer. “Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction.” In <i>Human-Computer Interaction. Interaction Techniques and Environments.</i>, edited by Julie Anne Jacko, 6762:100–109. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21605-3_11\">https://doi.org/10.1007/978-3-642-21605-3_11</a>.","apa":"Nebe, K., Klompmaker, F., Jung, H., &#38; Fischer, H. G. (2011). Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction. In J. A. Jacko (Ed.), <i>Human-Computer Interaction. Interaction Techniques and Environments.</i> (Vol. 6762, pp. 100–109). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-21605-3_11\">https://doi.org/10.1007/978-3-642-21605-3_11</a>","ieee":"K. Nebe, F. Klompmaker, H. Jung, and H. G. Fischer, “Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction,” in <i>Human-Computer Interaction. Interaction Techniques and Environments.</i>, vol. 6762, J. A. Jacko, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 100–109.","ama":"Nebe K, Klompmaker F, Jung H, Fischer HG. Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction. In: Jacko JA, ed. <i>Human-Computer Interaction. Interaction Techniques and Environments.</i> Vol 6762. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:100-109. doi:<a href=\"https://doi.org/10.1007/978-3-642-21605-3_11\">10.1007/978-3-642-21605-3_11</a>","bibtex":"@inbook{Nebe_Klompmaker_Jung_Fischer_2011, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction}, volume={6762}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-21605-3_11\">10.1007/978-3-642-21605-3_11</a>}, booktitle={Human-Computer Interaction. Interaction Techniques and Environments.}, publisher={Springer Berlin Heidelberg}, author={Nebe, Karsten and Klompmaker, Florian and Jung, Helge and Fischer, Holger Gerhard}, editor={Jacko, Julie AnneEditor}, year={2011}, pages={100–109}, collection={Lecture Notes in Computer Science} }","mla":"Nebe, Karsten, et al. “Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction.” <i>Human-Computer Interaction. Interaction Techniques and Environments.</i>, edited by Julie Anne Jacko, vol. 6762, Springer Berlin Heidelberg, 2011, pp. 100–09, doi:<a href=\"https://doi.org/10.1007/978-3-642-21605-3_11\">10.1007/978-3-642-21605-3_11</a>."},"place":"Berlin, Heidelberg"},{"date_created":"2018-12-18T13:04:39Z","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"type":"book_chapter","publication":"Human Centered Design","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-21753-1_4","author":[{"last_name":"Fischer","first_name":"Holger Gerhard","full_name":"Fischer, Holger Gerhard","id":"30457"},{"last_name":"Nebe","first_name":"Karsten","full_name":"Nebe, Karsten"},{"last_name":"Klompmaker","first_name":"Florian","full_name":"Klompmaker, Florian"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642217524","9783642217531"]},"year":"2011","title":"A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities","intvolume":"      6776","publication_status":"published","date_updated":"2022-01-06T07:03:00Z","place":"Berlin, Heidelberg","citation":{"bibtex":"@inbook{Fischer_Nebe_Klompmaker_2011, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities}, volume={6776}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">10.1007/978-3-642-21753-1_4</a>}, booktitle={Human Centered Design}, publisher={Springer Berlin Heidelberg}, author={Fischer, Holger Gerhard and Nebe, Karsten and Klompmaker, Florian}, editor={Kurosu, MasaakiEditor}, year={2011}, pages={28–37}, collection={Lecture Notes in Computer Science} }","ama":"Fischer HG, Nebe K, Klompmaker F. A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities. In: Kurosu M, ed. <i>Human Centered Design</i>. Vol 6776. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:28-37. doi:<a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">10.1007/978-3-642-21753-1_4</a>","mla":"Fischer, Holger Gerhard, et al. “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities.” <i>Human Centered Design</i>, edited by Masaaki Kurosu, vol. 6776, Springer Berlin Heidelberg, 2011, pp. 28–37, doi:<a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">10.1007/978-3-642-21753-1_4</a>.","chicago":"Fischer, Holger Gerhard, Karsten Nebe, and Florian Klompmaker. “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities.” In <i>Human Centered Design</i>, edited by Masaaki Kurosu, 6776:28–37. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">https://doi.org/10.1007/978-3-642-21753-1_4</a>.","short":"H.G. Fischer, K. Nebe, F. Klompmaker, in: M. Kurosu (Ed.), Human Centered Design, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 28–37.","ieee":"H. G. Fischer, K. Nebe, and F. Klompmaker, “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities,” in <i>Human Centered Design</i>, vol. 6776, M. Kurosu, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 28–37.","apa":"Fischer, H. G., Nebe, K., &#38; Klompmaker, F. (2011). A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities. In M. Kurosu (Ed.), <i>Human Centered Design</i> (Vol. 6776, pp. 28–37). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-21753-1_4\">https://doi.org/10.1007/978-3-642-21753-1_4</a>"},"_id":"6300","publisher":"Springer Berlin Heidelberg","page":"28-37","volume":6776,"editor":[{"full_name":"Kurosu, Masaaki","first_name":"Masaaki","last_name":"Kurosu"}],"user_id":"30457","conference":{"end_date":"2011-07-14","start_date":"2011-07-09","name":"International Conference on Human Centered Design (HCD) as part of HCI International 2011","location":"Orlando, USA"},"status":"public"},{"status":"public","user_id":"15415","_id":"16410","publisher":"Springer","page":"178-189","citation":{"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>.","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} }","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>","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.","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>","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.","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>."},"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Hüllmann, Martina","last_name":"Hüllmann","first_name":"Martina"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"last_name":"Klaas","first_name":"Alexander","full_name":"Klaas, Alexander"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"full_name":"Kurras, Sven","last_name":"Kurras","first_name":"Sven"},{"full_name":"Märtens, Marcus","first_name":"Marcus","last_name":"Märtens"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Raupach, Christoph","last_name":"Raupach","first_name":"Christoph"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","last_name":"Weddemann","first_name":"Christoph"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"year":"2011","title":"Collisionless Gathering of Robots with an Extent","doi":"10.1007/978-3-642-18381-2_15","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"publication":"37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)","issue":"6543","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-06T07:52:42Z"},{"citation":{"mla":"Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.” <i>Structural Information and Communication Complexity</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>.","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>Structural Information and Communication Complexity</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>","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={<a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">10.1007/978-3-642-22212-2_13</a>}, booktitle={Structural Information and Communication Complexity}, author={Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}, year={2011} }","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>Structural Information and Communication Complexity</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">https://doi.org/10.1007/978-3-642-22212-2_13</a>","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>Structural Information and Communication Complexity</i>, Berlin, Heidelberg, 2011.","short":"P. Brandes, B. Degener, B. Kempkes, F. Meyer auf der Heide, in: Structural Information and Communication Complexity, Berlin, Heidelberg, 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 <i>Structural Information and Communication Complexity</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22212-2_13\">https://doi.org/10.1007/978-3-642-22212-2_13</a>."},"publication":"Structural Information and Communication Complexity","place":"Berlin, Heidelberg","date_created":"2020-04-08T06:52:53Z","department":[{"_id":"63"}],"type":"book_chapter","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642222115","9783642222122"]},"author":[{"full_name":"Brandes, Philipp","last_name":"Brandes","first_name":"Philipp"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"status":"public","year":"2011","title":"Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16459","doi":"10.1007/978-3-642-22212-2_13","user_id":"15415"},{"date_created":"2019-11-21T15:27:31Z","department":[{"_id":"69"}],"type":"conference","citation":{"ieee":"M. Benter, S. Böttcher, and R. Hartel, “Mixing Bottom-Up and Top-Down XPath Query Evaluation,” in <i>East European Conference on Advances in Databases and Information Systems</i>, 2011, pp. 27–41.","apa":"Benter, M., Böttcher, S., &#38; Hartel, R. (2011). Mixing Bottom-Up and Top-Down XPath Query Evaluation. In <i>East European Conference on Advances in Databases and Information Systems</i> (pp. 27–41). Springer. <a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">https://doi.org/10.1007/978-3-642-23737-9_3</a>","chicago":"Benter, Markus, Stefan Böttcher, and Rita Hartel. “Mixing Bottom-Up and Top-Down XPath Query Evaluation.” In <i>East European Conference on Advances in Databases and Information Systems</i>, 27–41. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">https://doi.org/10.1007/978-3-642-23737-9_3</a>.","short":"M. Benter, S. Böttcher, R. Hartel, in: East European Conference on Advances in Databases and Information Systems, Springer, 2011, pp. 27–41.","mla":"Benter, Markus, et al. “Mixing Bottom-Up and Top-Down XPath Query Evaluation.” <i>East European Conference on Advances in Databases and Information Systems</i>, Springer, 2011, pp. 27–41, doi:<a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">10.1007/978-3-642-23737-9_3</a>.","bibtex":"@inproceedings{Benter_Böttcher_Hartel_2011, title={Mixing Bottom-Up and Top-Down XPath Query Evaluation}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">10.1007/978-3-642-23737-9_3</a>}, booktitle={East European Conference on Advances in Databases and Information Systems}, publisher={Springer}, author={Benter, Markus and Böttcher, Stefan and Hartel, Rita}, year={2011}, pages={27–41} }","ama":"Benter M, Böttcher S, Hartel R. Mixing Bottom-Up and Top-Down XPath Query Evaluation. In: <i>East European Conference on Advances in Databases and Information Systems</i>. Springer; 2011:27-41. doi:<a href=\"https://doi.org/10.1007/978-3-642-23737-9_3\">10.1007/978-3-642-23737-9_3</a>"},"publication":"East European Conference on Advances in Databases and Information Systems","_id":"15097","publisher":"Springer","language":[{"iso":"eng"}],"page":"27-41","doi":"10.1007/978-3-642-23737-9_3","user_id":"14961","author":[{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"first_name":"Stefan","last_name":"Böttcher","full_name":"Böttcher, Stefan","id":"624"},{"last_name":"Hartel","first_name":"Rita","full_name":"Hartel, Rita","id":"14961"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642237362","9783642237379"]},"title":"Mixing Bottom-Up and Top-Down XPath Query Evaluation","year":"2011","status":"public","date_updated":"2022-01-06T06:52:15Z","publication_status":"published"},{"citation":{"ama":"Bätz A, Böttcher S, Hartel R. Updates on Grammar-Compressed XML Data. In: <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>. Springer; 2011:154-166. doi:<a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">10.1007/978-3-642-24577-0_17</a>","short":"A. Bätz, S. Böttcher, R. Hartel, in: Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer, 2011, pp. 154–166.","chicago":"Bätz, Alexander, Stefan Böttcher, and Rita Hartel. “Updates on Grammar-Compressed XML Data.” In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 154–66. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">https://doi.org/10.1007/978-3-642-24577-0_17</a>.","bibtex":"@inproceedings{Bätz_Böttcher_Hartel_2011, title={Updates on Grammar-Compressed XML Data}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">10.1007/978-3-642-24577-0_17</a>}, booktitle={Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Bätz, Alexander and Böttcher, Stefan and Hartel, Rita}, year={2011}, pages={154–166} }","apa":"Bätz, A., Böttcher, S., &#38; Hartel, R. (2011). Updates on Grammar-Compressed XML Data. In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i> (pp. 154–166). Springer. <a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">https://doi.org/10.1007/978-3-642-24577-0_17</a>","mla":"Bätz, Alexander, et al. “Updates on Grammar-Compressed XML Data.” <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, Springer, 2011, pp. 154–66, doi:<a href=\"https://doi.org/10.1007/978-3-642-24577-0_17\">10.1007/978-3-642-24577-0_17</a>.","ieee":"A. Bätz, S. Böttcher, and R. Hartel, “Updates on Grammar-Compressed XML Data,” in <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 2011, pp. 154–166."},"publication":"Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers","department":[{"_id":"69"}],"type":"conference","date_created":"2019-11-21T15:30:41Z","date_updated":"2022-01-06T06:52:15Z","publication_status":"published","publication_identifier":{"isbn":["9783642245763","9783642245770"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Bätz, Alexander","first_name":"Alexander","last_name":"Bätz"},{"full_name":"Böttcher, Stefan","last_name":"Böttcher","first_name":"Stefan","id":"624"},{"id":"14961","full_name":"Hartel, Rita","first_name":"Rita","last_name":"Hartel"}],"status":"public","year":"2011","title":"Updates on Grammar-Compressed XML Data","doi":"10.1007/978-3-642-24577-0_17","user_id":"14961","language":[{"iso":"eng"}],"_id":"15099","publisher":"Springer","page":"154-166"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642245763","9783642245770"]},"author":[{"id":"624","first_name":"Stefan","last_name":"Böttcher","full_name":"Böttcher, Stefan"},{"last_name":"Hartel","first_name":"Rita","full_name":"Hartel, Rita","id":"14961"},{"first_name":"Sebastian","last_name":"Stey","full_name":"Stey, Sebastian"}],"status":"public","title":"TraCX: Transformation of Compressed XML","year":"2011","date_updated":"2022-01-06T06:52:15Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"15100","publisher":"Springer","page":"182-193","doi":"10.1007/978-3-642-24577-0_19","user_id":"14961","citation":{"mla":"Böttcher, Stefan, et al. “TraCX: Transformation of Compressed XML.” <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, Springer, 2011, pp. 182–93, doi:<a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">10.1007/978-3-642-24577-0_19</a>.","ama":"Böttcher S, Hartel R, Stey S. TraCX: Transformation of Compressed XML. In: <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>. Springer; 2011:182-193. doi:<a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">10.1007/978-3-642-24577-0_19</a>","bibtex":"@inproceedings{Böttcher_Hartel_Stey_2011, title={TraCX: Transformation of Compressed XML}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">10.1007/978-3-642-24577-0_19</a>}, booktitle={Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers}, publisher={Springer}, author={Böttcher, Stefan and Hartel, Rita and Stey, Sebastian}, year={2011}, pages={182–193} }","apa":"Böttcher, S., Hartel, R., &#38; Stey, S. (2011). TraCX: Transformation of Compressed XML. In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i> (pp. 182–193). Springer. <a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">https://doi.org/10.1007/978-3-642-24577-0_19</a>","ieee":"S. Böttcher, R. Hartel, and S. Stey, “TraCX: Transformation of Compressed XML,” in <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 2011, pp. 182–193.","chicago":"Böttcher, Stefan, Rita Hartel, and Sebastian Stey. “TraCX: Transformation of Compressed XML.” In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 182–93. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24577-0_19\">https://doi.org/10.1007/978-3-642-24577-0_19</a>.","short":"S. Böttcher, R. Hartel, S. Stey, in: Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer, 2011, pp. 182–193."},"publication":"Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers","date_created":"2019-11-21T15:31:36Z","department":[{"_id":"69"}],"type":"conference"},{"citation":{"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>.","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>","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} }","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.","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.","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>."},"publication":"Automata, Languages and Programming","abstract":[{"lang":"eng","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"}],"place":"Berlin, Heidelberg","date_created":"2020-04-06T07:47:55Z","department":[{"_id":"63"}],"type":"book_chapter","author":[{"full_name":"Cord-Landwehr, Andreas","first_name":"Andreas","last_name":"Cord-Landwehr"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"first_name":"Martina","last_name":"Hüllmann","full_name":"Hüllmann, Martina"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"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"},{"last_name":"Raupach","first_name":"Christoph","full_name":"Raupach, Christoph"},{"first_name":"Kamil","last_name":"Swierkot","full_name":"Swierkot, Kamil"},{"full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","last_name":"Weddemann","first_name":"Christoph"},{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642220111","9783642220128"]},"year":"2011","status":"public","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16409","doi":"10.1007/978-3-642-22012-8_52","user_id":"15415"},{"volume":5873,"user_id":"15415","_id":"19796","page":"624--639","status":"public","citation":{"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={<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>}, 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} }","ama":"Mense M, Schindelhauer C. Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In: <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>. Vol 5873. Lecture Notes in Computer Science. ; 2010:624--639. doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>","mla":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, vol. 5873, 2010, pp. 624--639, doi:<a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">10.1007/978-3-642-05118-0_43</a>.","chicago":"Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.” In <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 5873:624--639. Lecture Notes in Computer Science, 2010. <a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">https://doi.org/10.1007/978-3-642-05118-0_43</a>.","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 <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i>, 2010, vol. 5873, pp. 624--639.","apa":"Mense, M., &#38; Schindelhauer, C. (2010). Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks. In <i>Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems</i> (Vol. 5873, pp. 624--639). <a href=\"https://doi.org/10.1007/978-3-642-05118-0_43\">https://doi.org/10.1007/978-3-642-05118-0_43</a>"},"doi":"10.1007/978-3-642-05118-0_43","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"intvolume":"      5873","date_updated":"2022-01-06T06:54:12Z","publication_status":"published","author":[{"first_name":"Mario","last_name":"Mense","full_name":"Mense, Mario"},{"full_name":"Schindelhauer, Christian","first_name":"Christian","last_name":"Schindelhauer"}],"publication_identifier":{"isbn":["9783642051173","9783642051180"],"issn":["0302-9743","1611-3349"]},"year":"2010","title":"Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-30T12:12:33Z","abstract":[{"lang":"eng","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."}],"publication":"Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems"},{"_id":"20226","publisher":"Springer","page":"639-648","volume":6226,"user_id":"15415","status":"public","citation":{"ama":"Hamann H, Meyer B, Schmickl T, Crailsheim K. A Model of Symmetry Breaking in Collective Decision-Making. In: <i>From Animals to Animats 11</i>. Vol 6226. Springer; 2010:639-648. doi:<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>","bibtex":"@inproceedings{Hamann_Meyer_Schmickl_Crailsheim_2010, title={A Model of Symmetry Breaking in Collective Decision-Making}, volume={6226}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>}, booktitle={From Animals to Animats 11}, publisher={Springer}, author={Hamann, Heiko and Meyer, Bernd and Schmickl, Thomas and Crailsheim, Karl}, year={2010}, pages={639–648} }","mla":"Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.” <i>From Animals to Animats 11</i>, vol. 6226, Springer, 2010, pp. 639–48, doi:<a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">10.1007/978-3-642-15193-4_60</a>.","short":"H. Hamann, B. Meyer, T. Schmickl, K. Crailsheim, in: From Animals to Animats 11, Springer, 2010, pp. 639–648.","chicago":"Hamann, Heiko, Bernd Meyer, Thomas Schmickl, and Karl Crailsheim. “A Model of Symmetry Breaking in Collective Decision-Making.” In <i>From Animals to Animats 11</i>, 6226:639–48. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">https://doi.org/10.1007/978-3-642-15193-4_60</a>.","apa":"Hamann, H., Meyer, B., Schmickl, T., &#38; Crailsheim, K. (2010). A Model of Symmetry Breaking in Collective Decision-Making. In <i>From Animals to Animats 11</i> (Vol. 6226, pp. 639–648). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15193-4_60\">https://doi.org/10.1007/978-3-642-15193-4_60</a>","ieee":"H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in <i>From Animals to Animats 11</i>, 2010, vol. 6226, pp. 639–648."},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-15193-4_60","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"last_name":"Meyer","first_name":"Bernd","full_name":"Meyer, Bernd"},{"first_name":"Thomas","last_name":"Schmickl","full_name":"Schmickl, Thomas"},{"full_name":"Crailsheim, Karl","first_name":"Karl","last_name":"Crailsheim"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642151927","9783642151934"]},"title":"A Model of Symmetry Breaking in Collective Decision-Making","year":"2010","intvolume":"      6226","date_updated":"2022-01-06T06:54:24Z","publication_status":"published","date_created":"2020-10-29T14:22:12Z","department":[{"_id":"63"},{"_id":"238"}],"type":"conference","publication":"From Animals to Animats 11"}]