[{"type":"conference","publication":"Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings","status":"public","user_id":"38235","department":[{"_id":"558"}],"_id":"3143","extern":"1","citation":{"mla":"Gajek, Sebastian, et al. “A Browser-Based Kerberos Authentication Scheme.” <i>Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings</i>, 2008, pp. 115--129, doi:<a href=\"https://doi.org/10.1007/978-3-540-88313-5_8\">10.1007/978-3-540-88313-5_8</a>.","bibtex":"@inproceedings{Gajek_Jager_Manulis_Schwenk_2008, title={A Browser-Based Kerberos Authentication Scheme}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-88313-5_8\">10.1007/978-3-540-88313-5_8</a>}, booktitle={Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings}, author={Gajek, Sebastian and Jager, Tibor and Manulis, Mark and Schwenk, Jörg}, year={2008}, pages={115--129} }","short":"S. Gajek, T. Jager, M. Manulis, J. Schwenk, in: Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings, 2008, pp. 115--129.","apa":"Gajek, S., Jager, T., Manulis, M., &#38; Schwenk, J. (2008). A Browser-Based Kerberos Authentication Scheme. In <i>Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings</i> (pp. 115--129). <a href=\"https://doi.org/10.1007/978-3-540-88313-5_8\">https://doi.org/10.1007/978-3-540-88313-5_8</a>","chicago":"Gajek, Sebastian, Tibor Jager, Mark Manulis, and Jörg Schwenk. “A Browser-Based Kerberos Authentication Scheme.” In <i>Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings</i>, 115--129, 2008. <a href=\"https://doi.org/10.1007/978-3-540-88313-5_8\">https://doi.org/10.1007/978-3-540-88313-5_8</a>.","ieee":"S. Gajek, T. Jager, M. Manulis, and J. Schwenk, “A Browser-Based Kerberos Authentication Scheme,” in <i>Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings</i>, 2008, pp. 115--129.","ama":"Gajek S, Jager T, Manulis M, Schwenk J. A Browser-Based Kerberos Authentication Scheme. In: <i>Computer Security - ESORICS 2008, 13th European Symposium on Research in Computer Security, Málaga, Spain, October 6-8, 2008. Proceedings</i>. ; 2008:115--129. doi:<a href=\"https://doi.org/10.1007/978-3-540-88313-5_8\">10.1007/978-3-540-88313-5_8</a>"},"page":"115--129","year":"2008","author":[{"first_name":"Sebastian","full_name":"Gajek, Sebastian","last_name":"Gajek"},{"first_name":"Tibor","full_name":"Jager, Tibor","id":"64669","last_name":"Jager"},{"full_name":"Manulis, Mark","last_name":"Manulis","first_name":"Mark"},{"full_name":"Schwenk, Jörg","last_name":"Schwenk","first_name":"Jörg"}],"date_created":"2018-06-07T09:30:48Z","date_updated":"2022-01-06T06:58:58Z","doi":"10.1007/978-3-540-88313-5_8","title":"A Browser-Based Kerberos Authentication Scheme"},{"date_updated":"2022-01-06T06:58:58Z","date_created":"2018-06-07T09:32:07Z","author":[{"first_name":"Kristina","last_name":"Altmann","full_name":"Altmann, Kristina"},{"first_name":"Tibor","last_name":"Jager","id":"64669","full_name":"Jager, Tibor"},{"last_name":"Rupp","full_name":"Rupp, Andy","first_name":"Andy"}],"title":"On Black-Box Ring Extraction and Integer Factorization","doi":"10.1007/978-3-540-70583-3_36","year":"2008","page":"437--448","citation":{"short":"K. Altmann, T. Jager, A. Rupp, in: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming &#38; Track C: Security and Cryptography Foundations, 2008, pp. 437--448.","bibtex":"@inproceedings{Altmann_Jager_Rupp_2008, title={On Black-Box Ring Extraction and Integer Factorization}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-70583-3_36\">10.1007/978-3-540-70583-3_36</a>}, booktitle={Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming &#38; Track C: Security and Cryptography Foundations}, author={Altmann, Kristina and Jager, Tibor and Rupp, Andy}, year={2008}, pages={437--448} }","mla":"Altmann, Kristina, et al. “On Black-Box Ring Extraction and Integer Factorization.” <i>Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming &#38; Track C: Security and Cryptography Foundations</i>, 2008, pp. 437--448, doi:<a href=\"https://doi.org/10.1007/978-3-540-70583-3_36\">10.1007/978-3-540-70583-3_36</a>.","apa":"Altmann, K., Jager, T., &#38; Rupp, A. (2008). On Black-Box Ring Extraction and Integer Factorization. In <i>Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming &#38; Track C: Security and Cryptography Foundations</i> (pp. 437--448). <a href=\"https://doi.org/10.1007/978-3-540-70583-3_36\">https://doi.org/10.1007/978-3-540-70583-3_36</a>","ama":"Altmann K, Jager T, Rupp A. On Black-Box Ring Extraction and Integer Factorization. In: <i>Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming &#38; Track C: Security and Cryptography Foundations</i>. ; 2008:437--448. doi:<a href=\"https://doi.org/10.1007/978-3-540-70583-3_36\">10.1007/978-3-540-70583-3_36</a>","chicago":"Altmann, Kristina, Tibor Jager, and Andy Rupp. “On Black-Box Ring Extraction and Integer Factorization.” In <i>Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming &#38; Track C: Security and Cryptography Foundations</i>, 437--448, 2008. <a href=\"https://doi.org/10.1007/978-3-540-70583-3_36\">https://doi.org/10.1007/978-3-540-70583-3_36</a>.","ieee":"K. Altmann, T. Jager, and A. Rupp, “On Black-Box Ring Extraction and Integer Factorization,” in <i>Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming &#38; Track C: Security and Cryptography Foundations</i>, 2008, pp. 437--448."},"_id":"3144","department":[{"_id":"558"}],"user_id":"38235","extern":"1","publication":"Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations","type":"conference","status":"public"},{"doi":"10.1007/978-3-540-88733-1_14","title":"On the Equivalence of Generic Group Models","date_created":"2018-06-07T09:32:53Z","author":[{"id":"64669","full_name":"Jager, Tibor","last_name":"Jager","first_name":"Tibor"},{"last_name":"Schwenk","full_name":"Schwenk, Jörg","first_name":"Jörg"}],"date_updated":"2022-01-06T06:58:58Z","citation":{"ama":"Jager T, Schwenk J. On the Equivalence of Generic Group Models. In: <i>Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings</i>. ; 2008:200--209. doi:<a href=\"https://doi.org/10.1007/978-3-540-88733-1_14\">10.1007/978-3-540-88733-1_14</a>","chicago":"Jager, Tibor, and Jörg Schwenk. “On the Equivalence of Generic Group Models.” In <i>Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings</i>, 200--209, 2008. <a href=\"https://doi.org/10.1007/978-3-540-88733-1_14\">https://doi.org/10.1007/978-3-540-88733-1_14</a>.","ieee":"T. Jager and J. Schwenk, “On the Equivalence of Generic Group Models,” in <i>Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings</i>, 2008, pp. 200--209.","bibtex":"@inproceedings{Jager_Schwenk_2008, title={On the Equivalence of Generic Group Models}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-88733-1_14\">10.1007/978-3-540-88733-1_14</a>}, booktitle={Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings}, author={Jager, Tibor and Schwenk, Jörg}, year={2008}, pages={200--209} }","mla":"Jager, Tibor, and Jörg Schwenk. “On the Equivalence of Generic Group Models.” <i>Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings</i>, 2008, pp. 200--209, doi:<a href=\"https://doi.org/10.1007/978-3-540-88733-1_14\">10.1007/978-3-540-88733-1_14</a>.","short":"T. Jager, J. Schwenk, in: Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings, 2008, pp. 200--209.","apa":"Jager, T., &#38; Schwenk, J. (2008). On the Equivalence of Generic Group Models. In <i>Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings</i> (pp. 200--209). <a href=\"https://doi.org/10.1007/978-3-540-88733-1_14\">https://doi.org/10.1007/978-3-540-88733-1_14</a>"},"page":"200--209","year":"2008","extern":"1","user_id":"38235","department":[{"_id":"558"}],"_id":"3145","status":"public","type":"conference","publication":"Provable Security, Second International Conference, ProvSec 2008, Shanghai, China, October 30 - November 1, 2008. Proceedings"},{"type":"working_paper","status":"public","_id":"2737","user_id":"135","series_title":"Research paper / UNU-WIDER ","department":[{"_id":"475"},{"_id":"200"},{"_id":"202"}],"publication_identifier":{"isbn":["978-92-9230-116-3"]},"year":"2008","citation":{"mla":"Gries, Thomas, and Margarete Redlin. <i>International Integration and Regional Development in China </i>. Vol. 2008.66, WIDER Research Papers, United Nations University (UNU), 2008.","bibtex":"@book{Gries_Redlin_2008, series={Research paper / UNU-WIDER }, title={International integration and regional development in China }, volume={2008.66}, publisher={WIDER Research Papers, United Nations University (UNU)}, author={Gries, Thomas and Redlin, Margarete}, year={2008}, collection={Research paper / UNU-WIDER } }","short":"T. Gries, M. Redlin, International Integration and Regional Development in China , WIDER Research Papers, United Nations University (UNU), 2008.","apa":"Gries, T., &#38; Redlin, M. (2008). <i>International integration and regional development in China </i> (Vol. 2008.66). WIDER Research Papers, United Nations University (UNU).","chicago":"Gries, Thomas, and Margarete Redlin. <i>International Integration and Regional Development in China </i>. Vol. 2008.66. Research Paper / UNU-WIDER . WIDER Research Papers, United Nations University (UNU), 2008.","ieee":"T. Gries and M. Redlin, <i>International integration and regional development in China </i>, vol. 2008.66. WIDER Research Papers, United Nations University (UNU), 2008.","ama":"Gries T, Redlin M. <i>International Integration and Regional Development in China </i>. Vol 2008.66. WIDER Research Papers, United Nations University (UNU); 2008."},"page":"37","date_updated":"2022-01-06T06:57:38Z","publisher":"WIDER Research Papers, United Nations University (UNU)","oa":"1","date_created":"2018-05-14T08:12:22Z","author":[{"first_name":"Thomas","full_name":"Gries, Thomas","last_name":"Gries"},{"first_name":"Margarete","last_name":"Redlin","full_name":"Redlin, Margarete","id":"135"}],"volume":"2008.66","title":"International integration and regional development in China ","main_file_link":[{"open_access":"1","url":"https://www.econstor.eu/handle/10419/45083"}]},{"language":[{"iso":"ger"}],"_id":"17465","department":[{"_id":"520"}],"user_id":"14932","editor":[{"id":"391","full_name":"Peckhaus, Volker","last_name":"Peckhaus","first_name":"Volker"},{"full_name":"Bernhard, Peter","last_name":"Bernhard","first_name":"Peter"}],"status":"public","type":"book_editor","title":"Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges","date_updated":"2022-01-06T06:53:12Z","publisher":"mentis Verlag","date_created":"2020-07-30T07:45:49Z","place":"Paderborn","year":"2008","page":"471","citation":{"ama":"Peckhaus V, Bernhard P, eds. <i>Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges</i>. Paderborn: mentis Verlag; 2008.","ieee":"V. Peckhaus and P. Bernhard, Eds., <i>Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges</i>. Paderborn: mentis Verlag, 2008.","chicago":"Peckhaus, Volker, and Peter Bernhard, eds. <i>Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges</i>. Paderborn: mentis Verlag, 2008.","short":"V. Peckhaus, P. Bernhard, eds., Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges, mentis Verlag, Paderborn, 2008.","mla":"Peckhaus, Volker, and Peter Bernhard, editors. <i>Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges</i>. mentis Verlag, 2008.","bibtex":"@book{Peckhaus_Bernhard_2008, place={Paderborn}, title={Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges}, publisher={mentis Verlag}, year={2008} }","apa":"Peckhaus, V., &#38; Bernhard, P. (Eds.). (2008). <i>Methodisches Denken im Kontext. Festschrift für Christian Thiel, mit einem unveröffentlichten Brief Gottlob Freges</i>. Paderborn: mentis Verlag."},"publication_identifier":{"isbn":["978-3-89785-594-6"]}},{"date_created":"2020-08-12T13:39:37Z","author":[{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"full_name":"Huber, Daniel","last_name":"Huber","first_name":"Daniel"},{"last_name":"Laroque","full_name":"Laroque, Christoph","first_name":"Christoph"},{"last_name":"Suess","full_name":"Suess, Tim","first_name":"Tim"}],"date_updated":"2022-01-06T06:53:22Z","doi":"10.1109/wsc.2008.4736296","title":"Aggregated 3D-visualization of a distributed simulation experiment of a queuing system","publication_status":"published","publication_identifier":{"isbn":["9781424427079"]},"citation":{"bibtex":"@inproceedings{Dangelmaier_Fischer_Huber_Laroque_Suess_2008, place={Miami, FL., USA}, title={Aggregated 3D-visualization of a distributed simulation experiment of a queuing system}, DOI={<a href=\"https://doi.org/10.1109/wsc.2008.4736296\">10.1109/wsc.2008.4736296</a>}, booktitle={2008 Winter Simulation Conference}, author={Dangelmaier, Wilhelm and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Suess, Tim}, year={2008}, pages={2012–2020} }","short":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Suess, in: 2008 Winter Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.","mla":"Dangelmaier, Wilhelm, et al. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.” <i>2008 Winter Simulation Conference</i>, 2008, pp. 2012–20, doi:<a href=\"https://doi.org/10.1109/wsc.2008.4736296\">10.1109/wsc.2008.4736296</a>.","apa":"Dangelmaier, W., Fischer, M., Huber, D., Laroque, C., &#38; Suess, T. (2008). Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. <i>2008 Winter Simulation Conference</i>, 2012–2020. <a href=\"https://doi.org/10.1109/wsc.2008.4736296\">https://doi.org/10.1109/wsc.2008.4736296</a>","ama":"Dangelmaier W, Fischer M, Huber D, Laroque C, Suess T. Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. In: <i>2008 Winter Simulation Conference</i>. ; 2008:2012-2020. doi:<a href=\"https://doi.org/10.1109/wsc.2008.4736296\">10.1109/wsc.2008.4736296</a>","ieee":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, and T. Suess, “Aggregated 3D-visualization of a distributed simulation experiment of a queuing system,” in <i>2008 Winter Simulation Conference</i>, 2008, pp. 2012–2020, doi: <a href=\"https://doi.org/10.1109/wsc.2008.4736296\">10.1109/wsc.2008.4736296</a>.","chicago":"Dangelmaier, Wilhelm, Matthias Fischer, Daniel Huber, Christoph Laroque, and Tim Suess. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.” In <i>2008 Winter Simulation Conference</i>, 2012–20. Miami, FL., USA, 2008. <a href=\"https://doi.org/10.1109/wsc.2008.4736296\">https://doi.org/10.1109/wsc.2008.4736296</a>."},"page":"2012-2020","year":"2008","place":"Miami, FL., USA","user_id":"15415","department":[{"_id":"63"}],"_id":"17868","language":[{"iso":"eng"}],"type":"conference","publication":"2008 Winter Simulation Conference","status":"public","abstract":[{"lang":"eng","text":"The paper describes an approach for an aggregated animation of a simulation experiment in an interactive 3D environment, visualizing multiple, distributed simulation runs. Although the general approach of a 3-dimensional visualization of material flow simulation helps to understand the dynamic behavior of a system better as well as faster, it remains unclear, how typical the animated simulation represents the model, if there is a stochastic influence for even some parameters. By the integrated visualization of multiple distributed simulation runs, this uncertainty can be solved, which will be shown in this paper for a typical simulation study of a queuing system. "}]},{"status":"public","publication":"Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)","type":"conference","language":[{"iso":"eng"}],"_id":"19003","department":[{"_id":"63"}],"user_id":"15415","year":"2008","page":"378-389","citation":{"ama":"Degener B, Gehweiler J, Lammersen C. The Kinetic Facility Location Problem. In: <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>. ; 2008:378-389. doi:<a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">10.1007/978-3-540-69903-3_34</a>","chicago":"Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic Facility Location Problem.” In <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>, 378–89, 2008. <a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">https://doi.org/10.1007/978-3-540-69903-3_34</a>.","ieee":"B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location Problem,” in <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>, 2008, pp. 378–389.","apa":"Degener, B., Gehweiler, J., &#38; Lammersen, C. (2008). The Kinetic Facility Location Problem. In <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i> (pp. 378–389). <a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">https://doi.org/10.1007/978-3-540-69903-3_34</a>","short":"B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.","bibtex":"@inproceedings{Degener_Gehweiler_Lammersen_2008, title={The Kinetic Facility Location Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">10.1007/978-3-540-69903-3_34</a>}, booktitle={Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}, author={Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}, year={2008}, pages={378–389} }","mla":"Degener, Bastian, et al. “The Kinetic Facility Location Problem.” <i>Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)</i>, 2008, pp. 378–89, doi:<a href=\"https://doi.org/10.1007/978-3-540-69903-3_34\">10.1007/978-3-540-69903-3_34</a>."},"publication_identifier":{"isbn":["9783540699002","9783540699033"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","title":"The Kinetic Facility Location Problem","doi":"10.1007/978-3-540-69903-3_34","date_updated":"2022-01-06T06:53:57Z","author":[{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"},{"first_name":"Christiane","full_name":"Lammersen, Christiane","last_name":"Lammersen"}],"date_created":"2020-09-04T10:04:49Z"},{"page":"251-254","citation":{"chicago":"Gehweiler, Joachim, Christiane Lammersen, and Bastian Degener. “The Kinetic Facility Location Problem.” In <i>Proceedings of the 24th European Workshop on Computational Geometry</i>, 251–54, 2008.","ieee":"J. Gehweiler, C. Lammersen, and B. Degener, “The Kinetic Facility Location Problem,” in <i>Proceedings of the 24th European Workshop on Computational Geometry</i>, 2008, pp. 251–254.","ama":"Gehweiler J, Lammersen C, Degener B. The Kinetic Facility Location Problem. In: <i>Proceedings of the 24th European Workshop on Computational Geometry</i>. ; 2008:251-254.","bibtex":"@inproceedings{Gehweiler_Lammersen_Degener_2008, title={The Kinetic Facility Location Problem}, booktitle={Proceedings of the 24th European Workshop on Computational Geometry}, author={Gehweiler, Joachim and Lammersen, Christiane and Degener, Bastian}, year={2008}, pages={251–254} }","mla":"Gehweiler, Joachim, et al. “The Kinetic Facility Location Problem.” <i>Proceedings of the 24th European Workshop on Computational Geometry</i>, 2008, pp. 251–54.","short":"J. Gehweiler, C. Lammersen, B. Degener, in: Proceedings of the 24th European Workshop on Computational Geometry, 2008, pp. 251–254.","apa":"Gehweiler, J., Lammersen, C., &#38; Degener, B. (2008). The Kinetic Facility Location Problem. In <i>Proceedings of the 24th European Workshop on Computational Geometry</i> (pp. 251–254)."},"year":"2008","title":"The Kinetic Facility Location Problem","author":[{"full_name":"Gehweiler, Joachim","last_name":"Gehweiler","first_name":"Joachim"},{"full_name":"Lammersen, Christiane","last_name":"Lammersen","first_name":"Christiane"},{"last_name":"Degener","full_name":"Degener, Bastian","first_name":"Bastian"}],"date_created":"2020-09-04T10:11:39Z","date_updated":"2022-01-06T06:53:57Z","status":"public","abstract":[{"lang":"eng","text":"We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the sum of the maintenance cost for the facilities and the connection cost for the clients is at most a constant factor larger than the current optimal cost. In our scenario, each point can open a facility and moves continuously along a known trajectory in a d-dimensional Euclidean space where d is a constant.\r\n\r\nOur kinetic data structure has a storage requirement of O(n (log^d(n)+log(nR))), where n is the number of points and R is the ratio of the product of the maximum maintenance cost and demand to the product of their corresponding minimum values. In the case that each trajectory can be described by a bounded degree polynomial, the data structure processes O(n^2 log^2(nR)) events, each requiring only O(log(nR)) facility changes and O(log^(d+1)(n) log(nR)) time. This results in a total processing time of O(n^2 log^(d+1)(n) log^3(nR)). To the best of our knowledge, this is the first kinetic data structure for the facility location problem."}],"publication":"Proceedings of the 24th European Workshop on Computational Geometry","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"19004"},{"_id":"1941","department":[{"_id":"79"}],"user_id":"15504","series_title":"Lecture Notes in Computer Science","publication":"Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings","type":"conference","status":"public","date_updated":"2022-01-06T06:54:03Z","publisher":"Springer","volume":5340,"date_created":"2018-03-29T09:31:18Z","author":[{"first_name":"Thomas","last_name":"Clouser","full_name":"Clouser, Thomas"},{"first_name":"Mikhail","full_name":"Nesterenko, Mikhail","last_name":"Nesterenko"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"title":"Tiara: A Self-stabilizing Deterministic Skip List","doi":"10.1007/978-3-540-89335-6_12","publication_identifier":{"isbn":["978-3-540-89334-9"]},"year":"2008","page":"124--140","intvolume":"      5340","citation":{"apa":"Clouser, T., Nesterenko, M., &#38; Scheideler, C. (2008). Tiara: A Self-stabilizing Deterministic Skip List. In <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i> (Vol. 5340, pp. 124--140). Springer. <a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">https://doi.org/10.1007/978-3-540-89335-6_12</a>","bibtex":"@inproceedings{Clouser_Nesterenko_Scheideler_2008, series={Lecture Notes in Computer Science}, title={Tiara: A Self-stabilizing Deterministic Skip List}, volume={5340}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">10.1007/978-3-540-89335-6_12</a>}, booktitle={Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings}, publisher={Springer}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2008}, pages={124--140}, collection={Lecture Notes in Computer Science} }","mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List.” <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i>, vol. 5340, Springer, 2008, pp. 124--140, doi:<a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">10.1007/978-3-540-89335-6_12</a>.","short":"T. Clouser, M. Nesterenko, C. Scheideler, in: Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings, Springer, 2008, pp. 124--140.","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A Self-stabilizing Deterministic Skip List,” in <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i>, 2008, vol. 5340, pp. 124--140.","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List.” In <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i>, 5340:124--140. Lecture Notes in Computer Science. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">https://doi.org/10.1007/978-3-540-89335-6_12</a>.","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A Self-stabilizing Deterministic Skip List. In: <i>Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings</i>. Vol 5340. Lecture Notes in Computer Science. Springer; 2008:124--140. doi:<a href=\"https://doi.org/10.1007/978-3-540-89335-6_12\">10.1007/978-3-540-89335-6_12</a>"}},{"department":[{"_id":"79"}],"user_id":"15504","series_title":"eXamen.press","_id":"1942","publication":"Taschenbuch der Algorithmen","type":"book_chapter","status":"public","date_created":"2018-03-29T09:32:34Z","author":[{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"publisher":"Springer","date_updated":"2022-01-06T06:54:03Z","doi":"10.1007/978-3-540-76394-9_22","title":"Broadcasting: Wie verbreite ich schnell Informationen?","publication_identifier":{"isbn":["978-3-540-76393-2"]},"page":"229--236","citation":{"chicago":"Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” In <i>Taschenbuch Der Algorithmen</i>, 229--236. EXamen.Press. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">https://doi.org/10.1007/978-3-540-76394-9_22</a>.","ieee":"C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,” in <i>Taschenbuch der Algorithmen</i>, Springer, 2008, pp. 229--236.","ama":"Scheideler C. Broadcasting: Wie verbreite ich schnell Informationen? In: <i>Taschenbuch Der Algorithmen</i>. eXamen.press. Springer; 2008:229--236. doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">10.1007/978-3-540-76394-9_22</a>","mla":"Scheideler, Christian. “Broadcasting: Wie Verbreite Ich Schnell Informationen?” <i>Taschenbuch Der Algorithmen</i>, Springer, 2008, pp. 229--236, doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">10.1007/978-3-540-76394-9_22</a>.","short":"C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.","bibtex":"@inbook{Scheideler_2008, series={eXamen.press}, title={Broadcasting: Wie verbreite ich schnell Informationen?}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">10.1007/978-3-540-76394-9_22</a>}, booktitle={Taschenbuch der Algorithmen}, publisher={Springer}, author={Scheideler, Christian}, year={2008}, pages={229--236}, collection={eXamen.press} }","apa":"Scheideler, C. (2008). Broadcasting: Wie verbreite ich schnell Informationen? In <i>Taschenbuch der Algorithmen</i> (pp. 229--236). Springer. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_22\">https://doi.org/10.1007/978-3-540-76394-9_22</a>"},"year":"2008"},{"year":"2008","intvolume":"       133","citation":{"apa":"Hegering, H.-G., Lehmann, A., Jürgen Ohlbach, H., &#38; Scheideler, C. (Eds.). (2008). <i>INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i> (Vol. 133).","mla":"Hegering, Heinz-Gerd, et al., editors. <i>INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i>. Vol. 133, 2008.","bibtex":"@book{Hegering_Lehmann_Jürgen Ohlbach_Scheideler_2008, series={LNI}, title={INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland}, volume={133}, year={2008}, collection={LNI} }","short":"H.-G. Hegering, A. Lehmann, H. Jürgen Ohlbach, C. Scheideler, eds., INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland, 2008.","ama":"Hegering H-G, Lehmann A, Jürgen Ohlbach H, Scheideler C, eds. <i>INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i>. Vol 133.; 2008.","chicago":"Hegering, Heinz-Gerd, Axel Lehmann, Hans Jürgen Ohlbach, and Christian Scheideler, eds. <i>INFORMATIK 2008, Beherrschbare Systeme - Dank Informatik, Band 1, Beiträge Der 38. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i>. Vol. 133. LNI, 2008.","ieee":"H.-G. Hegering, A. Lehmann, H. Jürgen Ohlbach, and C. Scheideler, Eds., <i>INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland</i>, vol. 133. 2008."},"publication_identifier":{"isbn":["978-3-88579-227-7"]},"title":"INFORMATIK 2008, Beherrschbare Systeme - dank Informatik, Band 1, Beiträge der 38. Jahrestagung der Gesellschaft für Informatik e.V. (GI), 8. - 13. September, in München, Deutschland","date_updated":"2022-01-06T06:54:03Z","volume":133,"date_created":"2018-03-29T09:33:42Z","editor":[{"first_name":"Heinz-Gerd","last_name":"Hegering","full_name":"Hegering, Heinz-Gerd"},{"last_name":"Lehmann","full_name":"Lehmann, Axel","first_name":"Axel"},{"full_name":"Jürgen Ohlbach, Hans","last_name":"Jürgen Ohlbach","first_name":"Hans"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"status":"public","type":"conference_editor","_id":"1943","department":[{"_id":"79"}],"series_title":"LNI","user_id":"15504"},{"status":"public","type":"book","user_id":"15504","series_title":"eXamen.press","department":[{"_id":"79"}],"_id":"1945","citation":{"bibtex":"@book{Vöcking_Alt_Dietzfelbinger_Reischuk_Scheideler_Vollmer_Wagner_2008, series={eXamen.press}, title={Taschenbuch der Algorithmen}, author={Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}, year={2008}, collection={eXamen.press} }","mla":"Vöcking, Berthold, et al. <i>Taschenbuch Der Algorithmen</i>. 2008.","short":"B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Taschenbuch Der Algorithmen, 2008.","apa":"Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H., &#38; Wagner, D. (2008). <i>Taschenbuch der Algorithmen</i>.","ieee":"B. Vöcking <i>et al.</i>, <i>Taschenbuch der Algorithmen</i>. 2008.","chicago":"Vöcking, Berthold, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, and Dorothea Wagner. <i>Taschenbuch Der Algorithmen</i>. EXamen.Press, 2008.","ama":"Vöcking B, Alt H, Dietzfelbinger M, et al. <i>Taschenbuch Der Algorithmen</i>.; 2008."},"year":"2008","publication_identifier":{"isbn":["978-3-540-76393-2"]},"main_file_link":[{"url":"http://www.springer.com/de/book/9783540763932"}],"title":"Taschenbuch der Algorithmen","date_created":"2018-03-29T09:39:00Z","author":[{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"},{"first_name":"Helmut","last_name":"Alt","full_name":"Alt, Helmut"},{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin","first_name":"Martin"},{"first_name":"Rüdiger","last_name":"Reischuk","full_name":"Reischuk, Rüdiger"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"full_name":"Vollmer, Heribert","last_name":"Vollmer","first_name":"Heribert"},{"full_name":"Wagner, Dorothea","last_name":"Wagner","first_name":"Dorothea"}],"date_updated":"2022-01-06T06:54:05Z"},{"publication":"Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)","type":"conference","status":"public","_id":"2355","department":[{"_id":"27"}],"user_id":"24135","place":"Berlin / Heidelberg","year":"2008","page":"551-554","citation":{"apa":"Brinkmann, A., &#38; Effert, S. (2008). Redundant Data Placement Strategies for Cluster Storage Environments. In <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i> (pp. 551–554). Berlin / Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-92221-6_38\">https://doi.org/10.1007/978-3-540-92221-6_38</a>","short":"A. Brinkmann, S. Effert, in: Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS), Springer, Berlin / Heidelberg, 2008, pp. 551–554.","mla":"Brinkmann, André, and Sascha Effert. “Redundant Data Placement Strategies for Cluster Storage Environments.” <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i>, Springer, 2008, pp. 551–54, doi:<a href=\"https://doi.org/10.1007/978-3-540-92221-6_38\">10.1007/978-3-540-92221-6_38</a>.","bibtex":"@inproceedings{Brinkmann_Effert_2008, place={Berlin / Heidelberg}, title={Redundant Data Placement Strategies for Cluster Storage Environments}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-92221-6_38\">10.1007/978-3-540-92221-6_38</a>}, booktitle={Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)}, publisher={Springer}, author={Brinkmann, André and Effert, Sascha}, year={2008}, pages={551–554} }","ama":"Brinkmann A, Effert S. Redundant Data Placement Strategies for Cluster Storage Environments. In: <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i>. Berlin / Heidelberg: Springer; 2008:551-554. doi:<a href=\"https://doi.org/10.1007/978-3-540-92221-6_38\">10.1007/978-3-540-92221-6_38</a>","chicago":"Brinkmann, André, and Sascha Effert. “Redundant Data Placement Strategies for Cluster Storage Environments.” In <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i>, 551–54. Berlin / Heidelberg: Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-92221-6_38\">https://doi.org/10.1007/978-3-540-92221-6_38</a>.","ieee":"A. Brinkmann and S. Effert, “Redundant Data Placement Strategies for Cluster Storage Environments,” in <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i>, 2008, pp. 551–554."},"date_updated":"2022-01-06T06:55:56Z","publisher":"Springer","author":[{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Effert","full_name":"Effert, Sascha","first_name":"Sascha"}],"date_created":"2018-04-17T09:40:20Z","title":"Redundant Data Placement Strategies for Cluster Storage Environments","doi":"10.1007/978-3-540-92221-6_38"},{"type":"conference","publication":"Proc. Int. Symp. on Visual Computing (ISVC)","status":"public","user_id":"24135","series_title":"Lecture Notes in Computer Science (LNCS)","department":[{"_id":"27"}],"_id":"2383","citation":{"chicago":"Lietsch, Stefan, and Paul Hermann Lensing. “GPU-Supported Image Compression for Remote Visualization - Realization and Benchmarking.” In <i>Proc. Int. Symp. on Visual Computing (ISVC)</i>, 5358:658–68. Lecture Notes in Computer Science (LNCS). Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-89639-5_63\">https://doi.org/10.1007/978-3-540-89639-5_63</a>.","ieee":"S. Lietsch and P. Hermann Lensing, “GPU-Supported Image Compression for Remote Visualization - Realization and Benchmarking,” in <i>Proc. Int. Symp. on Visual Computing (ISVC)</i>, 2008, vol. 5358, pp. 658–668.","ama":"Lietsch S, Hermann Lensing P. GPU-Supported Image Compression for Remote Visualization - Realization and Benchmarking. In: <i>Proc. Int. Symp. on Visual Computing (ISVC)</i>. Vol 5358. Lecture Notes in Computer Science (LNCS). Springer; 2008:658-668. doi:<a href=\"https://doi.org/10.1007/978-3-540-89639-5_63\">10.1007/978-3-540-89639-5_63</a>","bibtex":"@inproceedings{Lietsch_Hermann Lensing_2008, series={Lecture Notes in Computer Science (LNCS)}, title={GPU-Supported Image Compression for Remote Visualization - Realization and Benchmarking}, volume={5358}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-89639-5_63\">10.1007/978-3-540-89639-5_63</a>}, booktitle={Proc. Int. Symp. on Visual Computing (ISVC)}, publisher={Springer}, author={Lietsch, Stefan and Hermann Lensing, Paul}, year={2008}, pages={658–668}, collection={Lecture Notes in Computer Science (LNCS)} }","short":"S. Lietsch, P. Hermann Lensing, in: Proc. Int. Symp. on Visual Computing (ISVC), Springer, 2008, pp. 658–668.","mla":"Lietsch, Stefan, and Paul Hermann Lensing. “GPU-Supported Image Compression for Remote Visualization - Realization and Benchmarking.” <i>Proc. Int. Symp. on Visual Computing (ISVC)</i>, vol. 5358, Springer, 2008, pp. 658–68, doi:<a href=\"https://doi.org/10.1007/978-3-540-89639-5_63\">10.1007/978-3-540-89639-5_63</a>.","apa":"Lietsch, S., &#38; Hermann Lensing, P. (2008). GPU-Supported Image Compression for Remote Visualization - Realization and Benchmarking. In <i>Proc. Int. Symp. on Visual Computing (ISVC)</i> (Vol. 5358, pp. 658–668). Springer. <a href=\"https://doi.org/10.1007/978-3-540-89639-5_63\">https://doi.org/10.1007/978-3-540-89639-5_63</a>"},"page":"658-668","intvolume":"      5358","year":"2008","date_created":"2018-04-17T12:28:48Z","author":[{"full_name":"Lietsch, Stefan","last_name":"Lietsch","first_name":"Stefan"},{"first_name":"Paul","full_name":"Hermann Lensing, Paul","last_name":"Hermann Lensing"}],"volume":5358,"date_updated":"2022-01-06T06:56:01Z","publisher":"Springer","doi":"10.1007/978-3-540-89639-5_63","title":"GPU-Supported Image Compression for Remote Visualization - Realization and Benchmarking"},{"publication":"Augmented & Virtual Reality in der Produktentstehung","type":"book_chapter","status":"public","_id":"2384","department":[{"_id":"27"}],"user_id":"24135","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","publication_identifier":{"isbn":["978-3-939350-51-4"]},"year":"2008","place":"Paderborn, Germany","page":"221-239","intvolume":"       232","citation":{"ieee":"C. Laroque, S. Lietsch, and H. Zabel, “Computational Steering verteilter, interaktiver Materialflusssimulationen,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, vol. 232, Paderborn, Germany: Heinz Nixdorf Institut, 2008, pp. 221–239.","chicago":"Laroque, Christoph, Stefan Lietsch, and Henning Zabel. “Computational Steering Verteilter, Interaktiver Materialflusssimulationen.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 232:221–39. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn, Germany: Heinz Nixdorf Institut, 2008.","ama":"Laroque C, Lietsch S, Zabel H. Computational Steering verteilter, interaktiver Materialflusssimulationen. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 232. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Paderborn, Germany: Heinz Nixdorf Institut; 2008:221-239.","bibtex":"@inbook{Laroque_Lietsch_Zabel_2008, place={Paderborn, Germany}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Computational Steering verteilter, interaktiver Materialflusssimulationen}, volume={232}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Heinz Nixdorf Institut}, author={Laroque, Christoph and Lietsch, Stefan and Zabel, Henning}, year={2008}, pages={221–239}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","short":"C. Laroque, S. Lietsch, H. Zabel, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Heinz Nixdorf Institut, Paderborn, Germany, 2008, pp. 221–239.","mla":"Laroque, Christoph, et al. “Computational Steering Verteilter, Interaktiver Materialflusssimulationen.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 232, Heinz Nixdorf Institut, 2008, pp. 221–39.","apa":"Laroque, C., Lietsch, S., &#38; Zabel, H. (2008). Computational Steering verteilter, interaktiver Materialflusssimulationen. In <i>Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 232, pp. 221–239). Paderborn, Germany: Heinz Nixdorf Institut."},"publisher":"Heinz Nixdorf Institut","date_updated":"2022-01-06T06:56:01Z","volume":232,"author":[{"last_name":"Laroque","full_name":"Laroque, Christoph","first_name":"Christoph"},{"first_name":"Stefan","last_name":"Lietsch","full_name":"Lietsch, Stefan"},{"full_name":"Zabel, Henning","last_name":"Zabel","first_name":"Henning"}],"date_created":"2018-04-17T12:31:24Z","title":"Computational Steering verteilter, interaktiver Materialflusssimulationen"},{"year":"2008","place":"Berlin / Heidelberg","citation":{"bibtex":"@inproceedings{Bienkowski_Brinkmann_Korzeniowski_2008, place={Berlin / Heidelberg}, title={Degree 3 Suffices: A Large-Scale Overlay for P2P Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-92221-6_13\">10.1007/978-3-540-92221-6_13</a>}, booktitle={Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)}, publisher={Springer}, author={Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw}, year={2008}, pages={184–196} }","mla":"Bienkowski, Marcin, et al. “Degree 3 Suffices: A Large-Scale Overlay for P2P Networks.” <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i>, Springer, 2008, pp. 184–96, doi:<a href=\"https://doi.org/10.1007/978-3-540-92221-6_13\">10.1007/978-3-540-92221-6_13</a>.","short":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, in: Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS), Springer, Berlin / Heidelberg, 2008, pp. 184–196.","apa":"Bienkowski, M., Brinkmann, A., &#38; Korzeniowski, M. (2008). Degree 3 Suffices: A Large-Scale Overlay for P2P Networks. In <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i> (pp. 184–196). Berlin / Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-92221-6_13\">https://doi.org/10.1007/978-3-540-92221-6_13</a>","ama":"Bienkowski M, Brinkmann A, Korzeniowski M. Degree 3 Suffices: A Large-Scale Overlay for P2P Networks. In: <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i>. Berlin / Heidelberg: Springer; 2008:184-196. doi:<a href=\"https://doi.org/10.1007/978-3-540-92221-6_13\">10.1007/978-3-540-92221-6_13</a>","ieee":"M. Bienkowski, A. Brinkmann, and M. Korzeniowski, “Degree 3 Suffices: A Large-Scale Overlay for P2P Networks,” in <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i>, 2008, pp. 184–196.","chicago":"Bienkowski, Marcin, André Brinkmann, and Miroslaw Korzeniowski. “Degree 3 Suffices: A Large-Scale Overlay for P2P Networks.” In <i>Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)</i>, 184–96. Berlin / Heidelberg: Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-92221-6_13\">https://doi.org/10.1007/978-3-540-92221-6_13</a>."},"page":"184-196","title":"Degree 3 Suffices: A Large-Scale Overlay for P2P Networks","doi":"10.1007/978-3-540-92221-6_13","date_updated":"2022-01-06T06:56:02Z","publisher":"Springer","date_created":"2018-04-17T12:49:23Z","author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw"}],"status":"public","type":"conference","publication":"Proc. Int. Conf. on Principles Of DIstributed Systems (OPODIS)","_id":"2386","user_id":"24135","department":[{"_id":"27"}]},{"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540691334","9783540691341"]},"citation":{"bibtex":"@inproceedings{Hamann_Wörn_2008, title={Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem}, volume={5040}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>}, booktitle={The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={447--456} }","mla":"Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, vol. 5040, 2008, pp. 447--456, doi:<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>.","short":"H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, pp. 447--456.","apa":"Hamann, H., &#38; Wörn, H. (2008). Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In <i>The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i> (Vol. 5040, pp. 447--456). <a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">https://doi.org/10.1007/978-3-540-69134-1_44</a>","ama":"Hamann H, Wörn H. Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In: <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>. Vol 5040. ; 2008:447--456. doi:<a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">10.1007/978-3-540-69134-1_44</a>","ieee":"H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem,” in <i>The tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, 2008, vol. 5040, pp. 447--456.","chicago":"Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.” In <i>The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08)</i>, 5040:447--456, 2008. <a href=\"https://doi.org/10.1007/978-3-540-69134-1_44\">https://doi.org/10.1007/978-3-540-69134-1_44</a>."},"page":"447--456","intvolume":"      5040","year":"2008","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Heinz","full_name":"Wörn, Heinz","last_name":"Wörn"}],"date_created":"2020-11-16T13:55:39Z","volume":5040,"date_updated":"2022-01-06T06:54:26Z","doi":"10.1007/978-3-540-69134-1_44","title":"Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem","type":"conference","publication":"The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)","status":"public","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20367","language":[{"iso":"eng"}]},{"issue":"2-4","publication_identifier":{"issn":["1935-3812","1935-3820"]},"publication_status":"published","intvolume":"         2","page":"209-239","citation":{"chicago":"Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models for Algorithm Design in Swarm Robotics.” <i>Swarm Intelligence</i> 2, no. 2–4 (2008): 209–39. <a href=\"https://doi.org/10.1007/s11721-008-0015-3\">https://doi.org/10.1007/s11721-008-0015-3</a>.","ieee":"H. Hamann and H. Wörn, “A framework of space–time continuous models for algorithm design in swarm robotics,” <i>Swarm Intelligence</i>, vol. 2, no. 2–4, pp. 209–239, 2008.","ama":"Hamann H, Wörn H. A framework of space–time continuous models for algorithm design in swarm robotics. <i>Swarm Intelligence</i>. 2008;2(2-4):209-239. doi:<a href=\"https://doi.org/10.1007/s11721-008-0015-3\">10.1007/s11721-008-0015-3</a>","bibtex":"@article{Hamann_Wörn_2008, title={A framework of space–time continuous models for algorithm design in swarm robotics}, volume={2}, DOI={<a href=\"https://doi.org/10.1007/s11721-008-0015-3\">10.1007/s11721-008-0015-3</a>}, number={2–4}, journal={Swarm Intelligence}, author={Hamann, Heiko and Wörn, Heinz}, year={2008}, pages={209–239} }","short":"H. Hamann, H. Wörn, Swarm Intelligence 2 (2008) 209–239.","mla":"Hamann, Heiko, and Heinz Wörn. “A Framework of Space–Time Continuous Models for Algorithm Design in Swarm Robotics.” <i>Swarm Intelligence</i>, vol. 2, no. 2–4, 2008, pp. 209–39, doi:<a href=\"https://doi.org/10.1007/s11721-008-0015-3\">10.1007/s11721-008-0015-3</a>.","apa":"Hamann, H., &#38; Wörn, H. (2008). A framework of space–time continuous models for algorithm design in swarm robotics. <i>Swarm Intelligence</i>, <i>2</i>(2–4), 209–239. <a href=\"https://doi.org/10.1007/s11721-008-0015-3\">https://doi.org/10.1007/s11721-008-0015-3</a>"},"year":"2008","volume":2,"date_created":"2020-11-16T14:05:49Z","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"first_name":"Heinz","full_name":"Wörn, Heinz","last_name":"Wörn"}],"date_updated":"2022-01-06T06:54:26Z","doi":"10.1007/s11721-008-0015-3","title":"A framework of space–time continuous models for algorithm design in swarm robotics","publication":"Swarm Intelligence","type":"journal_article","status":"public","abstract":[{"lang":"eng","text":"Designing and analyzing self-organizing systems such as robotic swarms is a challenging task even though we have complete knowledge about the robot’s interior. It is difficult to determine the individual robot’s behavior based on the swarm behavior and vice versa due to the high number of agent–agent interactions. A step towards a solution of this problem is the development of appropriate models which accurately predict the swarm behavior based on a specified control algorithm. Such models would reduce the necessary number of time-consuming simulations and experiments during the design process of an algorithm. In this paper we propose a model with focus on an explicit representation of space because the effectiveness of many swarm robotic scenarios depends on spatial inhomogeneity. We use methods of statistical physics to address spatiality. Starting from a description of a single robot we derive an abstract model of swarm motion. The model is then extended to a generic model framework of communicating robots. In two examples we validate models against simulation results. Our experience shows that qualitative correctness is easily achieved, while quantitative correctness is disproportionately more difficult but still possible."}],"department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","_id":"20369","language":[{"iso":"eng"}]},{"user_id":"3902","department":[{"_id":"68"}],"_id":"20711","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Taschenbuch der Algorithmen","status":"public","author":[{"last_name":"Monien","full_name":"Monien, Burkhard","first_name":"Burkhard"},{"first_name":"Ulf","last_name":"Lorenz","full_name":"Lorenz, Ulf"},{"full_name":"Warner, Daniel","id":"3902","last_name":"Warner","first_name":"Daniel"}],"date_created":"2020-12-12T12:25:55Z","date_updated":"2022-01-06T06:54:33Z","doi":"10.1007/978-3-540-76394-9_28","title":"Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?","publication_status":"published","publication_identifier":{"isbn":["9783540763932","9783540763949"]},"citation":{"ama":"Monien B, Lorenz U, Warner D. Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? In: <i>Taschenbuch Der Algorithmen</i>. Berlin, Heidelberg; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">10.1007/978-3-540-76394-9_28</a>","ieee":"B. Monien, U. Lorenz, and D. Warner, “Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?,” in <i>Taschenbuch der Algorithmen</i>, Berlin, Heidelberg, 2008.","chicago":"Monien, Burkhard, Ulf Lorenz, and Daniel Warner. “Der Alphabeta-Algorithmus Für Spielbäume: Wie Bringe Ich Meinen Computer Zum Schachspielen?” In <i>Taschenbuch Der Algorithmen</i>. Berlin, Heidelberg, 2008. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">https://doi.org/10.1007/978-3-540-76394-9_28</a>.","apa":"Monien, B., Lorenz, U., &#38; Warner, D. (2008). Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen? In <i>Taschenbuch der Algorithmen</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">https://doi.org/10.1007/978-3-540-76394-9_28</a>","mla":"Monien, Burkhard, et al. “Der Alphabeta-Algorithmus Für Spielbäume: Wie Bringe Ich Meinen Computer Zum Schachspielen?” <i>Taschenbuch Der Algorithmen</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">10.1007/978-3-540-76394-9_28</a>.","short":"B. Monien, U. Lorenz, D. Warner, in: Taschenbuch Der Algorithmen, Berlin, Heidelberg, 2008.","bibtex":"@inbook{Monien_Lorenz_Warner_2008, place={Berlin, Heidelberg}, title={Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-76394-9_28\">10.1007/978-3-540-76394-9_28</a>}, booktitle={Taschenbuch der Algorithmen}, author={Monien, Burkhard and Lorenz, Ulf and Warner, Daniel}, year={2008} }"},"year":"2008","place":"Berlin, Heidelberg"},{"title":"On Faster Integer Calculations Using Non-arithmetic Primitives","doi":"10.1007/978-3-540-85194-3_11","date_updated":"2022-01-06T06:53:24Z","author":[{"last_name":"Lürwer-Brüggemeier","full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_created":"2020-08-14T13:19:24Z","place":"Berlin, Heidelberg","year":"2008","citation":{"bibtex":"@inbook{Lürwer-Brüggemeier_Ziegler_2008, place={Berlin, Heidelberg}, title={On Faster Integer Calculations Using Non-arithmetic Primitives}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>}, booktitle={Unconventional Computing}, author={Lürwer-Brüggemeier, Katharina and Ziegler, Martin}, year={2008} }","short":"K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.","mla":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” <i>Unconventional Computing</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>.","apa":"Lürwer-Brüggemeier, K., &#38; Ziegler, M. (2008). On Faster Integer Calculations Using Non-arithmetic Primitives. In <i>Unconventional Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">https://doi.org/10.1007/978-3-540-85194-3_11</a>","ieee":"K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in <i>Unconventional Computing</i>, Berlin, Heidelberg, 2008.","chicago":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” In <i>Unconventional Computing</i>. Berlin, Heidelberg, 2008. <a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">https://doi.org/10.1007/978-3-540-85194-3_11</a>.","ama":"Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic Primitives. In: <i>Unconventional Computing</i>. Berlin, Heidelberg; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>"},"publication_status":"published","publication_identifier":{"isbn":["9783540851936","9783540851943"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"_id":"17978","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"book_chapter","publication":"Unconventional Computing"}]