[{"publication_status":"published","date_updated":"2022-01-06T06:53:22Z","author":[{"full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":"Dangelmaier"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"},{"last_name":"Huber","first_name":"Daniel","full_name":"Huber, Daniel"},{"last_name":"Laroque","first_name":"Christoph","full_name":"Laroque, Christoph"},{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"}],"publication_identifier":{"isbn":["9781424427079"]},"year":"2008","title":"Aggregated 3D-visualization of a distributed simulation experiment of a queuing system","status":"public","user_id":"15415","doi":"10.1109/wsc.2008.4736296","_id":"17868","language":[{"iso":"eng"}],"page":"2012-2020","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. "}],"citation":{"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>","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>.","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>.","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>","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} }"},"publication":"2008 Winter Simulation Conference","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-12T13:39:37Z","place":"Miami, FL., USA"},{"publication":"Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)","citation":{"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>","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.","short":"B. Degener, J. Gehweiler, C. Lammersen, in: Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.","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>.","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>.","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>","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} }"},"date_created":"2020-09-04T10:04:49Z","type":"conference","department":[{"_id":"63"}],"year":"2008","title":"The Kinetic Facility Location Problem","status":"public","author":[{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"last_name":"Gehweiler","first_name":"Joachim","full_name":"Gehweiler, Joachim"},{"full_name":"Lammersen, Christiane","last_name":"Lammersen","first_name":"Christiane"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540699002","9783540699033"]},"publication_status":"published","date_updated":"2022-01-06T06:53:57Z","page":"378-389","language":[{"iso":"eng"}],"_id":"19003","user_id":"15415","doi":"10.1007/978-3-540-69903-3_34"},{"citation":{"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).","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.","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.","short":"J. Gehweiler, C. Lammersen, B. Degener, in: Proceedings of the 24th European Workshop on Computational Geometry, 2008, pp. 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.","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} }"},"publication":"Proceedings of the 24th European Workshop on Computational Geometry","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."}],"date_created":"2020-09-04T10:11:39Z","department":[{"_id":"63"}],"type":"conference","author":[{"first_name":"Joachim","last_name":"Gehweiler","full_name":"Gehweiler, Joachim"},{"full_name":"Lammersen, Christiane","last_name":"Lammersen","first_name":"Christiane"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"}],"title":"The Kinetic Facility Location Problem","status":"public","year":"2008","date_updated":"2022-01-06T06:53:57Z","_id":"19004","language":[{"iso":"eng"}],"page":"251-254","user_id":"15415"},{"publication":"Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008","citation":{"apa":"Scheideler, C., W. Richa, A., &#38; Santi, P. (2008). An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i> (pp. 91--100). ACM. <a href=\"https://doi.org/10.1145/1374618.1374632\">https://doi.org/10.1145/1374618.1374632</a>","ieee":"C. Scheideler, A. W. Richa, and P. Santi, “An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model,” in <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i>, 2008, pp. 91--100.","chicago":"Scheideler, Christian, Andr{\\’{e}}a W. Richa, and Paolo Santi. “An O(Log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model.” In <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i>, 91--100. ACM, 2008. <a href=\"https://doi.org/10.1145/1374618.1374632\">https://doi.org/10.1145/1374618.1374632</a>.","short":"C. Scheideler, A. W. Richa, P. Santi, in: Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, ACM, 2008, pp. 91--100.","mla":"Scheideler, Christian, et al. “An O(Log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model.” <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i>, ACM, 2008, pp. 91--100, doi:<a href=\"https://doi.org/10.1145/1374618.1374632\">10.1145/1374618.1374632</a>.","ama":"Scheideler C, W. Richa A, Santi P. An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In: <i>Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008</i>. ACM; 2008:91--100. doi:<a href=\"https://doi.org/10.1145/1374618.1374632\">10.1145/1374618.1374632</a>","bibtex":"@inproceedings{Scheideler_W. Richa_Santi_2008, title={An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model}, DOI={<a href=\"https://doi.org/10.1145/1374618.1374632\">10.1145/1374618.1374632</a>}, booktitle={Proceedings of the 9th {ACM} Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008}, publisher={ACM}, author={Scheideler, Christian and W. Richa, Andr{\\’{e}}a and Santi, Paolo}, year={2008}, pages={91--100} }"},"date_created":"2018-03-29T09:01:31Z","type":"conference","department":[{"_id":"79"}],"status":"public","title":"An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model","year":"2008","author":[{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Andr{\\'{e}}a","last_name":"W. Richa","full_name":"W. Richa, Andr{\\'{e}}a"},{"full_name":"Santi, Paolo","last_name":"Santi","first_name":"Paolo"}],"publication_identifier":{"isbn":["978-1-60558-073-9"]},"date_updated":"2022-01-06T06:54:00Z","page":"91--100","_id":"1926","publisher":"ACM","user_id":"15504","doi":"10.1145/1374618.1374632"},{"user_id":"15504","_id":"1937","page":"130--152","date_updated":"2022-01-06T06:54:03Z","author":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"year":"2008","status":"public","title":"Algorithms for Overlay Networks","department":[{"_id":"79"}],"type":"journal_article","date_created":"2018-03-29T09:28:22Z","citation":{"bibtex":"@article{Scheideler_2008, title={Algorithms for Overlay Networks}, journal={Bulletin of the EATCS}, author={Scheideler, Christian}, year={2008}, pages={130--152} }","ama":"Scheideler C. Algorithms for Overlay Networks. <i>Bulletin of the EATCS</i>. 2008:130--152.","short":"C. Scheideler, Bulletin of the EATCS (2008) 130--152.","chicago":"Scheideler, Christian. “Algorithms for Overlay Networks.” <i>Bulletin of the EATCS</i>, 2008, 130--152.","ieee":"C. Scheideler, “Algorithms for Overlay Networks,” <i>Bulletin of the EATCS</i>, pp. 130--152, 2008.","mla":"Scheideler, Christian. “Algorithms for Overlay Networks.” <i>Bulletin of the EATCS</i>, 2008, pp. 130--152.","apa":"Scheideler, C. (2008). Algorithms for Overlay Networks. <i>Bulletin of the EATCS</i>, 130--152."},"publication":"Bulletin of the EATCS"},{"date_created":"2018-03-29T09:29:06Z","department":[{"_id":"79"}],"type":"conference","citation":{"mla":"Awerbuch, Baruch, et al. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.” <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i>, ACM, 2008, pp. 45--54, doi:<a href=\"https://doi.org/10.1145/1400751.1400759\">10.1145/1400751.1400759</a>.","apa":"Awerbuch, B., W. Richa, A., &#38; Scheideler, C. (2008). A jamming-resistant MAC protocol for single-hop wireless networks. In <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i> (pp. 45--54). ACM. <a href=\"https://doi.org/10.1145/1400751.1400759\">https://doi.org/10.1145/1400751.1400759</a>","ieee":"B. Awerbuch, A. W. Richa, and C. Scheideler, “A jamming-resistant MAC protocol for single-hop wireless networks,” in <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i>, 2008, pp. 45--54.","chicago":"Awerbuch, Baruch, Andr{\\’{e}}a W. Richa, and Christian Scheideler. “A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks.” In <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i>, 45--54. ACM, 2008. <a href=\"https://doi.org/10.1145/1400751.1400759\">https://doi.org/10.1145/1400751.1400759</a>.","ama":"Awerbuch B, W. Richa A, Scheideler C. A jamming-resistant MAC protocol for single-hop wireless networks. In: <i>Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008</i>. ACM; 2008:45--54. doi:<a href=\"https://doi.org/10.1145/1400751.1400759\">10.1145/1400751.1400759</a>","short":"B. Awerbuch, A. W. Richa, C. Scheideler, in: Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008, ACM, 2008, pp. 45--54.","bibtex":"@inproceedings{Awerbuch_W. Richa_Scheideler_2008, title={A jamming-resistant MAC protocol for single-hop wireless networks}, DOI={<a href=\"https://doi.org/10.1145/1400751.1400759\">10.1145/1400751.1400759</a>}, booktitle={Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008}, publisher={ACM}, author={Awerbuch, Baruch and W. Richa, Andr{\\’{e}}a and Scheideler, Christian}, year={2008}, pages={45--54} }"},"publication":"Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, PODC 2008, Toronto, Canada, August 18-21, 2008","publisher":"ACM","_id":"1938","page":"45--54","doi":"10.1145/1400751.1400759","user_id":"15504","author":[{"last_name":"Awerbuch","first_name":"Baruch","full_name":"Awerbuch, Baruch"},{"full_name":"W. Richa, Andr{\\'{e}}a","first_name":"Andr{\\'{e}}a","last_name":"W. Richa"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"publication_identifier":{"isbn":["978-1-59593-989-0"]},"year":"2008","title":"A jamming-resistant MAC protocol for single-hop wireless networks","status":"public","date_updated":"2022-01-06T06:54:03Z"},{"date_updated":"2022-01-06T06:54:03Z","author":[{"first_name":"Mario","last_name":"Mense","full_name":"Mense, Mario"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"title":"SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems","year":"2008","language":[{"iso":"eng"}],"publication":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2018-03-29T09:30:18Z","file":[{"file_name":"SODA08.pdf","access_level":"open_access","file_size":211264,"relation":"main_file","date_updated":"2018-04-13T10:03:13Z","file_id":"2341","content_type":"application/pdf","creator":"florida","date_created":"2018-04-13T10:03:13Z"}],"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"14955","publisher":"SIAM","_id":"1940","urn":"19408","page":"1135--1144","citation":{"short":"M. Mense, C. Scheideler, in: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, SIAM, 2008, pp. 1135--1144.","chicago":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” In <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, 1135--1144. SIAM, 2008.","ieee":"M. Mense and C. Scheideler, “SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems,” in <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, 2008, pp. 1135--1144.","apa":"Mense, M., &#38; Scheideler, C. (2008). SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i> (pp. 1135--1144). SIAM.","bibtex":"@inproceedings{Mense_Scheideler_2008, title={SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems}, booktitle={Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008}, publisher={SIAM}, author={Mense, Mario and Scheideler, Christian}, year={2008}, pages={1135--1144} }","ama":"Mense M, Scheideler C. SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. In: <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>. SIAM; 2008:1135--1144.","mla":"Mense, Mario, and Christian Scheideler. “SPREAD: An Adaptive Scheme for Redundant and Fair Storage in Dynamic Heterogeneous Storage Systems.” <i>Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008</i>, SIAM, 2008, pp. 1135--1144."},"file_date_updated":"2018-04-13T10:03:13Z","oa":"1"},{"page":"124--140","series_title":"Lecture Notes in Computer Science","_id":"1941","publisher":"Springer","doi":"10.1007/978-3-540-89335-6_12","user_id":"15504","volume":5340,"title":"Tiara: A Self-stabilizing Deterministic Skip List","year":"2008","status":"public","author":[{"first_name":"Thomas","last_name":"Clouser","full_name":"Clouser, Thomas"},{"full_name":"Nesterenko, Mikhail","last_name":"Nesterenko","first_name":"Mikhail"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"publication_identifier":{"isbn":["978-3-540-89334-9"]},"date_updated":"2022-01-06T06:54:03Z","intvolume":"      5340","date_created":"2018-03-29T09:31:18Z","type":"conference","department":[{"_id":"79"}],"publication":"Stabilization, Safety, and Security of Distributed Systems, 10th International Symposium, SSS 2008, Detroit, MI, USA, November 21-23, 2008. Proceedings","citation":{"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.","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>.","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} }","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>","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.","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>."}},{"date_created":"2018-03-29T09:32:34Z","type":"book_chapter","department":[{"_id":"79"}],"publication":"Taschenbuch der Algorithmen","citation":{"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>.","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} }","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>","ieee":"C. Scheideler, “Broadcasting: Wie verbreite ich schnell Informationen?,” in <i>Taschenbuch der Algorithmen</i>, Springer, 2008, pp. 229--236.","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>","short":"C. Scheideler, in: Taschenbuch Der Algorithmen, Springer, 2008, pp. 229--236.","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>."},"page":"229--236","_id":"1942","publisher":"Springer","series_title":"eXamen.press","user_id":"15504","doi":"10.1007/978-3-540-76394-9_22","status":"public","title":"Broadcasting: Wie verbreite ich schnell Informationen?","year":"2008","publication_identifier":{"isbn":["978-3-540-76393-2"]},"author":[{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"date_updated":"2022-01-06T06:54:03Z"},{"user_id":"15504","editor":[{"first_name":"Heinz-Gerd","last_name":"Hegering","full_name":"Hegering, Heinz-Gerd"},{"first_name":"Axel","last_name":"Lehmann","full_name":"Lehmann, Axel"},{"full_name":"Jürgen Ohlbach, Hans","last_name":"Jürgen Ohlbach","first_name":"Hans"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"}],"volume":133,"_id":"1943","series_title":"LNI","date_updated":"2022-01-06T06:54:03Z","intvolume":"       133","status":"public","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","year":"2008","publication_identifier":{"isbn":["978-3-88579-227-7"]},"type":"conference_editor","department":[{"_id":"79"}],"date_created":"2018-03-29T09:33:42Z","citation":{"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.","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.","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).","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} }","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.","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."}},{"user_id":"15504","main_file_link":[{"url":"http://www.springer.com/de/book/9783540763932"}],"series_title":"eXamen.press","_id":"1945","date_updated":"2022-01-06T06:54:05Z","status":"public","year":"2008","title":"Taschenbuch der Algorithmen","author":[{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"},{"last_name":"Alt","first_name":"Helmut","full_name":"Alt, Helmut"},{"first_name":"Martin","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin"},{"first_name":"Rüdiger","last_name":"Reischuk","full_name":"Reischuk, Rüdiger"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"first_name":"Heribert","last_name":"Vollmer","full_name":"Vollmer, Heribert"},{"full_name":"Wagner, Dorothea","first_name":"Dorothea","last_name":"Wagner"}],"publication_identifier":{"isbn":["978-3-540-76393-2"]},"type":"book","department":[{"_id":"79"}],"date_created":"2018-03-29T09:39:00Z","citation":{"mla":"Vöcking, Berthold, et al. <i>Taschenbuch Der Algorithmen</i>. 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.","short":"B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Taschenbuch Der Algorithmen, 2008.","ama":"Vöcking B, Alt H, Dietzfelbinger M, et al. <i>Taschenbuch Der Algorithmen</i>.; 2008.","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} }"}},{"citation":{"ieee":"A. Brinkmann <i>et al.</i>, “Employing WS-BPEL Design Patterns for Grid Service Orchestration using a Standard WS-BPEL Engine and a Grid Middleware,” in <i>Proc. Cracow Grid Workshop (CGW)</i>, 2008, pp. 103–110.","apa":"Brinkmann, A., Gudenkauf, S., Hasselbring, W., Höing, A., Karl, H., Kao, O., … Scherp, G. (2008). Employing WS-BPEL Design Patterns for Grid Service Orchestration using a Standard WS-BPEL Engine and a Grid Middleware. In <i>Proc. Cracow Grid Workshop (CGW)</i> (pp. 103–110).","chicago":"Brinkmann, André, Stefan Gudenkauf, Wilhelm Hasselbring, André Höing, Holger Karl, Odej Kao, Holger Nitsche, and Guido Scherp. “Employing WS-BPEL Design Patterns for Grid Service Orchestration Using a Standard WS-BPEL Engine and a Grid Middleware.” In <i>Proc. Cracow Grid Workshop (CGW)</i>, 103–10, 2008.","short":"A. Brinkmann, S. Gudenkauf, W. Hasselbring, A. Höing, H. Karl, O. Kao, H. Nitsche, G. Scherp, in: Proc. Cracow Grid Workshop (CGW), 2008, pp. 103–110.","mla":"Brinkmann, André, et al. “Employing WS-BPEL Design Patterns for Grid Service Orchestration Using a Standard WS-BPEL Engine and a Grid Middleware.” <i>Proc. Cracow Grid Workshop (CGW)</i>, 2008, pp. 103–10.","bibtex":"@inproceedings{Brinkmann_Gudenkauf_Hasselbring_Höing_Karl_Kao_Nitsche_Scherp_2008, title={Employing WS-BPEL Design Patterns for Grid Service Orchestration using a Standard WS-BPEL Engine and a Grid Middleware}, booktitle={Proc. Cracow Grid Workshop (CGW)}, author={Brinkmann, André and Gudenkauf, Stefan and Hasselbring, Wilhelm and Höing, André and Karl, Holger and Kao, Odej and Nitsche, Holger and Scherp, Guido}, year={2008}, pages={103–110} }","ama":"Brinkmann A, Gudenkauf S, Hasselbring W, et al. Employing WS-BPEL Design Patterns for Grid Service Orchestration using a Standard WS-BPEL Engine and a Grid Middleware. In: <i>Proc. Cracow Grid Workshop (CGW)</i>. ; 2008:103-110."},"publication":"Proc. Cracow Grid Workshop (CGW)","date_created":"2018-04-17T09:41:50Z","department":[{"_id":"27"},{"_id":"75"}],"type":"conference","author":[{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"last_name":"Gudenkauf","first_name":"Stefan","full_name":"Gudenkauf, Stefan"},{"first_name":"Wilhelm","last_name":"Hasselbring","full_name":"Hasselbring, Wilhelm"},{"full_name":"Höing, André","first_name":"André","last_name":"Höing"},{"full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl","id":"126"},{"first_name":"Odej","last_name":"Kao","full_name":"Kao, Odej"},{"last_name":"Nitsche","first_name":"Holger","full_name":"Nitsche, Holger"},{"last_name":"Scherp","first_name":"Guido","full_name":"Scherp, Guido"}],"year":"2008","status":"public","title":"Employing WS-BPEL Design Patterns for Grid Service Orchestration using a Standard WS-BPEL Engine and a Grid Middleware","date_updated":"2022-01-06T06:55:56Z","_id":"2356","page":"103-110","user_id":"24135"},{"date_updated":"2022-01-06T06:55:57Z","year":"2008","status":"public","title":"A method for OSEM PET reconstruction on parallel architectures using STIR","author":[{"full_name":"Beisel, Tobias","last_name":"Beisel","first_name":"Tobias"},{"full_name":"Lietsch, Stefan","last_name":"Lietsch","first_name":"Stefan"},{"first_name":"Kris","last_name":"Thielemans","full_name":"Thielemans, Kris"}],"doi":"10.1109/NSSMIC.2008.4774198","user_id":"24135","page":"4161-4168","publisher":"IEEE","_id":"2358","publication":"IEEE Nuclear Science Symposium Conference Record (NSS)","citation":{"bibtex":"@inproceedings{Beisel_Lietsch_Thielemans_2008, title={A method for OSEM PET reconstruction on parallel architectures using STIR}, DOI={<a href=\"https://doi.org/10.1109/NSSMIC.2008.4774198\">10.1109/NSSMIC.2008.4774198</a>}, booktitle={IEEE Nuclear Science Symposium Conference Record (NSS)}, publisher={IEEE}, author={Beisel, Tobias and Lietsch, Stefan and Thielemans, Kris}, year={2008}, pages={4161–4168} }","ama":"Beisel T, Lietsch S, Thielemans K. A method for OSEM PET reconstruction on parallel architectures using STIR. In: <i>IEEE Nuclear Science Symposium Conference Record (NSS)</i>. IEEE; 2008:4161-4168. doi:<a href=\"https://doi.org/10.1109/NSSMIC.2008.4774198\">10.1109/NSSMIC.2008.4774198</a>","mla":"Beisel, Tobias, et al. “A Method for OSEM PET Reconstruction on Parallel Architectures Using STIR.” <i>IEEE Nuclear Science Symposium Conference Record (NSS)</i>, IEEE, 2008, pp. 4161–68, doi:<a href=\"https://doi.org/10.1109/NSSMIC.2008.4774198\">10.1109/NSSMIC.2008.4774198</a>.","chicago":"Beisel, Tobias, Stefan Lietsch, and Kris Thielemans. “A Method for OSEM PET Reconstruction on Parallel Architectures Using STIR.” In <i>IEEE Nuclear Science Symposium Conference Record (NSS)</i>, 4161–68. IEEE, 2008. <a href=\"https://doi.org/10.1109/NSSMIC.2008.4774198\">https://doi.org/10.1109/NSSMIC.2008.4774198</a>.","short":"T. Beisel, S. Lietsch, K. Thielemans, in: IEEE Nuclear Science Symposium Conference Record (NSS), IEEE, 2008, pp. 4161–4168.","ieee":"T. Beisel, S. Lietsch, and K. Thielemans, “A method for OSEM PET reconstruction on parallel architectures using STIR,” in <i>IEEE Nuclear Science Symposium Conference Record (NSS)</i>, 2008, pp. 4161–4168.","apa":"Beisel, T., Lietsch, S., &#38; Thielemans, K. (2008). A method for OSEM PET reconstruction on parallel architectures using STIR. In <i>IEEE Nuclear Science Symposium Conference Record (NSS)</i> (pp. 4161–4168). IEEE. <a href=\"https://doi.org/10.1109/NSSMIC.2008.4774198\">https://doi.org/10.1109/NSSMIC.2008.4774198</a>"},"type":"conference","department":[{"_id":"27"},{"_id":"78"}],"date_created":"2018-04-17T10:59:40Z"},{"department":[{"_id":"27"},{"_id":"78"}],"type":"conference","date_created":"2018-04-17T11:34:35Z","citation":{"bibtex":"@inproceedings{Platzner_Döhre_Happe_Kenter_Lorenz_Schumacher_Send_Warkentin_2008, title={The GOmputer: Accelerating GO with FPGAs}, booktitle={Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)}, publisher={CSREA Press}, author={Platzner, Marco and Döhre, Sven and Happe, Markus and Kenter, Tobias and Lorenz, Ulf and Schumacher, Tobias and Send, Andre and Warkentin, Alexander}, year={2008}, pages={245–251} }","ama":"Platzner M, Döhre S, Happe M, et al. The GOmputer: Accelerating GO with FPGAs. In: <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>. CSREA Press; 2008:245-251.","mla":"Platzner, Marco, et al. “The GOmputer: Accelerating GO with FPGAs.” <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, CSREA Press, 2008, pp. 245–51.","short":"M. Platzner, S. Döhre, M. Happe, T. Kenter, U. Lorenz, T. Schumacher, A. Send, A. Warkentin, in: Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA), CSREA Press, 2008, pp. 245–251.","chicago":"Platzner, Marco, Sven Döhre, Markus Happe, Tobias Kenter, Ulf Lorenz, Tobias Schumacher, Andre Send, and Alexander Warkentin. “The GOmputer: Accelerating GO with FPGAs.” In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 245–51. CSREA Press, 2008.","ieee":"M. Platzner <i>et al.</i>, “The GOmputer: Accelerating GO with FPGAs,” in <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i>, 2008, pp. 245–251.","apa":"Platzner, M., Döhre, S., Happe, M., Kenter, T., Lorenz, U., Schumacher, T., … Warkentin, A. (2008). The GOmputer: Accelerating GO with FPGAs. In <i>Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)</i> (pp. 245–251). CSREA Press."},"publication":"Proc. Int. Conf. on Engineering of Reconfigurable Systems and Algorithms (ERSA)","user_id":"24135","_id":"2365","publisher":"CSREA Press","page":"245-251","date_updated":"2022-01-06T06:55:58Z","author":[{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"full_name":"Döhre, Sven","last_name":"Döhre","first_name":"Sven"},{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"},{"last_name":"Kenter","first_name":"Tobias","full_name":"Kenter, Tobias","id":"3145"},{"full_name":"Lorenz, Ulf","first_name":"Ulf","last_name":"Lorenz"},{"full_name":"Schumacher, Tobias","first_name":"Tobias","last_name":"Schumacher"},{"first_name":"Andre","last_name":"Send","full_name":"Send, Andre"},{"full_name":"Warkentin, Alexander","last_name":"Warkentin","first_name":"Alexander"}],"publication_identifier":{"isbn":["1-60132-064-7"]},"title":"The GOmputer: Accelerating GO with FPGAs","year":"2008","status":"public"},{"citation":{"ieee":"A. Brinkmann and H. Karl, Eds., <i>Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung</i>. Paderborn Center for Parallel Computing, Paderborn University, 2008.","apa":"Brinkmann, A., &#38; Karl, H. (Eds.). (2008). <i>Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung</i>. Paderborn Center for Parallel Computing, Paderborn University.","chicago":"Brinkmann, André, and Holger Karl, eds. <i>Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung</i>. Paderborn Center for Parallel Computing, Paderborn University, 2008.","short":"A. Brinkmann, H. Karl, eds., Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung, Paderborn Center for Parallel Computing, Paderborn University, 2008.","mla":"Brinkmann, André, and Holger Karl, editors. <i>Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung</i>. Paderborn Center for Parallel Computing, Paderborn University, 2008.","bibtex":"@book{Brinkmann_Karl_2008, title={Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung}, publisher={Paderborn Center for Parallel Computing, Paderborn University}, year={2008} }","ama":"Brinkmann A, Karl H, eds. <i>Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung</i>. Paderborn Center for Parallel Computing, Paderborn University; 2008."},"department":[{"_id":"27"},{"_id":"75"}],"type":"conference_editor","date_created":"2018-04-17T12:12:58Z","date_updated":"2022-01-06T06:55:59Z","year":"2008","status":"public","title":"Proceedings of the 1. GI/ITG KuVS Fachgespräch Virtualisierung","editor":[{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"user_id":"24135","publisher":"Paderborn Center for Parallel Computing, Paderborn University","_id":"2376"},{"date_created":"2020-11-16T13:55:39Z","type":"conference","department":[{"_id":"63"},{"_id":"238"}],"publication":"The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)","citation":{"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>.","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} }","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.","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>","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>.","short":"H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, pp. 447--456."},"page":"447--456","language":[{"iso":"eng"}],"_id":"20367","doi":"10.1007/978-3-540-69134-1_44","user_id":"15415","volume":5040,"title":"Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem","status":"public","year":"2008","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540691334","9783540691341"]},"author":[{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"full_name":"Wörn, Heinz","last_name":"Wörn","first_name":"Heinz"}],"date_updated":"2022-01-06T06:54:26Z","publication_status":"published","intvolume":"      5040"},{"year":"2008","status":"public","title":"Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"full_name":"Schmickl, Thomas","first_name":"Thomas","last_name":"Schmickl"},{"full_name":"Wörn, Heinz","first_name":"Heinz","last_name":"Wörn"},{"last_name":"Crailsheim","first_name":"Karl","full_name":"Crailsheim, Karl"}],"date_updated":"2022-01-06T06:54:26Z","page":"1415--1420","publisher":"IEEE Press","_id":"20368","language":[{"iso":"eng"}],"doi":"10.1109/IROS.2008.4651038","user_id":"15415","publication":"IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS'08)","citation":{"short":"H. Hamann, T. Schmickl, H. Wörn, K. Crailsheim, in: IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08), IEEE Press, 2008, pp. 1415--1420.","chicago":"Hamann, Heiko, Thomas Schmickl, Heinz Wörn, and Karl Crailsheim. “Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm.” In <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i>, 1415--1420. IEEE Press, 2008. <a href=\"https://doi.org/10.1109/IROS.2008.4651038\">https://doi.org/10.1109/IROS.2008.4651038</a>.","ieee":"H. Hamann, T. Schmickl, H. Wörn, and K. Crailsheim, “Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm,” in <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i>, 2008, pp. 1415--1420.","apa":"Hamann, H., Schmickl, T., Wörn, H., &#38; Crailsheim, K. (2008). Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm. In <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i> (pp. 1415--1420). IEEE Press. <a href=\"https://doi.org/10.1109/IROS.2008.4651038\">https://doi.org/10.1109/IROS.2008.4651038</a>","bibtex":"@inproceedings{Hamann_Schmickl_Wörn_Crailsheim_2008, title={Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm}, DOI={<a href=\"https://doi.org/10.1109/IROS.2008.4651038\">10.1109/IROS.2008.4651038</a>}, booktitle={IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)}, publisher={IEEE Press}, author={Hamann, Heiko and Schmickl, Thomas and Wörn, Heinz and Crailsheim, Karl}, year={2008}, pages={1415--1420} }","ama":"Hamann H, Schmickl T, Wörn H, Crailsheim K. Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm. In: <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i>. IEEE Press; 2008:1415--1420. doi:<a href=\"https://doi.org/10.1109/IROS.2008.4651038\">10.1109/IROS.2008.4651038</a>","mla":"Hamann, Heiko, et al. “Spatial Macroscopic Models of a Bio-Inspired Robotic Swarm Algorithm.” <i>IEEE/RSJ 2008 International Conference on Intelligent Robots and Systems (IROS’08)</i>, IEEE Press, 2008, pp. 1415--1420, doi:<a href=\"https://doi.org/10.1109/IROS.2008.4651038\">10.1109/IROS.2008.4651038</a>."},"abstract":[{"lang":"eng","text":"We present a comparative study of two spatially resolved macroscopic models of an autonomous robotic swarm. In previous experiments, the collective behavior of 15 autonomous swarm robots, driven by a simple bio-inspired control algorithm, was investigated: in two different environmental conditions, the ability of the robots to aggregate below a light source was tested. Distinct approaches to predict the dynamics of the spatial distribution were made by two different modeling approaches: one model was constructed in a compartmental manner (ODEs). In parallel, a space-continuous model (PDEs) was constructed. Both models show a high degree of similarity concerning the modeling of concrete environmental factors (light), but due to their different basic approaches, show also significant differences in their implementation. However, the predictions of both models compare well to the observed behavior of the robotic swarm, thus both models can be used to develop further extensions of the algorithm as well as different experimental setups without the need to run extensive real robotic preliminary experiments."}],"date_created":"2020-11-16T14:03:10Z","type":"conference","department":[{"_id":"63"},{"_id":"238"}]},{"publication":"Swarm Intelligence","issue":"2-4","abstract":[{"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.","lang":"eng"}],"date_created":"2020-11-16T14:05:49Z","type":"journal_article","department":[{"_id":"63"},{"_id":"238"}],"year":"2008","title":"A framework of space–time continuous models for algorithm design in swarm robotics","author":[{"full_name":"Hamann, Heiko","first_name":"Heiko","last_name":"Hamann"},{"full_name":"Wörn, Heinz","first_name":"Heinz","last_name":"Wörn"}],"publication_identifier":{"issn":["1935-3812","1935-3820"]},"date_updated":"2022-01-06T06:54:26Z","publication_status":"published","intvolume":"         2","language":[{"iso":"eng"}],"doi":"10.1007/s11721-008-0015-3","citation":{"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>","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.","short":"H. Hamann, H. Wörn, Swarm Intelligence 2 (2008) 209–239.","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>.","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>.","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} }"},"status":"public","page":"209-239","_id":"20369","user_id":"15415","volume":2},{"doi":"10.1007/978-3-540-76394-9_28","user_id":"3902","_id":"20711","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:33Z","publication_status":"published","status":"public","year":"2008","title":"Der Alphabeta-Algorithmus für Spielbäume: Wie bringe ich meinen Computer zum Schachspielen?","publication_identifier":{"isbn":["9783540763932","9783540763949"]},"author":[{"last_name":"Monien","first_name":"Burkhard","full_name":"Monien, Burkhard"},{"first_name":"Ulf","last_name":"Lorenz","full_name":"Lorenz, Ulf"},{"last_name":"Warner","first_name":"Daniel","full_name":"Warner, Daniel","id":"3902"}],"type":"book_chapter","department":[{"_id":"68"}],"place":"Berlin, Heidelberg","date_created":"2020-12-12T12:25:55Z","publication":"Taschenbuch der Algorithmen","citation":{"short":"B. Monien, U. Lorenz, D. Warner, in: Taschenbuch Der Algorithmen, 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>","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.","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>","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} }","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>."}},{"publication_status":"published","date_updated":"2022-01-06T06:53:24Z","publication_identifier":{"isbn":["9783540851936","9783540851943"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina","last_name":"Lürwer-Brüggemeier"},{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"status":"public","year":"2008","title":"On Faster Integer Calculations Using Non-arithmetic Primitives","user_id":"15415","doi":"10.1007/978-3-540-85194-3_11","_id":"17978","language":[{"iso":"eng"}],"citation":{"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>.","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>.","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>","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} }"},"publication":"Unconventional Computing","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-08-14T13:19:24Z","place":"Berlin, Heidelberg"}]