[{"page":"507--516","_id":"1891","publisher":"IEEE Computer Society","doi":"10.1109/ICDCS.2011.8","user_id":"15504","title":"Competitive and Fair Medium Access Despite Reactive Jamming","status":"public","year":"2011","publication_identifier":{"isbn":["978-0-7695-4364-2"]},"author":[{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"date_updated":"2022-01-06T06:53:54Z","date_created":"2018-03-28T07:08:13Z","type":"conference","department":[{"_id":"79"}],"publication":"2011 International Conference on Distributed Computing Systems, ICDCS 2011, Minneapolis, Minnesota, USA, June 20-24, 2011","citation":{"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} }","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.","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>","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."}},{"date_updated":"2022-01-06T06:53:54Z","author":[{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler","id":"20792"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"publication_identifier":{"isbn":["978-1-4503-0868-7"]},"title":"Towards jamming-resistant and competitive medium access in the SINR model","year":"2011","status":"public","doi":"10.1145/2030686.2030697","user_id":"15504","_id":"1892","publisher":"ACM","page":"33--36","citation":{"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.","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>.","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>","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>","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} }","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>."},"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","department":[{"_id":"79"}],"type":"conference","date_created":"2018-03-28T07:09:07Z"},{"page":"15","_id":"1893","publisher":"ACM","user_id":"15504","doi":"10.1145/2107502.2107522","year":"2011","title":"Self-stabilizing leader election for single-hop wireless networks despite jamming","status":"public","publication_identifier":{"isbn":["978-1-4503-0722-2"]},"author":[{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"full_name":"Zhang, Jin","first_name":"Jin","last_name":"Zhang"}],"date_updated":"2022-01-06T06:53:54Z","date_created":"2018-03-28T07:09:54Z","type":"conference","department":[{"_id":"79"}],"publication":"Proceedings of the 12th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2011, Paris, France, May 16-20, 2011","citation":{"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} }","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>","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>.","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.","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.","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>"}},{"citation":{"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.","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>.","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.","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>","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} }","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>."},"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)","department":[{"_id":"79"}],"type":"conference","date_created":"2018-03-28T07:12:49Z","date_updated":"2022-01-06T06:53:55Z","author":[{"last_name":"Kniesburges","first_name":"Sebastian","full_name":"Kniesburges, Sebastian"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"publication_identifier":{"isbn":["978-1-4503-0743-7"]},"year":"2011","status":"public","title":"Re-Chord: a self-stabilizing chord overlay network","doi":"10.1145/1989493.1989527","user_id":"15504","_id":"1895","page":"235--244"},{"user_id":"5786","volume":290,"_id":"18973","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","date_updated":"2022-01-06T06:53:56Z","intvolume":"       290","year":"2011","status":"public","title":"Algorithms for Dynamic Geometric Data Streams","publication_identifier":{"isbn":["978-3-942647-09-0"]},"author":[{"last_name":"Frahling","first_name":"Gereon","full_name":"Frahling, Gereon"}],"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-04T06:52:56Z","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20070301123","relation":"confirmation"}]},"citation":{"mla":"Frahling, Gereon. <i>Algorithms for Dynamic Geometric Data Streams</i>. 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.","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.","ieee":"G. Frahling, <i>Algorithms for Dynamic Geometric Data Streams</i>, vol. 290. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","short":"G. Frahling, Algorithms for Dynamic Geometric Data Streams, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011.","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."}},{"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18974","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"user_id":"5786","volume":287,"title":"Power-Aware Online File Allocation in Dynamic Networks","status":"public","year":"2011","publication_identifier":{"isbn":["978-3-942647-06-9"]},"author":[{"full_name":"Mehler, Jan","last_name":"Mehler","first_name":"Jan"}],"date_updated":"2022-01-06T06:53:56Z","intvolume":"       287","date_created":"2020-09-04T06:58:58Z","type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"citation":{"ama":"Mehler J. <i>Power-Aware Online File Allocation in Dynamic Networks</i>. Vol 287. 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.","short":"J. Mehler, Power-Aware Online File Allocation in Dynamic Networks, 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.","apa":"Mehler, J. (2011). <i>Power-Aware Online File Allocation in Dynamic Networks</i> (Vol. 287). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"J. Mehler, <i>Power-Aware Online File Allocation in Dynamic Networks</i>, vol. 287. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011."},"supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20101020011","relation":"confirmation"}]}},{"date_updated":"2022-01-06T06:53:56Z","intvolume":"       298","title":"Peer-to-Peer Based Parallel Web Computing","status":"public","year":"2011","publication_identifier":{"isbn":["978-3-942647-17-5"]},"author":[{"full_name":"Gehweiler, Joachim","first_name":"Joachim","last_name":"Gehweiler"}],"user_id":"5786","volume":298,"_id":"18976","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466:2-186","relation":"confirmation"}]},"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"}],"citation":{"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} }","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.","ama":"Gehweiler J. <i>Peer-to-Peer Based Parallel Web Computing</i>. Vol 298. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2011.","short":"J. Gehweiler, Peer-to-Peer Based Parallel Web Computing, 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.","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."},"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-04T07:46:32Z"},{"date_created":"2018-03-28T07:17:05Z","department":[{"_id":"79"}],"type":"conference","citation":{"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.","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>","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>.","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} }","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>","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.","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>."},"publication":"WALCOM: Algorithms and Computation - 5th International Workshop, WALCOM 2011, New Delhi, India, February 18-20, 2011. Proceedings","series_title":"Lecture Notes in Computer Science","_id":"1899","publisher":"Springer","page":"170--181","volume":6552,"doi":"10.1007/978-3-642-19094-0_18","user_id":"15504","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"publication_identifier":{"isbn":["978-3-642-19093-3"]},"year":"2011","title":"Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems","status":"public","intvolume":"      6552","date_updated":"2022-01-06T06:53:56Z"},{"doi":"10.1007/978-1-4614-1168-0_9","user_id":"15504","page":"155--168","_id":"1900","publisher":"Springer","date_updated":"2022-01-06T06:53:57Z","year":"2011","title":"Programming for Distributed Computing: From Physical to Logical Networks","status":"public","publication_identifier":{"isbn":["978-1-4614-1167-3"]},"author":[{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"}],"type":"book_chapter","department":[{"_id":"79"}],"date_created":"2018-03-28T07:17:53Z","publication":"Computer Science, The Hardware, Software and Heart of It","citation":{"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>.","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} }","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>","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.","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>","short":"C. Scheideler, K. Graffi, in: Computer Science, The Hardware, Software and Heart of It, 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>."}},{"title":"Broadcasting - How Can I Quickly Disseminate Information?","year":"2011","status":"public","author":[{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"publication_identifier":{"isbn":["978-3-642-15327-3"]},"date_updated":"2022-01-06T06:53:57Z","page":"223--229","publisher":"Springer","_id":"1901","user_id":"15504","doi":"10.1007/978-3-642-15328-0_22","publication":"Algorithms Unplugged","citation":{"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>","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} }","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>.","short":"C. Scheideler, in: Algorithms Unplugged, 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>.","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>","ieee":"C. Scheideler, “Broadcasting - How Can I Quickly Disseminate Information?,” in <i>Algorithms Unplugged</i>, Springer, 2011, pp. 223--229."},"date_created":"2018-03-28T07:18:43Z","type":"book_chapter","department":[{"_id":"79"}]},{"date_created":"2018-03-28T07:19:31Z","type":"book","department":[{"_id":"79"}],"citation":{"ieee":"B. Vöcking <i>et al.</i>, <i>Algorithms Unplugged</i>. 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>","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>.","short":"B. Vöcking, H. Alt, M. Dietzfelbinger, R. Reischuk, C. Scheideler, H. Vollmer, D. Wagner, Algorithms Unplugged, 2011.","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} }","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>"},"_id":"1902","doi":"10.1007/978-3-642-15328-0","user_id":"15504","year":"2011","title":"Algorithms Unplugged","status":"public","publication_identifier":{"isbn":["978-3-642-15327-3"]},"author":[{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"},{"full_name":"Alt, Helmut","last_name":"Alt","first_name":"Helmut"},{"first_name":"Martin","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin"},{"last_name":"Reischuk","first_name":"Rüdiger","full_name":"Reischuk, Rüdiger"},{"id":"20792","last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian"},{"first_name":"Heribert","last_name":"Vollmer","full_name":"Vollmer, Heribert"},{"full_name":"Wagner, Dorothea","last_name":"Wagner","first_name":"Dorothea"}],"date_updated":"2022-01-06T06:53:57Z"},{"date_created":"2020-09-04T11:58:54Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA '11","citation":{"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>","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} }","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>.","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>.","short":"P. Briest, C. Raupach, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures - SPAA ’11, 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>","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."},"language":[{"iso":"eng"}],"_id":"19026","user_id":"15415","doi":"10.1145/1989493.1989518","title":"The car sharing problem","status":"public","year":"2011","author":[{"first_name":"Patrick","last_name":"Briest","full_name":"Briest, Patrick"},{"full_name":"Raupach, Christoph","first_name":"Christoph","last_name":"Raupach"}],"publication_identifier":{"isbn":["9781450307437"]},"publication_status":"published","date_updated":"2022-01-06T06:53:57Z"},{"supervisor":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"ama":"Effert S. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. Universität Paderborn; 2011.","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.","chicago":"Effert, Sascha. <i>Verfahren Zur Redundanten Datenplatzierung in Skalierbaren Speichersystemen</i>. Universität Paderborn, 2011.","apa":"Effert, S. (2011). <i>Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen</i>. Universität Paderborn.","ieee":"S. Effert, <i>Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen</i>. Universität Paderborn, 2011."},"related_material":{"link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-385","relation":"confirmation"}]},"place":"Universität Paderborn","date_created":"2020-09-04T13:31:29Z","department":[{"_id":"63"}],"type":"dissertation","author":[{"first_name":"Sascha","last_name":"Effert","full_name":"Effert, Sascha"}],"year":"2011","status":"public","title":"Verfahren zur redundanten Datenplatzierung in skalierbaren Speichersystemen","date_updated":"2022-01-06T06:53:57Z","language":[{"iso":"eng"}],"_id":"19040","user_id":"15415"},{"date_created":"2018-03-29T08:44:00Z","type":"conference","department":[{"_id":"79"}],"publication":"28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany","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>","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.","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>.","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.","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>.","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>","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} }"},"page":"129--140","_id":"1924","doi":"10.4230/LIPIcs.STACS.2011.129","user_id":"15504","year":"2011","status":"public","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","author":[{"last_name":"Kolman","first_name":"Petr","full_name":"Kolman, Petr"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:54:00Z"},{"date_created":"2021-09-03T10:41:04Z","type":"journal_article","department":[{"_id":"63"}],"publication":"SIAM Journal on Computing","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>.","short":"P. Briest, P. Krysta, B. Vöcking, SIAM Journal on Computing (2011) 1587–1622.","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.","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>","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} }","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>","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>."},"abstract":[{"lang":"eng","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"}],"page":"1587-1622","language":[{"iso":"eng"}],"_id":"23739","user_id":"15415","doi":"10.1137/090772988","status":"public","title":"Approximation Techniques for Utilitarian Mechanism Design","year":"2011","publication_identifier":{"issn":["0097-5397","1095-7111"]},"author":[{"last_name":"Briest","first_name":"Patrick","full_name":"Briest, Patrick"},{"first_name":"Piotr","last_name":"Krysta","full_name":"Krysta, Piotr"},{"full_name":"Vöcking, Berthold","first_name":"Berthold","last_name":"Vöcking"}],"publication_status":"published","date_updated":"2022-01-06T06:55:59Z"},{"doi":"10.1137/090752353","user_id":"15415","page":"1554-1586","language":[{"iso":"eng"}],"_id":"23740","date_updated":"2022-01-06T06:55:59Z","publication_status":"published","status":"public","title":"Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems","year":"2011","author":[{"full_name":"Briest, Patrick","first_name":"Patrick","last_name":"Briest"},{"full_name":"Krysta, Piotr","last_name":"Krysta","first_name":"Piotr"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2021-09-03T10:48:52Z","abstract":[{"text":"We investigate nonparametric multiproduct pricing problems, in which we want to find revenue maximizing prices for products $\\mathcal{P}$ based on a set of customer samples $\\mathcal{C}$. We mostly focus on the unit-demand case, in which products constitute strict substitutes and each customer aims to purchase a single product. In this setting a customer sample consists of a number of nonzero values for different products and possibly an additional product ranking. Once prices are fixed, each customer chooses to buy one of the products she can afford based on some predefined selection rule. We distinguish between the min-buying, max-buying, and rank-buying models. Some of our results also extend to single-minded pricing, in which case products are strict complements and every customer seeks to buy a single set of products, which she purchases if the sum of prices is below her valuation for that set. For the min-buying model we show that the revenue maximization problem is not approximable within factor $\\mathcal{O}(\\log^{\\varepsilon}|\\mathcal{C}|)$ for some constant $\\varepsilon>0$, unless $\\mathrm{NP}\\subseteq\\mathrm{DTIME}(n^{\\mathcal{O}(\\log\\log n)})$, thereby almost closing the gap between the known algorithmic results and previous lower bounds. We also prove inapproximability within $\\mathcal{O}(\\ell^{\\varepsilon})$, $\\ell$ being an upper bound on the number of nonzero values per customer, and $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ under slightly stronger assumptions and provide matching upper bounds. Surprisingly, these hardness results hold even if a price ladder constraint, i.e., a predefined order on the prices of all products, is given. Without the price ladder constraint we obtain similar hardness results for the special case of uniform valuations, i.e., the case that every customer has identical values for all the products she is interested in, assuming specific hardness of the balanced bipartite independent set problem in constant degree graphs or hardness of refuting random 3CNF formulas. Introducing a slightly more general problem definition in which customers are given as an explicit probability distribution, we obtain inapproximability within $\\mathcal{O}(|\\mathcal{P}|^{\\varepsilon})$ assuming $\\mathrm{NP}\\nsubseteq\\bigcap_{\\delta>0}\\mathrm{BPTIME}(2^{\\mathcal{O}(n^{\\delta})})$. These results apply to single-minded pricing as well. For the max-buying model a polynomial-time approximation scheme exists if a price ladder is given. We give a matching lower bound by proving strong NP-hardness. Assuming limited product supply, we analyze a generic local search algorithm and prove that it is 2-approximate. Finally, we discuss implications for the rank-buying model.\r\n","lang":"eng"}],"publication":"SIAM Journal on Computing","citation":{"ieee":"P. Briest and P. Krysta, “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems,” <i>SIAM Journal on Computing</i>, pp. 1554–1586, 2011.","apa":"Briest, P., &#38; Krysta, P. (2011). Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. <i>SIAM Journal on Computing</i>, 1554–1586. <a href=\"https://doi.org/10.1137/090752353\">https://doi.org/10.1137/090752353</a>","short":"P. Briest, P. Krysta, SIAM Journal on Computing (2011) 1554–1586.","chicago":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” <i>SIAM Journal on Computing</i>, 2011, 1554–86. <a href=\"https://doi.org/10.1137/090752353\">https://doi.org/10.1137/090752353</a>.","mla":"Briest, Patrick, and Piotr Krysta. “Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems.” <i>SIAM Journal on Computing</i>, 2011, pp. 1554–86, doi:<a href=\"https://doi.org/10.1137/090752353\">10.1137/090752353</a>.","bibtex":"@article{Briest_Krysta_2011, title={Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems}, DOI={<a href=\"https://doi.org/10.1137/090752353\">10.1137/090752353</a>}, journal={SIAM Journal on Computing}, author={Briest, Patrick and Krysta, Piotr}, year={2011}, pages={1554–1586} }","ama":"Briest P, Krysta P. Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems. <i>SIAM Journal on Computing</i>. 2011:1554-1586. doi:<a href=\"https://doi.org/10.1137/090752353\">10.1137/090752353</a>"}},{"publication_status":"published","date_updated":"2022-01-06T06:54:33Z","title":"Collisionless Gathering of Robots with an Extent","status":"public","year":"2011","author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Hüllmann, Martina","first_name":"Martina","last_name":"Hüllmann"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"full_name":"Klaas, Alexander","first_name":"Alexander","last_name":"Klaas"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"last_name":"Kurras","first_name":"Sven","full_name":"Kurras, Sven"},{"full_name":"Märtens, Marcus","last_name":"Märtens","first_name":"Marcus"},{"full_name":"auf der Heide, Friedhelm Meyer","first_name":"Friedhelm Meyer","last_name":"auf der Heide"},{"last_name":"Raupach","first_name":"Christoph","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"id":"3902","full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"user_id":"3902","doi":"10.1007/978-3-642-18381-2_15","_id":"20709","language":[{"iso":"eng"}],"publication":"SOFSEM 2011: Theory and Practice of Computer Science","citation":{"apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>","ieee":"A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an Extent,” in <i>SOFSEM 2011: Theory and Practice of Computer Science</i>, Berlin, Heidelberg, 2011.","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F.M. auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.","mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” <i>SOFSEM 2011: Theory and Practice of Computer Science</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>.","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: <i>SOFSEM 2011: Theory and Practice of Computer Science</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={Collisionless Gathering of Robots with an Extent}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>}, booktitle={SOFSEM 2011: Theory and Practice of Computer Science}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and auf der Heide, Friedhelm Meyer and et al.}, year={2011} }"},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-12-12T11:15:30Z","place":"Berlin, Heidelberg"},{"citation":{"ieee":"A. Cord-Landwehr <i>et al.</i>, “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 2011.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” <i>Automata, Languages and Programming</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>."},"publication":"Automata, Languages and Programming","place":"Berlin, Heidelberg","date_created":"2020-12-12T12:22:41Z","department":[{"_id":"63"}],"type":"book_chapter","publication_identifier":{"isbn":["9783642220111","9783642220128"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"full_name":"Hüllmann, Martina","last_name":"Hüllmann","first_name":"Martina"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Klaas, Alexander","last_name":"Klaas","first_name":"Alexander"},{"full_name":"Kling, Peter","first_name":"Peter","last_name":"Kling"},{"full_name":"Kurras, Sven","last_name":"Kurras","first_name":"Sven"},{"full_name":"Märtens, Marcus","first_name":"Marcus","last_name":"Märtens"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Christoph","last_name":"Raupach","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"id":"3902","full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"first_name":"Christoph","last_name":"Weddemann","full_name":"Weddemann, Christoph"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","year":"2011","status":"public","date_updated":"2022-01-06T06:54:33Z","publication_status":"published","_id":"20710","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-22012-8_52","user_id":"3902"},{"publication":"8. Paderborner Workshop Entwurf mechatronischer Systeme","citation":{"short":"J. Meyer, J. Holtmann, M. Meyer, in: 8. Paderborner Workshop Entwurf Mechatronischer Systeme, Heinz Nixdorf Institut, 2011, pp. 203–215.","chicago":"Meyer, Jan, Jörg Holtmann, and Matthias Meyer. “Formalisierung von Anforderungen Und Betriebssystemeigenschaften Zur Fruehzeitigen Simulation von Eingebetteten, Automobilen Systemen.” In <i>8. Paderborner Workshop Entwurf Mechatronischer Systeme</i>, 294:203–15. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Heinz Nixdorf Institut, 2011.","apa":"Meyer, J., Holtmann, J., &#38; Meyer, M. (2011). Formalisierung von Anforderungen und Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten, automobilen Systemen. <i>8. Paderborner Workshop Entwurf Mechatronischer Systeme</i>, <i>294</i>, 203–215.","ieee":"J. Meyer, J. Holtmann, and M. Meyer, “Formalisierung von Anforderungen und Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten, automobilen Systemen,” in <i>8. Paderborner Workshop Entwurf mechatronischer Systeme</i>, 2011, vol. 294, pp. 203–215.","ama":"Meyer J, Holtmann J, Meyer M. Formalisierung von Anforderungen und Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten, automobilen Systemen. In: <i>8. Paderborner Workshop Entwurf Mechatronischer Systeme</i>. Vol 294. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Heinz Nixdorf Institut; 2011:203-215.","bibtex":"@inproceedings{Meyer_Holtmann_Meyer_2011, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Formalisierung von Anforderungen und Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten, automobilen Systemen}, volume={294}, booktitle={8. Paderborner Workshop Entwurf mechatronischer Systeme}, publisher={Heinz Nixdorf Institut}, author={Meyer, Jan and Holtmann, Jörg and Meyer, Matthias}, year={2011}, pages={203–215}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Meyer, Jan, et al. “Formalisierung von Anforderungen Und Betriebssystemeigenschaften Zur Fruehzeitigen Simulation von Eingebetteten, Automobilen Systemen.” <i>8. Paderborner Workshop Entwurf Mechatronischer Systeme</i>, vol. 294, Heinz Nixdorf Institut, 2011, pp. 203–15."},"abstract":[{"text":"Durch die immer kuerzer werdenden Entwicklungszyklen und den groeßer werdenden Druck bzgl. Time-to-Market fuer eingebettete Systeme im Automobilsektor steigt der Bedarf, die Systeme bereits zu fruehen Entwicklungszeitpunkten gegenueber den Qualitaetsanforderungen (z. B. Zeitanforderungen und Ressourcenauslastung) zu verifizieren. Wir stellen einen Ansatz vor, der eine formale Spezifikation von Zeitanforderungen und Wirkketten sowie deren fruehzeitige Analyse durch Simulation erlaubt. Verletzungen von Zeitanforderungen werden in den Simulationsergebnissen automatisch erkannt.\r\n","lang":"ger"}],"date_created":"2021-01-12T14:25:00Z","type":"conference","department":[{"_id":"76"},{"_id":"241"}],"year":"2011","status":"public","title":"Formalisierung von Anforderungen und Betriebssystemeigenschaften zur fruehzeitigen Simulation von eingebetteten, automobilen Systemen","author":[{"last_name":"Meyer","first_name":"Jan","full_name":"Meyer, Jan"},{"id":"3875","first_name":"Jörg","last_name":"Holtmann","orcid":"0000-0001-6141-4571","full_name":"Holtmann, Jörg"},{"last_name":"Meyer","first_name":"Matthias","full_name":"Meyer, Matthias","id":"683"}],"date_updated":"2022-01-06T06:54:41Z","intvolume":"       294","page":"203-215","language":[{"iso":"eng"}],"_id":"20915","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","publisher":"Heinz Nixdorf Institut","user_id":"5786","volume":294},{"date_updated":"2022-01-06T06:54:41Z","title":"A Seamless Model-Based Development Process for Automotive Systems","year":"2011","status":"public","author":[{"id":"3875","full_name":"Holtmann, Jörg","orcid":"0000-0001-6141-4571","last_name":"Holtmann","first_name":"Jörg"},{"full_name":"Meyer, Jan","last_name":"Meyer","first_name":"Jan"},{"last_name":"Meyer","first_name":"Matthias","full_name":"Meyer, Matthias","id":"683"}],"user_id":"5786","volume":"P-184","page":"79-88","_id":"20916","series_title":"GI-Edition Lecture Notes in Informatics (LNI)","publisher":"Bonner Koellen Verlag","language":[{"iso":"eng"}],"abstract":[{"text":"Safety critical functions for embedded systems are increasingly realized with software. Current and future standards and maturity models impose high accuracy and quality for the development process of such software-intensive, embedded systems. But nowadays, there are process and tooling gaps between different modeling aspects for the system under development (SUD). Furthermore, the SUD is usually verified and validated not until it is completely implemented, which leads to expensive corrections. In this paper we present a seamless, model-based development process, which is intended for the automotive supplier domain and conforms to the process reference model of Automotive SPICE. The development process addresses the issues mentioned above by using systematic transitions between different modeling aspects and simulations in early development stages.","lang":"eng"}],"publication":"Software Engineering 2011 – Workshopband (inkl. Doktorandensymposium)","citation":{"ieee":"J. Holtmann, J. Meyer, and M. Meyer, “A Seamless Model-Based Development Process for Automotive Systems,” in <i>Software Engineering 2011 – Workshopband (inkl. Doktorandensymposium)</i>, 2011, vol. P-184, pp. 79–88.","apa":"Holtmann, J., Meyer, J., &#38; Meyer, M. (2011). A Seamless Model-Based Development Process for Automotive Systems. <i>Software Engineering 2011 – Workshopband (Inkl. Doktorandensymposium)</i>, <i>P-184</i>, 79–88.","short":"J. Holtmann, J. Meyer, M. Meyer, in: Software Engineering 2011 – Workshopband (Inkl. Doktorandensymposium), Bonner Koellen Verlag, 2011, pp. 79–88.","chicago":"Holtmann, Jörg, Jan Meyer, and Matthias Meyer. “A Seamless Model-Based Development Process for Automotive Systems.” In <i>Software Engineering 2011 – Workshopband (Inkl. Doktorandensymposium)</i>, P-184:79–88. GI-Edition Lecture Notes in Informatics (LNI). Bonner Koellen Verlag, 2011.","mla":"Holtmann, Jörg, et al. “A Seamless Model-Based Development Process for Automotive Systems.” <i>Software Engineering 2011 – Workshopband (Inkl. Doktorandensymposium)</i>, vol. P-184, Bonner Koellen Verlag, 2011, pp. 79–88.","bibtex":"@inproceedings{Holtmann_Meyer_Meyer_2011, series={GI-Edition Lecture Notes in Informatics (LNI)}, title={A Seamless Model-Based Development Process for Automotive Systems}, volume={P-184}, booktitle={Software Engineering 2011 – Workshopband (inkl. Doktorandensymposium)}, publisher={Bonner Koellen Verlag}, author={Holtmann, Jörg and Meyer, Jan and Meyer, Matthias}, year={2011}, pages={79–88}, collection={GI-Edition Lecture Notes in Informatics (LNI)} }","ama":"Holtmann J, Meyer J, Meyer M. A Seamless Model-Based Development Process for Automotive Systems. In: <i>Software Engineering 2011 – Workshopband (Inkl. Doktorandensymposium)</i>. Vol P-184. GI-Edition Lecture Notes in Informatics (LNI). Bonner Koellen Verlag; 2011:79-88."},"type":"conference","department":[{"_id":"76"},{"_id":"241"}],"date_created":"2021-01-12T14:26:06Z"}]