[{"abstract":[{"lang":"eng","text":"Software maintenance tasks require knowledge about the software’s design. Several tools help to identify implementations of software patterns, e.g. Design Patterns, in source code and thus help to reveal the underlying design. In case of the reverse engineering tool suite Reclipse, detection algorithms are generated from manually created, formal pattern specifications. Due to numerous variants that have to be considered, the pattern specification is error-prone. Because of this, the complex, step-wise generation process has to be traceable backwards to identify specification mistakes. To increase the traceability, we directly interpret the detection algorithm models (story diagrams) instead of executing code generated from these models. This way, a reverse engineer no longer has to relate generated code to the story diagrams to find mistakes in pattern specifications.\r\n"}],"status":"public","type":"conference","publication":"Proceedings of the 8th International Fujaba Days","language":[{"iso":"eng"}],"_id":"20975","user_id":"5786","department":[{"_id":"76"}],"place":"University of Tartu, Estonia","year":"2011","citation":{"ama":"Fockel M, Travkin D, von Detten M. Interpreting Story Diagrams for the Static Detection of Software Patterns. In: <i>Proceedings of the 8th International Fujaba Days</i>. ; 2011.","ieee":"M. Fockel, D. Travkin, and M. von Detten, “Interpreting Story Diagrams for the Static Detection of Software Patterns,” 2011.","chicago":"Fockel, Markus, Dietrich Travkin, and Markus von Detten. “Interpreting Story Diagrams for the Static Detection of Software Patterns.” In <i>Proceedings of the 8th International Fujaba Days</i>. University of Tartu, Estonia, 2011.","apa":"Fockel, M., Travkin, D., &#38; von Detten, M. (2011). Interpreting Story Diagrams for the Static Detection of Software Patterns. <i>Proceedings of the 8th International Fujaba Days</i>.","short":"M. Fockel, D. Travkin, M. von Detten, in: Proceedings of the 8th International Fujaba Days, University of Tartu, Estonia, 2011.","bibtex":"@inproceedings{Fockel_Travkin_von Detten_2011, place={University of Tartu, Estonia}, title={Interpreting Story Diagrams for the Static Detection of Software Patterns}, booktitle={Proceedings of the 8th International Fujaba Days}, author={Fockel, Markus and Travkin, Dietrich and von Detten, Markus}, year={2011} }","mla":"Fockel, Markus, et al. “Interpreting Story Diagrams for the Static Detection of Software Patterns.” <i>Proceedings of the 8th International Fujaba Days</i>, 2011."},"title":"Interpreting Story Diagrams for the Static Detection of Software Patterns","date_updated":"2022-01-06T06:54:42Z","author":[{"first_name":"Markus","last_name":"Fockel","orcid":"0000-0002-1269-0702","full_name":"Fockel, Markus","id":"8472"},{"first_name":"Dietrich","last_name":"Travkin","full_name":"Travkin, Dietrich"},{"first_name":"Markus","last_name":"von Detten","full_name":"von Detten, Markus"}],"date_created":"2021-01-13T13:15:48Z"},{"year":"2011","citation":{"chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, and Matthias Fischer. “Approximative Occlusion Culling Using the Hull Tree.” In <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>, edited by Stephen Brooks and Pourang Irani, 79--86. Canadian Human-Computer Communications Society, 2011.","ieee":"T. Suess, C. Koch, C. Jähn, and M. Fischer, “Approximative occlusion culling using the hull tree,” in <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>, 2011, pp. 79--86.","ama":"Suess T, Koch C, Jähn C, Fischer M. Approximative occlusion culling using the hull tree. In: Brooks S, Irani P, eds. <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>. Canadian Human-Computer Communications Society; 2011:79--86.","short":"T. Suess, C. Koch, C. Jähn, M. Fischer, in: S. Brooks, P. Irani (Eds.), Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, Canadian Human-Computer Communications Society, 2011, pp. 79--86.","bibtex":"@inproceedings{Suess_Koch_Jähn_Fischer_2011, title={Approximative occlusion culling using the hull tree}, booktitle={Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada}, publisher={Canadian Human-Computer Communications Society}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias}, editor={Brooks, Stephen and Irani, Pourang}, year={2011}, pages={79--86} }","mla":"Suess, Tim, et al. “Approximative Occlusion Culling Using the Hull Tree.” <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>, edited by Stephen Brooks and Pourang Irani, Canadian Human-Computer Communications Society, 2011, pp. 79--86.","apa":"Suess, T., Koch, C., Jähn, C., &#38; Fischer, M. (2011). Approximative occlusion culling using the hull tree. In S. Brooks &#38; P. Irani (Eds.), <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i> (pp. 79--86). Canadian Human-Computer Communications Society."},"page":"79--86","title":"Approximative occlusion culling using the hull tree","date_updated":"2022-01-06T06:53:11Z","publisher":"Canadian Human-Computer Communications Society","date_created":"2020-07-27T19:17:03Z","author":[{"last_name":"Suess","full_name":"Suess, Tim","first_name":"Tim"},{"first_name":"Clemens","last_name":"Koch","full_name":"Koch, Clemens"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}],"editor":[{"last_name":"Brooks","full_name":"Brooks, Stephen","first_name":"Stephen"},{"last_name":"Irani","full_name":"Irani, Pourang","first_name":"Pourang"}],"abstract":[{"text":"Occlusion culling is a common approach to accelerate real-time rendering of polygonal 3D-scenes by reducing the rendering load. Especially for large scenes, it is necessary to remove occluded objects to achieve a frame rate that provides an interactive environment. In order to benefit from the culling properly, often hierarchical data structures are used. These data structures typically create a spatial subdivision of a given scene into axis-aligned bounding boxes. These boxes can be tested quickly, but they are not very precise. By using these boxes, the included objects are detected as visible, even if other objects occlude them (false-positives). To get perfect results, the models’ original geometry included in the box has to be tested, but this would require too much computational power. To overcome this problem, original objects’ approximations could be used, but typical methods for mesh simplification cannot be applied, because they do not create an outer hull for a given object. We present a model simplification algorithm, which generates simple outer hulls, consisting of only few more triangles than a box, while preserving an object’s shape better than a corresponding bounding box. This approach is then extended to a hierarchical data structure, the so-called hull tree, that can be generated for a given scene to improve the visibility tests. Next, we present an approximative rendering algorithm, which combines the features of the hull tree with the use of inner hulls for efficient occlusion detection and global state-sorting of the visible objects.\r\n","lang":"eng"}],"status":"public","type":"conference","publication":"Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John's, Newfoundland, Canada","language":[{"iso":"eng"}],"_id":"17420","user_id":"15415","department":[{"_id":"63"}]},{"title":"Simulation aided, knowledge based routing for AGVs in a distribution warehouse","doi":"10.1109/wsc.2011.6147883","date_updated":"2022-01-06T06:53:11Z","author":[{"full_name":"Klaas, Alexander","last_name":"Klaas","first_name":"Alexander"},{"first_name":"Christoph","full_name":"Laroque, Christoph","last_name":"Laroque"},{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"}],"date_created":"2020-07-27T19:21:18Z","year":"2011","citation":{"ieee":"A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge based routing for AGVs in a distribution warehouse,” in <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>, 2011.","chicago":"Klaas, Alexander, Christoph Laroque, Wilhelm Dangelmaier, and Matthias Fischer. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.” In <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>, 2011. <a href=\"https://doi.org/10.1109/wsc.2011.6147883\">https://doi.org/10.1109/wsc.2011.6147883</a>.","ama":"Klaas A, Laroque C, Dangelmaier W, Fischer M. Simulation aided, knowledge based routing for AGVs in a distribution warehouse. In: <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>. ; 2011. doi:<a href=\"https://doi.org/10.1109/wsc.2011.6147883\">10.1109/wsc.2011.6147883</a>","bibtex":"@inproceedings{Klaas_Laroque_Dangelmaier_Fischer_2011, title={Simulation aided, knowledge based routing for AGVs in a distribution warehouse}, DOI={<a href=\"https://doi.org/10.1109/wsc.2011.6147883\">10.1109/wsc.2011.6147883</a>}, booktitle={Proceedings of the 2011 Winter Simulation Conference (WSC)}, author={Klaas, Alexander and Laroque, Christoph and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2011} }","short":"A. Klaas, C. Laroque, W. Dangelmaier, M. Fischer, in: Proceedings of the 2011 Winter Simulation Conference (WSC), 2011.","mla":"Klaas, Alexander, et al. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.” <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>, 2011, doi:<a href=\"https://doi.org/10.1109/wsc.2011.6147883\">10.1109/wsc.2011.6147883</a>.","apa":"Klaas, A., Laroque, C., Dangelmaier, W., &#38; Fischer, M. (2011). Simulation aided, knowledge based routing for AGVs in a distribution warehouse. In <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>. <a href=\"https://doi.org/10.1109/wsc.2011.6147883\">https://doi.org/10.1109/wsc.2011.6147883</a>"},"publication_status":"published","publication_identifier":{"isbn":["9781457721090","9781457721083","9781457721069","9781457721076"]},"language":[{"iso":"eng"}],"_id":"17421","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"conference","publication":"Proceedings of the 2011 Winter Simulation Conference (WSC)"},{"citation":{"ama":"Suess T, Jähn C, Fischer M, Meyer auf der Heide F, Koch C. Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 295. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2011:185--197.","chicago":"Suess, Tim, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide, and Clemens Koch. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 295:185--197. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011.","ieee":"T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2011, vol. 295, pp. 185--197.","apa":"Suess, T., Jähn, C., Fischer, M., Meyer auf der Heide, F., &#38; Koch, C. (2011). Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>295</i>, 185--197.","short":"T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, C. Koch, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011, pp. 185--197.","bibtex":"@inproceedings{Suess_Jähn_Fischer_Meyer auf der Heide_Koch_2011, place={Paderborn}, title={Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze}, volume={295}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Suess, Tim and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm and Koch, Clemens}, year={2011}, pages={185--197} }","mla":"Suess, Tim, et al. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 295, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011, pp. 185--197."},"page":"185--197","intvolume":"       295","place":"Paderborn","year":"2011","title":"Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze","author":[{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Clemens","full_name":"Koch, Clemens","last_name":"Koch"}],"date_created":"2020-07-29T12:19:22Z","volume":295,"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_updated":"2022-01-06T06:53:12Z","status":"public","type":"conference","publication":"Augmented & Virtual Reality in der Produktentstehung","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"26"}],"_id":"17450"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"17454","status":"public","type":"dissertation","title":"Parallel Real-Time Rendering using Heterogeneous PC Clusters","author":[{"last_name":"Suess","full_name":"Suess, Tim","first_name":"Tim"}],"date_created":"2020-07-29T13:57:09Z","date_updated":"2022-01-06T06:53:12Z","citation":{"bibtex":"@book{Suess_2011, place={Universität Paderborn}, title={Parallel Real-Time Rendering using Heterogeneous PC Clusters}, author={Suess, Tim}, year={2011} }","mla":"Suess, Tim. <i>Parallel Real-Time Rendering Using Heterogeneous PC Clusters</i>. 2011.","short":"T. Suess, Parallel Real-Time Rendering Using Heterogeneous PC Clusters, Universität Paderborn, 2011.","apa":"Suess, T. (2011). <i>Parallel Real-Time Rendering using Heterogeneous PC Clusters</i>.","ama":"Suess T. <i>Parallel Real-Time Rendering Using Heterogeneous PC Clusters</i>.; 2011.","chicago":"Suess, Tim. <i>Parallel Real-Time Rendering Using Heterogeneous PC Clusters</i>. Universität Paderborn, 2011.","ieee":"T. Suess, <i>Parallel Real-Time Rendering using Heterogeneous PC Clusters</i>. Universität Paderborn, 2011."},"year":"2011","place":"Universität Paderborn","related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-8222"}]}},{"publisher":"IEEE Computer Society","date_updated":"2022-01-06T06:53:54Z","author":[{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Jin","last_name":"Zhang","full_name":"Zhang, Jin"}],"date_created":"2018-03-28T07:08:13Z","title":"Competitive and Fair Medium Access Despite Reactive Jamming","doi":"10.1109/ICDCS.2011.8","publication_identifier":{"isbn":["978-0-7695-4364-2"]},"year":"2011","page":"507--516","citation":{"ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Competitive and Fair Medium Access Despite Reactive Jamming. In: <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i>. IEEE Computer Society; 2011:507--516. doi:<a href=\"https://doi.org/10.1109/ICDCS.2011.8\">10.1109/ICDCS.2011.8</a>","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and Fair Medium Access Despite Reactive Jamming,” in <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i>, 2011, pp. 507--516.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Medium Access Despite Reactive Jamming.” In <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i>, 507--516. IEEE Computer Society, 2011. <a href=\"https://doi.org/10.1109/ICDCS.2011.8\">https://doi.org/10.1109/ICDCS.2011.8</a>.","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: 2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011, IEEE Computer Society, 2011, pp. 507--516.","mla":"W. Richa, Andrea, et al. “Competitive and Fair Medium Access Despite Reactive Jamming.” <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i>, IEEE Computer Society, 2011, pp. 507--516, doi:<a href=\"https://doi.org/10.1109/ICDCS.2011.8\">10.1109/ICDCS.2011.8</a>.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Competitive and Fair Medium Access Despite Reactive Jamming}, DOI={<a href=\"https://doi.org/10.1109/ICDCS.2011.8\">10.1109/ICDCS.2011.8</a>}, booktitle={2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011}, publisher={IEEE Computer Society}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={507--516} }","apa":"W. Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2011). Competitive and Fair Medium Access Despite Reactive Jamming. In <i>2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011</i> (pp. 507--516). IEEE Computer Society. <a href=\"https://doi.org/10.1109/ICDCS.2011.8\">https://doi.org/10.1109/ICDCS.2011.8</a>"},"_id":"1891","department":[{"_id":"79"}],"user_id":"15504","publication":"2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011","type":"conference","status":"public"},{"date_created":"2018-03-28T07:09:07Z","author":[{"first_name":"Andrea","last_name":"W. Richa","full_name":"W. Richa, Andrea"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Jin","full_name":"Zhang, Jin","last_name":"Zhang"}],"date_updated":"2022-01-06T06:53:54Z","publisher":"ACM","doi":"10.1145/2030686.2030697","title":"Towards jamming-resistant and competitive medium access in the SINR model","publication_identifier":{"isbn":["978-1-4503-0868-7"]},"page":"33--36","citation":{"apa":"W. Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2011). Towards jamming-resistant and competitive medium access in the SINR model. In <i>Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i> (pp. 33--36). ACM. <a href=\"https://doi.org/10.1145/2030686.2030697\">https://doi.org/10.1145/2030686.2030697</a>","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Towards jamming-resistant and competitive medium access in the SINR model}, DOI={<a href=\"https://doi.org/10.1145/2030686.2030697\">10.1145/2030686.2030697</a>}, booktitle={Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={33--36} }","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011, ACM, 2011, pp. 33--36.","mla":"W. Richa, Andrea, et al. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” <i>Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i>, ACM, 2011, pp. 33--36, doi:<a href=\"https://doi.org/10.1145/2030686.2030697\">10.1145/2030686.2030697</a>.","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Towards Jamming-Resistant and Competitive Medium Access in the SINR Model.” In <i>Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i>, 33--36. ACM, 2011. <a href=\"https://doi.org/10.1145/2030686.2030697\">https://doi.org/10.1145/2030686.2030697</a>.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Towards jamming-resistant and competitive medium access in the SINR model,” in <i>Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i>, 2011, pp. 33--36.","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Towards jamming-resistant and competitive medium access in the SINR model. In: <i>Proceedings of the 3rd ACM Workshop on Wireless of the Students, by the Students, for the Students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011</i>. ACM; 2011:33--36. doi:<a href=\"https://doi.org/10.1145/2030686.2030697\">10.1145/2030686.2030697</a>"},"year":"2011","department":[{"_id":"79"}],"user_id":"15504","_id":"1892","publication":"Proceedings of the 3rd ACM workshop on Wireless of the students, by the students, for the students, S3@MOBICOM 2011, Las Vegas, NV, USA, September 19 - 23, 2011","type":"conference","status":"public"},{"year":"2011","page":"15","citation":{"apa":"W. Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2011). Self-stabilizing leader election for single-hop wireless networks despite jamming. In <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i> (p. 15). ACM. <a href=\"https://doi.org/10.1145/2107502.2107522\">https://doi.org/10.1145/2107502.2107522</a>","short":"A. W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011, ACM, 2011, p. 15.","mla":"W. Richa, Andrea, et al. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i>, ACM, 2011, p. 15, doi:<a href=\"https://doi.org/10.1145/2107502.2107522\">10.1145/2107502.2107522</a>.","bibtex":"@inproceedings{W. Richa_Scheideler_Schmid_Zhang_2011, title={Self-stabilizing leader election for single-hop wireless networks despite jamming}, DOI={<a href=\"https://doi.org/10.1145/2107502.2107522\">10.1145/2107502.2107522</a>}, booktitle={Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011}, publisher={ACM}, author={W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2011}, pages={15} }","chicago":"W. Richa, Andrea, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Self-Stabilizing Leader Election for Single-Hop Wireless Networks despite Jamming.” In <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i>, 15. ACM, 2011. <a href=\"https://doi.org/10.1145/2107502.2107522\">https://doi.org/10.1145/2107502.2107522</a>.","ieee":"A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Self-stabilizing leader election for single-hop wireless networks despite jamming,” in <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i>, 2011, p. 15.","ama":"W. Richa A, Scheideler C, Schmid S, Zhang J. Self-stabilizing leader election for single-hop wireless networks despite jamming. In: <i>Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011</i>. ACM; 2011:15. doi:<a href=\"https://doi.org/10.1145/2107502.2107522\">10.1145/2107502.2107522</a>"},"publication_identifier":{"isbn":["978-1-4503-0722-2"]},"title":"Self-stabilizing leader election for single-hop wireless networks despite jamming","doi":"10.1145/2107502.2107522","date_updated":"2022-01-06T06:53:54Z","publisher":"ACM","date_created":"2018-03-28T07:09:54Z","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Jin","full_name":"Zhang, Jin","last_name":"Zhang"}],"status":"public","publication":"Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011","type":"conference","_id":"1893","department":[{"_id":"79"}],"user_id":"15504"},{"doi":"10.1145/1989493.1989527","title":"Re-Chord: a self-stabilizing chord overlay network","date_created":"2018-03-28T07:12:49Z","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"first_name":"Andreas","last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_updated":"2022-01-06T06:53:55Z","citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “Re-Chord: a self-stabilizing chord overlay network,” in <i>SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)</i>, 2011, pp. 235--244.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” In <i>SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011)</i>, 235--244, 2011. <a href=\"https://doi.org/10.1145/1989493.1989527\">https://doi.org/10.1145/1989493.1989527</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. Re-Chord: a self-stabilizing chord overlay network. In: <i>SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011)</i>. ; 2011:235--244. doi:<a href=\"https://doi.org/10.1145/1989493.1989527\">10.1145/1989493.1989527</a>","mla":"Kniesburges, Sebastian, et al. “Re-Chord: A Self-Stabilizing Chord Overlay Network.” <i>SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011)</i>, 2011, pp. 235--244, doi:<a href=\"https://doi.org/10.1145/1989493.1989527\">10.1145/1989493.1989527</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-Located with FCRC 2011), 2011, pp. 235--244.","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2011, title={Re-Chord: a self-stabilizing chord overlay network}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989527\">10.1145/1989493.1989527</a>}, booktitle={SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2011}, pages={235--244} }","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2011). Re-Chord: a self-stabilizing chord overlay network. In <i>SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)</i> (pp. 235--244). <a href=\"https://doi.org/10.1145/1989493.1989527\">https://doi.org/10.1145/1989493.1989527</a>"},"page":"235--244","year":"2011","publication_identifier":{"isbn":["978-1-4503-0743-7"]},"user_id":"15504","department":[{"_id":"79"}],"_id":"1895","status":"public","type":"conference","publication":"SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)"},{"type":"dissertation","status":"public","_id":"18973","user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"},{"_id":"26"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-942647-09-0"]},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301123","relation":"confirmation"}]},"year":"2011","citation":{"chicago":"Frahling, Gereon. <i>Algorithms for Dynamic Geometric Data Streams</i>. Vol. 290. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"G. Frahling, <i>Algorithms for Dynamic Geometric Data Streams</i>, vol. 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ama":"Frahling G. <i>Algorithms for Dynamic Geometric Data Streams</i>. Vol 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","mla":"Frahling, Gereon. <i>Algorithms for Dynamic Geometric Data Streams</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","short":"G. Frahling, Algorithms for Dynamic Geometric Data Streams, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Frahling_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Algorithms for Dynamic Geometric Data Streams}, volume={290}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Frahling, Gereon}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Frahling, G. (2011). <i>Algorithms for Dynamic Geometric Data Streams</i> (Vol. 290). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn."},"intvolume":"       290","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:56Z","author":[{"full_name":"Frahling, Gereon","last_name":"Frahling","first_name":"Gereon"}],"date_created":"2020-09-04T06:52:56Z","volume":290,"title":"Algorithms for Dynamic Geometric Data Streams"},{"date_updated":"2022-01-06T06:53:56Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","author":[{"last_name":"Mehler","full_name":"Mehler, Jan","first_name":"Jan"}],"date_created":"2020-09-04T06:58:58Z","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"volume":287,"title":"Power-Aware Online File Allocation in Dynamic Networks","publication_identifier":{"isbn":["978-3-942647-06-9"]},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20101020011","relation":"confirmation"}]},"year":"2011","citation":{"short":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Mehler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Power-Aware Online File Allocation in Dynamic Networks}, volume={287}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Mehler, Jan}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Mehler, Jan. <i>Power-Aware Online File Allocation in Dynamic Networks</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","apa":"Mehler, J. (2011). <i>Power-Aware Online File Allocation in Dynamic Networks</i> (Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Mehler J. <i>Power-Aware Online File Allocation in Dynamic Networks</i>. Vol 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","chicago":"Mehler, Jan. <i>Power-Aware Online File Allocation in Dynamic Networks</i>. Vol. 287. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","ieee":"J. Mehler, <i>Power-Aware Online File Allocation in Dynamic Networks</i>, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"intvolume":"       287","_id":"18974","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"language":[{"iso":"eng"}],"type":"dissertation","status":"public"},{"language":[{"iso":"eng"}],"_id":"18976","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","department":[{"_id":"63"},{"_id":"26"}],"abstract":[{"text":"Web computing is a variant of parallel computing where the idle times of PCs\r\ndonated by worldwide distributed users are employed to execute parallel\r\nprograms. In this thesis we consider a web computing variant with two\r\nimportant properties: First, we support the execution of coupled, massively\r\nparallel algorithms (rather than distributed data processing). And second,\r\nwe organize the system in peer-to-peer fashion.\r\n\r\nWe present the Paderborn University BSP-based Web Computing (PUB-Web) library,\r\nwhich supports the execution of parallel programs in the bulk-synchronous style\r\n(BSP) in such a web computing setting. In this thesis, we focus on important\r\ntechnical and algorithmic aspects, in particular: In order to schedule\r\nprocesses with respect to the currently available computing power, which\r\ncontinually changes in an unpredictable fashion, we need intelligent load\r\nbalancing algorithms and -- as a basic precondition -- the technical ability\r\nto migrate threads at runtime.\r\n\r\nTo achieve the latter in a way suitable for production use, compatible with\r\nrecent Java versions, available for all important platforms, and easy-to-use\r\nfor developers, we develop the PadMig thread migration and checkpointing\r\nlibrary.\r\n\r\nIn order to tackle the distributed load balancing problem, we present an\r\nalgorithm based on Distributed Heterogeneous Hash-Tables. In order to judge\r\nthe quality of the schedules produced, we perform extensive experiments to\r\ncompare several variants of the DHHT-based load balancer with the well-\r\nestablished Work Stealing algorithm, using realistic input data obtained by\r\nprofiling the utilization of several hundred PCs for a period of several\r\nmonths.\r\n\r\nBeside the available computing power, we finally also consider the network\r\nbandwidth as a secondary criterion for load balancing. For this purpose, we\r\ncluster the PUB-Web network according to bandwidth, employing a novel,\r\nfault-tolerant, adaptive, and scaling distributed clustering algorithm called\r\nDiDiC. In order to judge the quality of the clusterings produces by DiDiC,\r\nwe experimentally compare it to the well-established MCL algorithm using a\r\nsimulator.","lang":"eng"}],"status":"public","type":"dissertation","title":"Peer-to-Peer Based Parallel Web Computing","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:56Z","author":[{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"}],"date_created":"2020-09-04T07:46:32Z","volume":298,"year":"2011","citation":{"short":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","bibtex":"@book{Gehweiler_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Peer-to-Peer Based Parallel Web Computing}, volume={298}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Gehweiler, Joachim}, year={2011}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Gehweiler, Joachim. <i>Peer-to-Peer Based Parallel Web Computing</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","apa":"Gehweiler, J. (2011). <i>Peer-to-Peer Based Parallel Web Computing</i> (Vol. 298). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ama":"Gehweiler J. <i>Peer-to-Peer Based Parallel Web Computing</i>. Vol 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","ieee":"J. Gehweiler, <i>Peer-to-Peer Based Parallel Web Computing</i>, vol. 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","chicago":"Gehweiler, Joachim. <i>Peer-to-Peer Based Parallel Web Computing</i>. Vol. 298. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"intvolume":"       298","publication_identifier":{"isbn":["978-3-942647-17-5"]},"related_material":{"link":[{"relation":"confirmation","url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466:2-186"}]}},{"publication_identifier":{"isbn":["978-3-642-19093-3"]},"year":"2011","citation":{"apa":"Kniesburges, S., &#38; Scheideler, C. (2011). Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i> (Vol. 6552, pp. 170--181). Springer. <a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">https://doi.org/10.1007/978-3-642-19094-0_18</a>","bibtex":"@inproceedings{Kniesburges_Scheideler_2011, series={Lecture Notes in Computer Science}, title={Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems}, volume={6552}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>}, booktitle={WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings}, publisher={Springer}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2011}, pages={170--181}, collection={Lecture Notes in Computer Science} }","mla":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, vol. 6552, Springer, 2011, pp. 170--181, doi:<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>.","short":"S. Kniesburges, C. Scheideler, in: WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings, Springer, 2011, pp. 170--181.","ama":"Kniesburges S, Scheideler C. Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems. In: <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>. Vol 6552. Lecture Notes in Computer Science. Springer; 2011:170--181. doi:<a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">10.1007/978-3-642-19094-0_18</a>","ieee":"S. Kniesburges and C. Scheideler, “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems,” in <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, 2011, vol. 6552, pp. 170--181.","chicago":"Kniesburges, Sebastian, and Christian Scheideler. “Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems.” In <i>WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings</i>, 6552:170--181. Lecture Notes in Computer Science. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19094-0_18\">https://doi.org/10.1007/978-3-642-19094-0_18</a>."},"intvolume":"      6552","page":"170--181","publisher":"Springer","date_updated":"2022-01-06T06:53:56Z","date_created":"2018-03-28T07:17:05Z","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"volume":6552,"title":"Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems","doi":"10.1007/978-3-642-19094-0_18","type":"conference","publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings","status":"public","_id":"1899","series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"79"}]},{"_id":"1900","user_id":"15504","department":[{"_id":"79"}],"type":"book_chapter","publication":"Computer Science, The Hardware, Software and Heart of It","status":"public","publisher":"Springer","date_updated":"2022-01-06T06:53:57Z","date_created":"2018-03-28T07:17:53Z","author":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"}],"title":"Programming for Distributed Computing: From Physical to Logical Networks","doi":"10.1007/978-1-4614-1168-0_9","publication_identifier":{"isbn":["978-1-4614-1167-3"]},"year":"2011","citation":{"apa":"Scheideler, C., &#38; Graffi, K. (2011). Programming for Distributed Computing: From Physical to Logical Networks. In <i>Computer Science, The Hardware, Software and Heart of It</i> (pp. 155--168). Springer. <a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">https://doi.org/10.1007/978-1-4614-1168-0_9</a>","mla":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” <i>Computer Science, The Hardware, Software and Heart of It</i>, Springer, 2011, pp. 155--168, doi:<a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">10.1007/978-1-4614-1168-0_9</a>.","short":"C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, Springer, 2011, pp. 155--168.","bibtex":"@inbook{Scheideler_Graffi_2011, title={Programming for Distributed Computing: From Physical to Logical Networks}, DOI={<a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">10.1007/978-1-4614-1168-0_9</a>}, booktitle={Computer Science, The Hardware, Software and Heart of It}, publisher={Springer}, author={Scheideler, Christian and Graffi, Kalman}, year={2011}, pages={155--168} }","ieee":"C. Scheideler and K. Graffi, “Programming for Distributed Computing: From Physical to Logical Networks,” in <i>Computer Science, The Hardware, Software and Heart of It</i>, Springer, 2011, pp. 155--168.","chicago":"Scheideler, Christian, and Kalman Graffi. “Programming for Distributed Computing: From Physical to Logical Networks.” In <i>Computer Science, The Hardware, Software and Heart of It</i>, 155--168. Springer, 2011. <a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">https://doi.org/10.1007/978-1-4614-1168-0_9</a>.","ama":"Scheideler C, Graffi K. Programming for Distributed Computing: From Physical to Logical Networks. In: <i>Computer Science, The Hardware, Software and Heart of It</i>. Springer; 2011:155--168. doi:<a href=\"https://doi.org/10.1007/978-1-4614-1168-0_9\">10.1007/978-1-4614-1168-0_9</a>"},"page":"155--168"},{"publication_identifier":{"isbn":["978-3-642-15327-3"]},"year":"2011","citation":{"ieee":"C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,” in <i>Algorithms Unplugged</i>, Springer, 2011, pp. 223--229.","chicago":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” In <i>Algorithms Unplugged</i>, 223--229. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">https://doi.org/10.1007/978-3-642-15328-0_22</a>.","ama":"Scheideler C. Broadcasting - How Can I Quickly Disseminate Information? In: <i>Algorithms Unplugged</i>. Springer; 2011:223--229. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">10.1007/978-3-642-15328-0_22</a>","mla":"Scheideler, Christian. “Broadcasting - How Can I Quickly Disseminate Information?” <i>Algorithms Unplugged</i>, Springer, 2011, pp. 223--229, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">10.1007/978-3-642-15328-0_22</a>.","bibtex":"@inbook{Scheideler_2011, title={Broadcasting - How Can I Quickly Disseminate Information?}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">10.1007/978-3-642-15328-0_22</a>}, booktitle={Algorithms Unplugged}, publisher={Springer}, author={Scheideler, Christian}, year={2011}, pages={223--229} }","short":"C. Scheideler, in: Algorithms Unplugged, Springer, 2011, pp. 223--229.","apa":"Scheideler, C. (2011). Broadcasting - How Can I Quickly Disseminate Information? In <i>Algorithms Unplugged</i> (pp. 223--229). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15328-0_22\">https://doi.org/10.1007/978-3-642-15328-0_22</a>"},"page":"223--229","publisher":"Springer","date_updated":"2022-01-06T06:53:57Z","date_created":"2018-03-28T07:18:43Z","author":[{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"title":"Broadcasting - How Can I Quickly Disseminate Information?","doi":"10.1007/978-3-642-15328-0_22","type":"book_chapter","publication":"Algorithms Unplugged","status":"public","_id":"1901","user_id":"15504","department":[{"_id":"79"}]},{"title":"Algorithms Unplugged","doi":"10.1007/978-3-642-15328-0","date_updated":"2022-01-06T06:53:57Z","date_created":"2018-03-28T07:19:31Z","author":[{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"},{"last_name":"Alt","full_name":"Alt, Helmut","first_name":"Helmut"},{"first_name":"Martin","full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger"},{"first_name":"Rüdiger","last_name":"Reischuk","full_name":"Reischuk, Rüdiger"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"},{"first_name":"Heribert","full_name":"Vollmer, Heribert","last_name":"Vollmer"},{"first_name":"Dorothea","full_name":"Wagner, Dorothea","last_name":"Wagner"}],"year":"2011","citation":{"ama":"Vöcking B, Alt H, Dietzfelbinger M, et al. <i>Algorithms Unplugged</i>.; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>","ieee":"B. Vöcking <i>et al.</i>, <i>Algorithms Unplugged</i>. 2011.","chicago":"Vöcking, Berthold, Helmut Alt, Martin Dietzfelbinger, Rüdiger Reischuk, Christian Scheideler, Heribert Vollmer, and Dorothea Wagner. <i>Algorithms Unplugged</i>, 2011. <a href=\"https://doi.org/10.1007/978-3-642-15328-0\">https://doi.org/10.1007/978-3-642-15328-0</a>.","mla":"Vöcking, Berthold, et al. <i>Algorithms Unplugged</i>. 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>.","bibtex":"@book{Vöcking_Alt_Dietzfelbinger_Reischuk_Scheideler_Vollmer_Wagner_2011, title={Algorithms Unplugged}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15328-0\">10.1007/978-3-642-15328-0</a>}, author={Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea}, year={2011} }","short":"B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Algorithms Unplugged, 2011.","apa":"Vöcking, B., Alt, H., Dietzfelbinger, M., Reischuk, R., Scheideler, C., Vollmer, H., &#38; Wagner, D. (2011). <i>Algorithms Unplugged</i>. <a href=\"https://doi.org/10.1007/978-3-642-15328-0\">https://doi.org/10.1007/978-3-642-15328-0</a>"},"publication_identifier":{"isbn":["978-3-642-15327-3"]},"_id":"1902","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"book"},{"date_updated":"2022-01-06T06:53:57Z","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"},{"first_name":"Christoph","full_name":"Raupach, Christoph","last_name":"Raupach"}],"date_created":"2020-09-04T11:58:54Z","title":"The car sharing problem","doi":"10.1145/1989493.1989518","publication_identifier":{"isbn":["9781450307437"]},"publication_status":"published","year":"2011","citation":{"short":"P. Briest, C. Raupach, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 2011.","mla":"Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011, doi:<a href=\"https://doi.org/10.1145/1989493.1989518\">10.1145/1989493.1989518</a>.","bibtex":"@inproceedings{Briest_Raupach_2011, title={The car sharing problem}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989518\">10.1145/1989493.1989518</a>}, booktitle={Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11}, author={Briest, Patrick and Raupach, Christoph}, year={2011} }","apa":"Briest, P., &#38; Raupach, C. (2011). The car sharing problem. In <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>. <a href=\"https://doi.org/10.1145/1989493.1989518\">https://doi.org/10.1145/1989493.1989518</a>","ama":"Briest P, Raupach C. The car sharing problem. In: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>. ; 2011. doi:<a href=\"https://doi.org/10.1145/1989493.1989518\">10.1145/1989493.1989518</a>","chicago":"Briest, Patrick, and Christoph Raupach. “The Car Sharing Problem.” In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11</i>, 2011. <a href=\"https://doi.org/10.1145/1989493.1989518\">https://doi.org/10.1145/1989493.1989518</a>.","ieee":"P. Briest and C. Raupach, “The car sharing problem,” in <i>Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA ’11</i>, 2011."},"_id":"19026","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","type":"conference","status":"public"},{"type":"dissertation","status":"public","_id":"19040","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385","relation":"confirmation"}]},"place":"Universität Paderborn","year":"2011","citation":{"bibtex":"@book{Effert_2011, place={Universität Paderborn}, title={Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen}, author={Effert, Sascha}, year={2011} }","mla":"Effert, Sascha. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. 2011.","short":"S. Effert, Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen, Universität Paderborn, 2011.","apa":"Effert, S. (2011). <i>Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen</i>. Universität Paderborn.","ama":"Effert S. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. Universität Paderborn; 2011.","chicago":"Effert, Sascha. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. Universität Paderborn, 2011.","ieee":"S. Effert, <i>Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen</i>. Universität Paderborn, 2011."},"date_updated":"2022-01-06T06:53:57Z","author":[{"first_name":"Sascha","full_name":"Effert, Sascha","last_name":"Effert"}],"supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-09-04T13:31:29Z","title":"Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen"},{"department":[{"_id":"79"}],"user_id":"15504","_id":"1924","status":"public","publication":"28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany","type":"conference","doi":"10.4230/LIPIcs.STACS.2011.129","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","date_created":"2018-03-29T08:44:00Z","author":[{"first_name":"Petr","full_name":"Kolman, Petr","last_name":"Kolman"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:54:00Z","page":"129--140","citation":{"apa":"Kolman, P., &#38; Scheideler, C. (2011). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i> (pp. 129--140). <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">https://doi.org/10.4230/LIPIcs.STACS.2011.129</a>","bibtex":"@inproceedings{Kolman_Scheideler_2011, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>}, booktitle={28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany}, author={Kolman, Petr and Scheideler, Christian}, year={2011}, pages={129--140} }","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 2011, pp. 129--140, doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>.","short":"P. Kolman, C. Scheideler, in: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, 2011, pp. 129--140.","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” In <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 129--140, 2011. <a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">https://doi.org/10.4230/LIPIcs.STACS.2011.129</a>.","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” in <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>, 2011, pp. 129--140.","ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In: <i>28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany</i>. ; 2011:129--140. doi:<a href=\"https://doi.org/10.4230/LIPIcs.STACS.2011.129\">10.4230/LIPIcs.STACS.2011.129</a>"},"year":"2011"},{"page":"1587-1622","citation":{"chicago":"Briest, Patrick, Piotr Krysta, and Berthold Vöcking. “Approximation Techniques for Utilitarian Mechanism Design.” <i>SIAM Journal on Computing</i>, 2011, 1587–1622. <a href=\"https://doi.org/10.1137/090772988\">https://doi.org/10.1137/090772988</a>.","ieee":"P. Briest, P. Krysta, and B. Vöcking, “Approximation Techniques for Utilitarian Mechanism Design,” <i>SIAM Journal on Computing</i>, pp. 1587–1622, 2011.","ama":"Briest P, Krysta P, Vöcking B. Approximation Techniques for Utilitarian Mechanism Design. <i>SIAM Journal on Computing</i>. 2011:1587-1622. doi:<a href=\"https://doi.org/10.1137/090772988\">10.1137/090772988</a>","apa":"Briest, P., Krysta, P., &#38; Vöcking, B. (2011). Approximation Techniques for Utilitarian Mechanism Design. <i>SIAM Journal on Computing</i>, 1587–1622. <a href=\"https://doi.org/10.1137/090772988\">https://doi.org/10.1137/090772988</a>","mla":"Briest, Patrick, et al. “Approximation Techniques for Utilitarian Mechanism Design.” <i>SIAM Journal on Computing</i>, 2011, pp. 1587–622, doi:<a href=\"https://doi.org/10.1137/090772988\">10.1137/090772988</a>.","bibtex":"@article{Briest_Krysta_Vöcking_2011, title={Approximation Techniques for Utilitarian Mechanism Design}, DOI={<a href=\"https://doi.org/10.1137/090772988\">10.1137/090772988</a>}, journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr and Vöcking, Berthold}, year={2011}, pages={1587–1622} }","short":"P. Briest, P. Krysta, B. Vöcking, SIAM Journal on Computing (2011) 1587–1622."},"year":"2011","publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published","doi":"10.1137/090772988","title":"Approximation Techniques for Utilitarian Mechanism Design","author":[{"full_name":"Briest, Patrick","last_name":"Briest","first_name":"Patrick"},{"first_name":"Piotr","last_name":"Krysta","full_name":"Krysta, Piotr"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"date_created":"2021-09-03T10:41:04Z","date_updated":"2022-01-06T06:55:59Z","status":"public","abstract":[{"text":"This paper deals with the design of efficiently computable incentive-compatible mechanisms for combinatorial optimization problems with single-minded agents each possibly having multiple private parameters. We focus on approximation algorithms for NP-hard mechanism design problems. These algorithms need to satisfy certain monotonicity properties to ensure truthfulness. Since most of the known approximation techniques do not fulfill these properties, we study alternative techniques. Our first contribution is a quite general method to transform a pseudopolynomial algorithm into a monotone fully polynomial time approximation scheme (FPTAS). This can be applied to various problems like, e.g., knapsack, constrained shortest path, or job scheduling with deadlines. For example, the monotone FPTAS for the knapsack problem gives a very efficient, truthful mechanism for single-minded multiunit auctions. The best previous result for such auctions was a 2-appro-xi-ma-tion. In addition, we present a monotone PTAS for the generalized assignment problem with any constant number of private parameters per agent. The most efficient way to solve packing integer programs (PIPs) is linear programming–based randomized rounding, which also is in general not monotone. We show that primal-dual greedy algorithms achieve almost the same approximation ratios for PIPs as randomized rounding. The advantage is that these algorithms are inherently monotone. This way, we can significantly improve the approximation ratios of truthful mechanisms for various fundamental mechanism design problems like single-minded combinatorial auctions (CAs), unsplittable flow routing, and multicast routing. Our primal-dual approximation algorithms can also be used for the winner determination in CAs with general bidders specifying their bids through an oracle.\r\n","lang":"eng"}],"publication":"SIAM Journal on Computing","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"23739"}]