\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n

\n generated by\n \n $\"bibbase.org\"\n$ \n \n

\n \n\n

\n\n

\n \n Group by\n \n \n
- \n Year\n
- \n Author\n
- \n Type\n
- \n Keyword\n
- \n Downloads\n
\n
\n \n \n \n \n
- \n \n Expand/Collapse All\n \n
- \n \n Download BibTeX\n \n
- \n \n RSS Feed\n \n
\n

\n\n\n

\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n

\n JavaScript\n (easiest)\n

\n            <script src=\"https://bibbase.org/show?bib=https://git.informatik.uni-hamburg.de/tea/homepage-public/raw/master/publications/researchgroup.bib&jsonp=1&nocache=1&jsonp=1\"></script>\n

\n\n PHP\n

\n            <?php\n            $contents = file_get_contents(\"https://bibbase.org/show?bib=https://git.informatik.uni-hamburg.de/tea/homepage-public/raw/master/publications/researchgroup.bib&jsonp=1&nocache=1\");\n            print_r($contents);\n            ?>\n

\n\n iFrame\n (not recommended)\n

\n            <iframe src=\"https://bibbase.org/show?bib=https://git.informatik.uni-hamburg.de/tea/homepage-public/raw/master/publications/researchgroup.bib&jsonp=1&nocache=1\"></iframe>\n

\n\n

\n For more details see the documention.\n

\n\n

\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n

\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

renew the authorization for BibBase on Mendeley, and
update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n

\n\n

\n \n \n Fix it now\n

\n\n

\n\n\n

\n \n \n

\n \n 2024\n \n \n (1)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Population Protocols for Exact Plurality Consensus - How a small chance of failure helps to eliminate insignificant opinions.\n \n \n \n \n\n\n \n Bankhamer, G.; Berenbrink, P.; Biermeier, F.; Elsässer, R.; Hosseinpour, H.; Kaaser, D.; and Kling, P.\n\n\n \n\n\n\n CoRR, abs/2402.06471. 2024.\n \n\n\n\n
\n\n\n\n \n \n $\"Population$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2402-06471,\n\tauthor = {Bankhamer, Gregor and Berenbrink, Petra and Biermeier, Felix and Els{\\"{a}}sser, Robert and Hosseinpour, Hamed and Kaaser, Dominik and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2402-06471.bib},\n\tdoi = {10.48550/ARXIV.2402.06471},\n\teprint = {2402.06471},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Fri, 16 Feb 2024 00:00:00 +0100},\n\ttitle = {Population Protocols for Exact Plurality Consensus - How a small chance of failure helps to eliminate insignificant opinions},\n\turl = {https://doi.org/10.48550/arXiv.2402.06471},\n\tvolume = {abs/2402.06471},\n\tyear = {2024},\n\tbdsk-url-1 = {https://doi.org/10.48550/arXiv.2402.06471}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2023\n \n \n (6)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Improved Scheduling with a Shared Resource.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; and Schneider, F.\n\n\n \n\n\n\n In Wu, W.; and Guo, J., editor(s), Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part I, volume 14461, of Lecture Notes in Computer Science, pages 154–167, 2023. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"Improved$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cocoa/DameriusKS23,\n\tauthor = {Damerius, Christoph and Kling, Peter and Schneider, Florian},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/cocoa/DameriusKS23.bib},\n\tbooktitle = {Combinatorial Optimization and Applications - 17th International Conference, {COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part {I}},\n\tdoi = {10.1007/978-3-031-49611-0\\_11},\n\teditor = {Wu, Weili and Guo, Jianxiong},\n\tpages = {154--167},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Thu, 08 Feb 2024 00:00:00 +0100},\n\ttitle = {Improved Scheduling with a Shared Resource},\n\turl = {https://doi.org/10.1007/978-3-031-49611-0\\_11},\n\tvolume = {14461},\n\tyear = {2023},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-031-49611-0%5C_11}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; Li, M.; Xu, C.; and Zhang, R.\n\n\n \n\n\n\n In Gørtz, I. L.; Farach-Colton, M.; Puglisi, S. J.; and Herman, G., editor(s), 31st Annual European Symposium on Algorithms, ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands, volume 274, of LIPIcs, pages 38:1–38:15, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"Scheduling$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/esa/DameriusKLX023,\n\tauthor = {Damerius, Christoph and Kling, Peter and Li, Minming and Xu, Chenyang and Zhang, Ruilong},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/esa/DameriusKLX023.bib},\n\tbooktitle = {31st Annual European Symposium on Algorithms, {ESA} 2023, September 4-6, 2023, Amsterdam, The Netherlands},\n\tdoi = {10.4230/LIPICS.ESA.2023.38},\n\teditor = {Gørtz, Inge Li and Farach{-}Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz},\n\tpages = {38:1--38:15},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {LIPIcs},\n\ttimestamp = {Sun, 17 Dec 2023 00:00:00 +0100},\n\ttitle = {Scheduling with a Limited Testing Budget: Tight Results for the Offline and Oblivious Settings},\n\turl = {https://doi.org/10.4230/LIPIcs.ESA.2023.38},\n\tvolume = {274},\n\tyear = {2023},\n\tbdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ESA.2023.38}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Scheduling with a Limited Testing Budget.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; Li, M.; Xu, C.; and Zhang, R.\n\n\n \n\n\n\n CoRR, abs/2306.15597. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Scheduling$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2306-15597,\n\tauthor = {Damerius, Christoph and Kling, Peter and Li, Minming and Xu, Chenyang and Zhang, Ruilong},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2306-15597.bib},\n\tdoi = {10.48550/ARXIV.2306.15597},\n\teprint = {2306.15597},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Sun, 17 Dec 2023 00:00:00 +0100},\n\ttitle = {Scheduling with a Limited Testing Budget},\n\turl = {https://doi.org/10.48550/arXiv.2306.15597},\n\tvolume = {abs/2306.15597},\n\tyear = {2023},\n\tbdsk-url-1 = {https://doi.org/10.48550/arXiv.2306.15597}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Improved Scheduling with a Shared Resource.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; and Schneider, F.\n\n\n \n\n\n\n CoRR, abs/2310.05732. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Improved$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2310-05732,\n\tauthor = {Damerius, Christoph and Kling, Peter and Schneider, Florian},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2310-05732.bib},\n\tdoi = {10.48550/ARXIV.2310.05732},\n\teprint = {2310.05732},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Thu, 08 Feb 2024 00:00:00 +0100},\n\ttitle = {Improved Scheduling with a Shared Resource},\n\turl = {https://doi.org/10.48550/arXiv.2310.05732},\n\tvolume = {abs/2310.05732},\n\tyear = {2023},\n\tbdsk-url-1 = {https://doi.org/10.48550/arXiv.2310.05732}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Moving Target Defense for Service-Oriented Mission-Critical Networks.\n \n \n \n \n\n\n \n Ergenc, D.; Schneider, F.; Kling, P.; and Fischer, M.\n\n\n \n\n\n\n In 32nd International Conference on Computer Communications and Networks, ICCCN 2023, Honolulu, HI, USA, July 24-27, 2023, pages 1–10, 2023. IEEE\n \n\n\n\n
\n\n\n\n \n \n $\"Moving$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icccn/ErgencSKF23,\n\tauthor = {Ergenc, Doganalp and Schneider, Florian and Kling, Peter and Fischer, Mathias},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icccn/ErgencSKF23.bib},\n\tbooktitle = {32nd International Conference on Computer Communications and Networks, {ICCCN} 2023, Honolulu, HI, USA, July 24-27, 2023},\n\tdoi = {10.1109/ICCCN58024.2023.10230175},\n\tpages = {1--10},\n\tpublisher = {{IEEE}},\n\ttimestamp = {Thu, 08 Feb 2024 00:00:00 +0100},\n\ttitle = {Moving Target Defense for Service-Oriented Mission-Critical Networks},\n\turl = {https://doi.org/10.1109/ICCCN58024.2023.10230175},\n\tyear = {2023},\n\tbdsk-url-1 = {https://doi.org/10.1109/ICCCN58024.2023.10230175}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Moving Target Defense for Service-oriented Mission-critical Networks.\n \n \n \n \n\n\n \n Ergenç, D.; Schneider, F.; Kling, P.; and Fischer, M.\n\n\n \n\n\n\n CoRR, abs/2303.09893. 2023.\n \n\n\n\n
\n\n\n\n \n \n $\"Moving$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2303-09893,\n\tauthor = {Ergen{\\c{c}}, Doganalp and Schneider, Florian and Kling, Peter and Fischer, Mathias},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2303-09893.bib},\n\tdoi = {10.48550/ARXIV.2303.09893},\n\teprint = {2303.09893},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Thu, 08 Feb 2024 00:00:00 +0100},\n\ttitle = {Moving Target Defense for Service-oriented Mission-critical Networks},\n\turl = {https://doi.org/10.48550/arXiv.2303.09893},\n\tvolume = {abs/2303.09893},\n\tyear = {2023},\n\tbdsk-url-1 = {https://doi.org/10.48550/arXiv.2303.09893}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2022\n \n \n (6)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n A discrete and continuous study of the Max-Chain-Formation problem.\n \n \n \n \n\n\n \n Castenow, J.; Kling, P.; Knollmann, T.; and auf der Heide, F. M.\n\n\n \n\n\n\n Inf. Comput., 285(Part): 104877. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/iandc/CastenowKKH22,\n\tauthor = {Castenow, Jannik and Kling, Peter and Knollmann, Till and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/iandc/CastenowKKH22.bib},\n\tdoi = {10.1016/J.IC.2022.104877},\n\tjournal = {Inf. Comput.},\n\tnumber = {Part},\n\tpages = {104877},\n\ttimestamp = {Thu, 23 Jun 2022 01:00:00 +0200},\n\ttitle = {A discrete and continuous study of the Max-Chain-Formation problem},\n\turl = {https://doi.org/10.1016/j.ic.2022.104877},\n\tvolume = {285},\n\tyear = {2022},\n\tbdsk-url-1 = {https://doi.org/10.1016/j.ic.2022.104877}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Dataset of Student Solutions to Algorithm and Data Structure Programming Assignments.\n \n \n \n \n\n\n \n Petersen-Frey, F.; Soll, M.; Kobras, L.; Johannsen, M.; Kling, P.; and Biemann, C.\n\n\n \n\n\n\n In Calzolari, N.; Béchet, F.; Blache, P.; Choukri, K.; Cieri, C.; Declerck, T.; Goggi, S.; Isahara, H.; Maegaard, B.; Mariani, J.; Mazo, H.; Odijk, J.; and Piperidis, S., editor(s), Proceedings of the Thirteenth Language Resources and Evaluation Conference, LREC 2022, Marseille, France, 20-25 June 2022, pages 956–962, 2022. European Language Resources Association\n \n\n\n\n
\n\n\n\n \n \n $\"Dataset$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/lrec/Petersen-FreySK22,\n\tauthor = {Petersen{-}Frey, Fynn and Soll, Marcus and Kobras, Louis and Johannsen, Melf and Kling, Peter and Biemann, Chris},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/lrec/Petersen-FreySK22.bib},\n\tbooktitle = {Proceedings of the Thirteenth Language Resources and Evaluation Conference, {LREC} 2022, Marseille, France, 20-25 June 2022},\n\teditor = {Calzolari, Nicoletta and B{\\'{e}}chet, Fr{\\'{e}}d{\\'{e}}ric and Blache, Philippe and Choukri, Khalid and Cieri, Christopher and Declerck, Thierry and Goggi, Sara and Isahara, Hitoshi and Maegaard, Bente and Mariani, Joseph and Mazo, H{\\'{e}}l{\\`{e}}ne and Odijk, Jan and Piperidis, Stelios},\n\tpages = {956--962},\n\tpublisher = {European Language Resources Association},\n\ttimestamp = {Sat, 30 Sep 2023 01:00:00 +0200},\n\ttitle = {Dataset of Student Solutions to Algorithm and Data Structure Programming Assignments},\n\turl = {https://aclanthology.org/2022.lrec-1.101},\n\tyear = {2022},\n\tbdsk-url-1 = {https://aclanthology.org/2022.lrec-1.101}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility.\n \n \n \n \n\n\n \n Castenow, J.; Harbig, J.; Jung, D.; Kling, P.; Knollmann, T.; and auf der Heide, F. M.\n\n\n \n\n\n\n In Hillel, E.; Palmieri, R.; and Rivière, E., editor(s), 26th International Conference on Principles of Distributed Systems, OPODIS 2022, December 13-15, 2022, Brussels, Belgium, volume 253, of LIPIcs, pages 15:1–15:25, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/opodis/CastenowH0KKH22,\n\tauthor = {Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/opodis/CastenowH0KKH22.bib},\n\tbooktitle = {26th International Conference on Principles of Distributed Systems, {OPODIS} 2022, December 13-15, 2022, Brussels, Belgium},\n\tdoi = {10.4230/LIPICS.OPODIS.2022.15},\n\teditor = {Hillel, Eshcar and Palmieri, Roberto and Rivi{\\`{e}}re, Etienne},\n\tpages = {15:1--15:25},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {LIPIcs},\n\ttimestamp = {Wed, 15 Feb 2023 17:36:11 +0100},\n\ttitle = {A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility},\n\turl = {https://doi.org/10.4230/LIPIcs.OPODIS.2022.15},\n\tvolume = {253},\n\tyear = {2022},\n\tbdsk-url-1 = {https://doi.org/10.4230/LIPIcs.OPODIS.2022.15}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions.\n \n \n \n \n\n\n \n Bankhamer, G.; Berenbrink, P.; Biermeier, F.; Elsässer, R.; Hosseinpour, H.; Kaaser, D.; and Kling, P.\n\n\n \n\n\n\n In Milani, A.; and Woelfel, P., editor(s), PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pages 224–234, 2022. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Population$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/podc/BankhamerBBEHKK22,\n\tauthor = {Bankhamer, Gregor and Berenbrink, Petra and Biermeier, Felix and Els{\\"{a}}sser, Robert and Hosseinpour, Hamed and Kaaser, Dominik and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/podc/BankhamerBBEHKK22.bib},\n\tbooktitle = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022},\n\tdoi = {10.1145/3519270.3538447},\n\teditor = {Milani, Alessia and Woelfel, Philipp},\n\tpages = {224--234},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 25 Jul 2022 15:01:51 +0200},\n\ttitle = {Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions},\n\turl = {https://doi.org/10.1145/3519270.3538447},\n\tyear = {2022},\n\tbdsk-url-1 = {https://doi.org/10.1145/3519270.3538447}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fast Consensus via the Unconstrained Undecided State Dynamics.\n \n \n \n \n\n\n \n Bankhamer, G.; Berenbrink, P.; Biermeier, F.; Elsässer, R.; Hosseinpour, H.; Kaaser, D.; and Kling, P.\n\n\n \n\n\n\n In Naor, J. (.; and Buchbinder, N., editor(s), Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pages 3417–3429, 2022. SIAM\n \n\n\n\n
\n\n\n\n \n \n $\"Fast$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/soda/BankhamerBBEHKK22,\n\tauthor = {Bankhamer, Gregor and Berenbrink, Petra and Biermeier, Felix and Els{\\"{a}}sser, Robert and Hosseinpour, Hamed and Kaaser, Dominik and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/soda/BankhamerBBEHKK22.bib},\n\tbooktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},\n\tdoi = {10.1137/1.9781611977073.135},\n\teditor = {Naor, Joseph (Seffi) and Buchbinder, Niv},\n\tpages = {3417--3429},\n\tpublisher = {{SIAM}},\n\ttimestamp = {Tue, 12 Apr 2022 11:24:56 +0200},\n\ttitle = {Fast Consensus via the Unconstrained Undecided State Dynamics},\n\turl = {https://doi.org/10.1137/1.9781611977073.135},\n\tyear = {2022},\n\tbdsk-url-1 = {https://doi.org/10.1137/1.9781611977073.135}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility.\n \n \n \n \n\n\n \n Castenow, J.; Harbig, J.; Jung, D.; Kling, P.; Knollmann, T.; and auf der Heide, F. M.\n\n\n \n\n\n\n CoRR, abs/2206.07567. 2022.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2206-07567,\n\tauthor = {Castenow, Jannik and Harbig, Jonas and Jung, Daniel and Kling, Peter and Knollmann, Till and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2206-07567.bib},\n\tdoi = {10.48550/ARXIV.2206.07567},\n\teprint = {2206.07567},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Tue, 21 Jun 2022 01:00:00 +0200},\n\ttitle = {A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility},\n\turl = {https://doi.org/10.48550/arXiv.2206.07567},\n\tvolume = {abs/2206.07567},\n\tyear = {2022},\n\tbdsk-url-1 = {https://doi.org/10.48550/arXiv.2206.07567}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2021\n \n \n (8)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n On Greedily Packing Anchored Rectangles.\n \n \n \n \n\n\n \n Damerius, C.; Kaaser, D.; Kling, P.; and Schneider, F.\n\n\n \n\n\n\n In Bansal, N.; Merelli, E.; and Worrell, J., editor(s), 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference), volume 198, of LIPIcs, pages 61:1–61:20, 2021. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icalp/DameriusKKS21,\n\tauthor = {Damerius, Christoph and Kaaser, Dominik and Kling, Peter and Schneider, Florian},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icalp/DameriusKKS21.bib},\n\tbooktitle = {48th International Colloquium on Automata, Languages, and Programming, {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},\n\tdoi = {10.4230/LIPICS.ICALP.2021.61},\n\teditor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},\n\tpages = {61:1--61:20},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {LIPIcs},\n\ttimestamp = {Thu, 08 Feb 2024 00:00:00 +0100},\n\ttitle = {On Greedily Packing Anchored Rectangles},\n\turl = {https://doi.org/10.4230/LIPIcs.ICALP.2021.61},\n\tvolume = {198},\n\tyear = {2021},\n\tbdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ICALP.2021.61}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On Minimum Generalized Manhattan Connections.\n \n \n \n \n\n\n \n Antoniadis, A.; Capretto, M.; Chalermsook, P.; Damerius, C.; Kling, P.; Nölke, L.; Acosta, N. O.; and Spoerhase, J.\n\n\n \n\n\n\n In Lubiw, A.; and Salavatipour, M. R., editor(s), Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings, volume 12808, of Lecture Notes in Computer Science, pages 85–100, 2021. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/wads/AntoniadisCCDKN21,\n\tauthor = {Antoniadis, Antonios and Capretto, Margarita and Chalermsook, Parinya and Damerius, Christoph and Kling, Peter and N{\\"{o}}lke, Lukas and Acosta, Nidia Obscura and Spoerhase, Joachim},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/wads/AntoniadisCCDKN21.bib},\n\tbooktitle = {Algorithms and Data Structures - 17th International Symposium, {WADS} 2021, Virtual Event, August 9-11, 2021, Proceedings},\n\tdoi = {10.1007/978-3-030-83508-8\\_7},\n\teditor = {Lubiw, Anna and Salavatipour, Mohammad R.},\n\tpages = {85--100},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Wed, 10 May 2023 01:00:00 +0200},\n\ttitle = {On Minimum Generalized Manhattan Connections},\n\turl = {https://doi.org/10.1007/978-3-030-83508-8\\_7},\n\tvolume = {12808},\n\tyear = {2021},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-030-83508-8%5C_7}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On Greedily Packing Anchored Rectangles.\n \n \n \n \n\n\n \n Damerius, C.; Kaaser, D.; Kling, P.; and Schneider, F.\n\n\n \n\n\n\n CoRR, abs/2102.08181. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 4 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2102-08181,\n\tauthor = {Damerius, Christoph and Kaaser, Dominik and Kling, Peter and Schneider, Florian},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2102-08181.bib},\n\teprint = {2102.08181},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Thu, 08 Feb 2024 00:00:00 +0100},\n\ttitle = {On Greedily Packing Anchored Rectangles},\n\turl = {https://arxiv.org/abs/2102.08181},\n\tvolume = {abs/2102.08181},\n\tyear = {2021},\n\tbdsk-url-1 = {https://arxiv.org/abs/2102.08181}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Student Performance and Collaboration in Introductory Courses to Theory of Computation (Studierendenperformance und Kollaboration in Einführungskursen der Theoretischen Informatik).\n \n \n \n \n\n\n \n Frede, C.\n\n\n \n\n\n\n Ph.D. Thesis, University of Hamburg, Germany, 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Student$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@phdthesis{DBLP:phd/basesearch/Frede21,\n\tauthor = {Frede, Christiane},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/phd/basesearch/Frede21.bib},\n\tschool = {University of Hamburg, Germany},\n\ttimestamp = {Thu, 15 Feb 2024 00:00:00 +0100},\n\ttitle = {Student Performance and Collaboration in Introductory Courses to Theory of Computation (Studierendenperformance und Kollaboration in Einf{\\"{u}}hrungskursen der Theoretischen Informatik)},\n\turl = {https://nbn-resolving.org/urn:nbn:de:gbv:18-ediss-98947},\n\turn = {urn:nbn:de:gbv:18-ediss-98947},\n\tyear = {2021},\n\tbdsk-url-1 = {https://nbn-resolving.org/urn:nbn:de:gbv:18-ediss-98947}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A differentiated picture of student performance in introductory courses to theory of computation.\n \n \n \n \n\n\n \n Frede, C.; and Knobelsdorf, M.\n\n\n \n\n\n\n Comput. Sci. Educ., 31(3): 315–339. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/csedu/FredeK21,\n\tauthor = {Frede, Christiane and Knobelsdorf, Maria},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/csedu/FredeK21.bib},\n\tdoi = {10.1080/08993408.2020.1809946},\n\tjournal = {Comput. Sci. Educ.},\n\tnumber = {3},\n\tpages = {315--339},\n\ttimestamp = {Thu, 13 Oct 2022 01:00:00 +0200},\n\ttitle = {A differentiated picture of student performance in introductory courses to theory of computation},\n\turl = {https://doi.org/10.1080/08993408.2020.1809946},\n\tvolume = {31},\n\tyear = {2021},\n\tbdsk-url-1 = {https://doi.org/10.1080/08993408.2020.1809946}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Time-space trade-offs in population protocols for the majority problem.\n \n \n \n \n\n\n \n Berenbrink, P.; Elsässer, R.; Friedetzky, T.; Kaaser, D.; Kling, P.; and Radzik, T.\n\n\n \n\n\n\n Distributed Comput., 34(2): 91–111. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Time-space$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/dc/BerenbrinkEFKKR21,\n\tauthor = {Berenbrink, Petra and Els{\\"{a}}sser, Robert and Friedetzky, Tom and Kaaser, Dominik and Kling, Peter and Radzik, Tomasz},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/dc/BerenbrinkEFKKR21.bib},\n\tdoi = {10.1007/S00446-020-00385-0},\n\tjournal = {Distributed Comput.},\n\tnumber = {2},\n\tpages = {91--111},\n\ttimestamp = {Sat, 09 Apr 2022 01:00:00 +0200},\n\ttitle = {Time-space trade-offs in population protocols for the majority problem},\n\turl = {https://doi.org/10.1007/s00446-020-00385-0},\n\tvolume = {34},\n\tyear = {2021},\n\tbdsk-url-1 = {https://doi.org/10.1007/s00446-020-00385-0}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Infinite Balanced Allocation via Finite Capacities.\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Hahn, C.; Hintze, L.; Kaaser, D.; Kling, P.; and Nagel, L.\n\n\n \n\n\n\n In 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, July 7-10, 2021, pages 965–975, 2021. IEEE\n \n\n\n\n
\n\n\n\n \n \n $\"Infinite$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icdcs/BerenbrinkFHHKK21,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Hahn, Christopher and Hintze, Lukas and Kaaser, Dominik and Kling, Peter and Nagel, Lars},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icdcs/BerenbrinkFHHKK21.bib},\n\tbooktitle = {41st {IEEE} International Conference on Distributed Computing Systems, {ICDCS} 2021, Washington DC, USA, July 7-10, 2021},\n\tdoi = {10.1109/ICDCS51616.2021.00096},\n\tpages = {965--975},\n\tpublisher = {{IEEE}},\n\ttimestamp = {Sat, 09 Apr 2022 01:00:00 +0200},\n\ttitle = {Infinite Balanced Allocation via Finite Capacities},\n\turl = {https://doi.org/10.1109/ICDCS51616.2021.00096},\n\tyear = {2021},\n\tbdsk-url-1 = {https://doi.org/10.1109/ICDCS51616.2021.00096}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Fast Consensus via the Unconstrained Undecided State Dynamics.\n \n \n \n \n\n\n \n Bankhamer, G.; Berenbrink, P.; Biermeier, F.; Elsässer, R.; Hosseinpour, H.; Kaaser, D.; and Kling, P.\n\n\n \n\n\n\n CoRR, abs/2103.10366. 2021.\n \n\n\n\n
\n\n\n\n \n \n $\"Fast$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2103-10366,\n\tauthor = {Bankhamer, Gregor and Berenbrink, Petra and Biermeier, Felix and Els{\\"{a}}sser, Robert and Hosseinpour, Hamed and Kaaser, Dominik and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2103-10366.bib},\n\teprint = {2103.10366},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Wed, 24 Mar 2021 00:00:00 +0100},\n\ttitle = {Fast Consensus via the Unconstrained Undecided State Dynamics},\n\turl = {https://arxiv.org/abs/2103.10366},\n\tvolume = {abs/2103.10366},\n\tyear = {2021},\n\tbdsk-url-1 = {https://arxiv.org/abs/2103.10366}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2020\n \n \n (7)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Improved Scheduling with a Shared Resource via Structural Insights.\n \n \n \n \n\n\n \n Damerius, C.; Kling, P.; Li, M.; Schneider, F.; and Zhang, R.\n\n\n \n\n\n\n In Wu, W.; and Zhang, Z., editor(s), Combinatorial Optimization and Applications - 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11-13, 2020, Proceedings, volume 12577, of Lecture Notes in Computer Science, pages 168–182, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"Improved$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cocoa/DameriusKLSZ20,\n\tauthor = {Damerius, Christoph and Kling, Peter and Li, Minming and Schneider, Florian and Zhang, Ruilong},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/cocoa/DameriusKLSZ20.bib},\n\tbooktitle = {Combinatorial Optimization and Applications - 14th International Conference, {COCOA} 2020, Dallas, TX, USA, December 11-13, 2020, Proceedings},\n\tdoi = {10.1007/978-3-030-64843-5\\_12},\n\teditor = {Wu, Weili and Zhang, Zhongnan},\n\tpages = {168--182},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Thu, 08 Feb 2024 00:00:00 +0100},\n\ttitle = {Improved Scheduling with a Shared Resource via Structural Insights},\n\turl = {https://doi.org/10.1007/978-3-030-64843-5\\_12},\n\tvolume = {12577},\n\tyear = {2020},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-030-64843-5%5C_12}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On Minimum Generalized Manhattan Connections.\n \n \n \n \n\n\n \n Antoniadis, A.; Capretto, M.; Chalermsook, P.; Damerius, C.; Kling, P.; Nölke, L.; Acosta, N. O.; and Spoerhase, J.\n\n\n \n\n\n\n CoRR, abs/2010.14338. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2010-14338,\n\tauthor = {Antoniadis, Antonios and Capretto, Margarita and Chalermsook, Parinya and Damerius, Christoph and Kling, Peter and N{\\"{o}}lke, Lukas and Acosta, Nidia Obscura and Spoerhase, Joachim},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2010-14338.bib},\n\teprint = {2010.14338},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Wed, 10 May 2023 01:00:00 +0200},\n\ttitle = {On Minimum Generalized Manhattan Connections},\n\turl = {https://arxiv.org/abs/2010.14338},\n\tvolume = {abs/2010.14338},\n\tyear = {2020},\n\tbdsk-url-1 = {https://arxiv.org/abs/2010.14338}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Brief Announcement: Optimal Time and Space Leader Election in Population Protocols.\n \n \n \n \n\n\n \n Berenbrink, P.; Giakkoupis, G.; and Kling, P.\n\n\n \n\n\n\n In Emek, Y.; and Cachin, C., editor(s), PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020, pages 218–220, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Brief$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/podc/BerenbrinkGK20,\n\tauthor = {Berenbrink, Petra and Giakkoupis, George and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/podc/BerenbrinkGK20.bib},\n\tbooktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020},\n\tdoi = {10.1145/3382734.3405726},\n\teditor = {Emek, Yuval and Cachin, Christian},\n\tpages = {218--220},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Brief Announcement: Optimal Time and Space Leader Election in Population Protocols},\n\turl = {https://doi.org/10.1145/3382734.3405726},\n\tyear = {2020},\n\tbdsk-url-1 = {https://doi.org/10.1145/3382734.3405726}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up.\n \n \n \n \n\n\n \n Castenow, J.; Kling, P.; Knollmann, T.; and auf der Heide, F. M.\n\n\n \n\n\n\n In Scheideler, C.; and Spear, M., editor(s), SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, pages 515–517, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/spaa/CastenowKKH20,\n\tauthor = {Castenow, Jannik and Kling, Peter and Knollmann, Till and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/spaa/CastenowKKH20.bib},\n\tbooktitle = {{SPAA} '20: 32nd {ACM} Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020},\n\tdoi = {10.1145/3350755.3400263},\n\teditor = {Scheideler, Christian and Spear, Michael},\n\tpages = {515--517},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up},\n\turl = {https://doi.org/10.1145/3350755.3400263},\n\tyear = {2020},\n\tbdsk-url-1 = {https://doi.org/10.1145/3350755.3400263}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up.\n \n \n \n \n\n\n \n Castenow, J.; Kling, P.; Knollmann, T.; and auf der Heide, F. M.\n\n\n \n\n\n\n In Devismes, S.; and Mittal, N., editor(s), Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18-21, 2020, Proceedings, volume 12514, of Lecture Notes in Computer Science, pages 65–80, 2020. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/sss/CastenowKKH20,\n\tauthor = {Castenow, Jannik and Kling, Peter and Knollmann, Till and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/sss/CastenowKKH20.bib},\n\tbooktitle = {Stabilization, Safety, and Security of Distributed Systems - 22nd International Symposium, {SSS} 2020, Austin, TX, USA, November 18-21, 2020, Proceedings},\n\tdoi = {10.1007/978-3-030-64348-5\\_6},\n\teditor = {Devismes, St{\\'{e}}phane and Mittal, Neeraj},\n\tpages = {65--80},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up},\n\turl = {https://doi.org/10.1007/978-3-030-64348-5\\_6},\n\tvolume = {12514},\n\tyear = {2020},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-030-64348-5%5C_6}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Optimal time and space leader election in population protocols.\n \n \n \n \n\n\n \n Berenbrink, P.; Giakkoupis, G.; and Kling, P.\n\n\n \n\n\n\n In Makarychev, K.; Makarychev, Y.; Tulsiani, M.; Kamath, G.; and Chuzhoy, J., editor(s), Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, June 22-26, 2020, pages 119–129, 2020. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Optimal$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/stoc/BerenbrinkGK20,\n\tauthor = {Berenbrink, Petra and Giakkoupis, George and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/stoc/BerenbrinkGK20.bib},\n\tbooktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},\n\tdoi = {10.1145/3357713.3384312},\n\teditor = {Makarychev, Konstantin and Makarychev, Yury and Tulsiani, Madhur and Kamath, Gautam and Chuzhoy, Julia},\n\tpages = {119--129},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 18 Dec 2023 07:33:37 +0100},\n\ttitle = {Optimal time and space leader election in population protocols},\n\turl = {https://doi.org/10.1145/3357713.3384312},\n\tyear = {2020},\n\tbdsk-url-1 = {https://doi.org/10.1145/3357713.3384312}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Discrete and Continuous Study of the Max-Chain-Formation Problem.\n \n \n \n \n\n\n \n Castenow, J.; Kling, P.; Knollmann, T.; and auf der Heide, F. M.\n\n\n \n\n\n\n CoRR, abs/2010.02043. 2020.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-2010-02043,\n\tauthor = {Castenow, Jannik and Kling, Peter and Knollmann, Till and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-2010-02043.bib},\n\teprint = {2010.02043},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 12 Oct 2020 01:00:00 +0200},\n\ttitle = {A Discrete and Continuous Study of the Max-Chain-Formation Problem},\n\turl = {https://arxiv.org/abs/2010.02043},\n\tvolume = {abs/2010.02043},\n\tyear = {2020},\n\tbdsk-url-1 = {https://arxiv.org/abs/2010.02043}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2019\n \n \n (4)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Towards Efficient Reconstruction of Attacker Lateral Movement.\n \n \n \n \n\n\n \n Wilkens, F.; Haas, S.; Kaaser, D.; Kling, P.; and Fischer, M.\n\n\n \n\n\n\n In Proceedings of the 14th International Conference on Availability, Reliability and Security, ARES 2019, Canterbury, UK, August 26-29, 2019, pages 14:1–14:9, 2019. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Towards$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/IEEEares/WilkensHKK019,\n\tauthor = {Wilkens, Florian and Haas, Steffen and Kaaser, Dominik and Kling, Peter and Fischer, Mathias},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/IEEEares/WilkensHKK019.bib},\n\tbooktitle = {Proceedings of the 14th International Conference on Availability, Reliability and Security, {ARES} 2019, Canterbury, UK, August 26-29, 2019},\n\tdoi = {10.1145/3339252.3339254},\n\tpages = {14:1--14:9},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Towards Efficient Reconstruction of Attacker Lateral Movement},\n\turl = {https://doi.org/10.1145/3339252.3339254},\n\tyear = {2019},\n\tbdsk-url-1 = {https://doi.org/10.1145/3339252.3339254}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On the Complexity of Anchored Rectangle Packing.\n \n \n \n \n\n\n \n Antoniadis, A.; Biermeier, F.; Cristi, A.; Damerius, C.; Hoeksma, R.; Kaaser, D.; Kling, P.; and Nölke, L.\n\n\n \n\n\n\n In Bender, M. A.; Svensson, O.; and Herman, G., editor(s), 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, volume 144, of LIPIcs, pages 8:1–8:14, 2019. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/esa/AntoniadisBCDHK19,\n\tauthor = {Antoniadis, Antonios and Biermeier, Felix and Cristi, Andr{\\'{e}}s and Damerius, Christoph and Hoeksma, Ruben and Kaaser, Dominik and Kling, Peter and N{\\"{o}}lke, Lukas},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/esa/AntoniadisBCDHK19.bib},\n\tbooktitle = {27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany},\n\tdoi = {10.4230/LIPICS.ESA.2019.8},\n\teditor = {Bender, Michael A. and Svensson, Ola and Herman, Grzegorz},\n\tpages = {8:1--8:14},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {LIPIcs},\n\ttimestamp = {Wed, 10 May 2023 01:00:00 +0200},\n\ttitle = {On the Complexity of Anchored Rectangle Packing},\n\turl = {https://doi.org/10.4230/LIPIcs.ESA.2019.8},\n\tvolume = {144},\n\tyear = {2019},\n\tbdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ESA.2019.8}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Tight & Simple Load Balancing.\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Kaaser, D.; and Kling, P.\n\n\n \n\n\n\n In 2019 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2019, Rio de Janeiro, Brazil, May 20-24, 2019, pages 718–726, 2019. IEEE\n \n\n\n\n
\n\n\n\n \n \n $\"Tight$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ipps/BerenbrinkFKK19,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Kaaser, Dominik and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/ipps/BerenbrinkFKK19.bib},\n\tbooktitle = {2019 {IEEE} International Parallel and Distributed Processing Symposium, {IPDPS} 2019, Rio de Janeiro, Brazil, May 20-24, 2019},\n\tdoi = {10.1109/IPDPS.2019.00080},\n\tpages = {718--726},\n\tpublisher = {{IEEE}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Tight {\\&} Simple Load Balancing},\n\turl = {https://doi.org/10.1109/IPDPS.2019.00080},\n\tyear = {2019},\n\tbdsk-url-1 = {https://doi.org/10.1109/IPDPS.2019.00080}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Continuous Protocols for Swarm Robotics.\n \n \n \n \n\n\n \n Kling, P.; and auf der Heide, F. M.\n\n\n \n\n\n\n In Flocchini, P.; Prencipe, G.; and Santoro, N., editor(s), Distributed Computing by Mobile Entities, Current Research in Moving and Computing, volume 11340, of Lecture Notes in Computer Science, pages 317–334. Springer, 2019.\n \n\n\n\n
\n\n\n\n \n \n $\"Continuous$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@incollection{DBLP:series/lncs/KlingH19,\n\tauthor = {Kling, Peter and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/series/lncs/KlingH19.bib},\n\tbooktitle = {Distributed Computing by Mobile Entities, Current Research in Moving and Computing},\n\tdoi = {10.1007/978-3-030-11072-7\\_13},\n\teditor = {Flocchini, Paola and Prencipe, Giuseppe and Santoro, Nicola},\n\tpages = {317--334},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Continuous Protocols for Swarm Robotics},\n\turl = {https://doi.org/10.1007/978-3-030-11072-7\\_13},\n\tvolume = {11340},\n\tyear = {2019},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-030-11072-7%5C_13}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2018\n \n \n (10)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n Explorative Datenanalyse der Studierendenperformance in der Theoretischen Informatik.\n \n \n \n\n\n \n Frede, C.; and Knobelsdorf, M.\n\n\n \n\n\n\n In Bergner, N.; Röpke, R.; Schroeder, U.; and Krömker, D., editor(s), Hochschuldidaktik der Informatik - HDI 2018 - 8. Fachtagung des GI-Fachbereichs Informatik und Ausbildung/Didaktik der Informatik, Frankfurt, Germany, September 12-13, 2018, pages 135–150, 2018. Universitätsverlag Potsdam\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/hdi/FredeK18,\n\tauthor = {Frede, Christiane and Knobelsdorf, Maria},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/hdi/FredeK18.bib},\n\tbooktitle = {Hochschuldidaktik der Informatik - {HDI} 2018 - 8. Fachtagung des GI-Fachbereichs Informatik und Ausbildung/Didaktik der Informatik, Frankfurt, Germany, September 12-13, 2018},\n\teditor = {Bergner, Nadine and R{\\"{o}}pke, Ren{\\'{e}} and Schroeder, Ulrik and Kr{\\"{o}}mker, Detlef},\n\tpages = {135--150},\n\tpublisher = {Universit{\\"{a}}tsverlag Potsdam},\n\ttimestamp = {Thu, 03 Jan 2019 12:43:56 +0100},\n\ttitle = {Explorative Datenanalyse der Studierendenperformance in der Theoretischen Informatik},\n\tyear = {2018}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Exploring how Students Perform in a Theory of Computation Course using Final Exam and Homework Assignments Data.\n \n \n \n \n\n\n \n Frede, C.; and Knobelsdorf, M.\n\n\n \n\n\n\n In Malmi, L.; Korhonen, A.; McCartney, R.; and Petersen, A., editor(s), Proceedings of the 2018 ACM Conference on International Computing Education Research, ICER 2018, Espoo, Finland, August 13-15, 2018, pages 241–249, 2018. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Exploring$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 3 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icer/FredeK18,\n\tauthor = {Frede, Christiane and Knobelsdorf, Maria},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icer/FredeK18.bib},\n\tbooktitle = {Proceedings of the 2018 {ACM} Conference on International Computing Education Research, {ICER} 2018, Espoo, Finland, August 13-15, 2018},\n\tdoi = {10.1145/3230977.3230996},\n\teditor = {Malmi, Lauri and Korhonen, Ari and McCartney, Robert and Petersen, Andrew},\n\tpages = {241--249},\n\tpublisher = {{ACM}},\n\ttimestamp = {Fri, 18 Jun 2021 10:58:59 +0200},\n\ttitle = {Exploring how Students Perform in a Theory of Computation Course using Final Exam and Homework Assignments Data},\n\turl = {https://doi.org/10.1145/3230977.3230996},\n\tyear = {2018},\n\tbdsk-url-1 = {https://doi.org/10.1145/3230977.3230996}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins.\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Kling, P.; Mallmann-Trenn, F.; Nagel, L.; and Wastell, C.\n\n\n \n\n\n\n Algorithmica, 80(12): 3673–3703. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Self-Stabilizing$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/algorithmica/BerenbrinkFKMNW18,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Kling, Peter and Mallmann{-}Trenn, Frederik and Nagel, Lars and Wastell, Chris},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/algorithmica/BerenbrinkFKMNW18.bib},\n\tdoi = {10.1007/S00453-018-0411-Z},\n\tjournal = {Algorithmica},\n\tnumber = {12},\n\tpages = {3673--3703},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins},\n\turl = {https://doi.org/10.1007/s00453-018-0411-z},\n\tvolume = {80},\n\tyear = {2018},\n\tbdsk-url-1 = {https://doi.org/10.1007/s00453-018-0411-z}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Scheduling shared continuous resources on many-cores.\n \n \n \n \n\n\n \n Althaus, E.; Brinkmann, A.; Kling, P.; auf der Heide, F. M.; Nagel, L.; Riechers, S.; Sgall, J.; and Süß, T.\n\n\n \n\n\n\n J. Sched., 21(1): 77–92. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Scheduling$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/scheduling/AlthausBKHNRSS18,\n\tauthor = {Althaus, Ernst and Brinkmann, Andr{\\'{e}} and Kling, Peter and auf der Heide, Friedhelm Meyer and Nagel, Lars and Riechers, S{\\"{o}}ren and Sgall, Jir{\\'{\\i}} and S{\\"{u}}ß, Tim},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/scheduling/AlthausBKHNRSS18.bib},\n\tdoi = {10.1007/S10951-017-0518-0},\n\tjournal = {J. Sched.},\n\tnumber = {1},\n\tpages = {77--92},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Scheduling shared continuous resources on many-cores},\n\turl = {https://doi.org/10.1007/s10951-017-0518-0},\n\tvolume = {21},\n\tyear = {2018},\n\tbdsk-url-1 = {https://doi.org/10.1007/s10951-017-0518-0}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Simple and Efficient Leader Election.\n \n \n \n \n\n\n \n Berenbrink, P.; Kaaser, D.; Kling, P.; and Otterbach, L.\n\n\n \n\n\n\n In Seidel, R., editor(s), 1st Symposium on Simplicity in Algorithms, SOSA 2018, January 7-10, 2018, New Orleans, LA, USA, volume 61, of OASIcs, pages 9:1–9:11, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"Simple$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/soda/BerenbrinkKKO18,\n\tauthor = {Berenbrink, Petra and Kaaser, Dominik and Kling, Peter and Otterbach, Lena},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/soda/BerenbrinkKKO18.bib},\n\tbooktitle = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10, 2018, New Orleans, LA, {USA}},\n\tdoi = {10.4230/OASICS.SOSA.2018.9},\n\teditor = {Seidel, Raimund},\n\tpages = {9:1--9:11},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {OASIcs},\n\ttimestamp = {Tue, 15 Feb 2022 09:40:03 +0100},\n\ttitle = {Simple and Efficient Leader Election},\n\turl = {https://doi.org/10.4230/OASIcs.SOSA.2018.9},\n\tvolume = {61},\n\tyear = {2018},\n\tbdsk-url-1 = {https://doi.org/10.4230/OASIcs.SOSA.2018.9}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs.\n \n \n \n \n\n\n \n Berenbrink, P.; Giakkoupis, G.; and Kling, P.\n\n\n \n\n\n\n In Czumaj, A., editor(s), Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pages 1715–1733, 2018. SIAM\n \n\n\n\n
\n\n\n\n \n \n $\"Tight$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/soda/BerenbrinkGK18,\n\tauthor = {Berenbrink, Petra and Giakkoupis, George and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/soda/BerenbrinkGK18.bib},\n\tbooktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},\n\tdoi = {10.1137/1.9781611975031.112},\n\teditor = {Czumaj, Artur},\n\tpages = {1715--1733},\n\tpublisher = {{SIAM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs},\n\turl = {https://doi.org/10.1137/1.9781611975031.112},\n\tyear = {2018},\n\tbdsk-url-1 = {https://doi.org/10.1137/1.9781611975031.112}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.\n \n \n \n \n\n\n \n Berenbrink, P.; Elsässer, R.; Friedetzky, T.; Kaaser, D.; Kling, P.; and Radzik, T.\n\n\n \n\n\n\n In Schmid, U.; and Widder, J., editor(s), 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, volume 121, of LIPIcs, pages 10:1–10:18, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/wdag/BerenbrinkEFKKR18,\n\tauthor = {Berenbrink, Petra and Els{\\"{a}}sser, Robert and Friedetzky, Tom and Kaaser, Dominik and Kling, Peter and Radzik, Tomasz},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/wdag/BerenbrinkEFKKR18.bib},\n\tbooktitle = {32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018},\n\tdoi = {10.4230/LIPICS.DISC.2018.10},\n\teditor = {Schmid, Ulrich and Widder, Josef},\n\tpages = {10:1--10:18},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {LIPIcs},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States},\n\turl = {https://doi.org/10.4230/LIPIcs.DISC.2018.10},\n\tvolume = {121},\n\tyear = {2018},\n\tbdsk-url-1 = {https://doi.org/10.4230/LIPIcs.DISC.2018.10}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Majority & Stabilization in Population Protocols.\n \n \n \n \n\n\n \n Berenbrink, P.; Elsässer, R.; Friedetzky, T.; Kaaser, D.; Kling, P.; and Radzik, T.\n\n\n \n\n\n\n CoRR, abs/1805.04586. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Majority$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1805-04586,\n\tauthor = {Berenbrink, Petra and Els{\\"{a}}sser, Robert and Friedetzky, Tom and Kaaser, Dominik and Kling, Peter and Radzik, Tomasz},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-1805-04586.bib},\n\teprint = {1805.04586},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {Majority {\\&} Stabilization in Population Protocols},\n\turl = {http://arxiv.org/abs/1805.04586},\n\tvolume = {abs/1805.04586},\n\tyear = {2018},\n\tbdsk-url-1 = {http://arxiv.org/abs/1805.04586}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A population protocol for exact majority with O(\\log\$^\\mbox5/3\$n) stabilization time and asymptotically optimal number of states.\n \n \n \n \n\n\n \n Berenbrink, P.; Elsässer, R.; Friedetzky, T.; Kaaser, D.; Kling, P.; and Radzik, T.\n\n\n \n\n\n\n CoRR, abs/1805.05157. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1805-05157,\n\tauthor = {Berenbrink, Petra and Els{\\"{a}}sser, Robert and Friedetzky, Tom and Kaaser, Dominik and Kling, Peter and Radzik, Tomasz},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-1805-05157.bib},\n\teprint = {1805.05157},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {A population protocol for exact majority with O({\\textbackslash}log\\({}^{\\mbox{5/3}}\\)n) stabilization time and asymptotically optimal number of states},\n\turl = {http://arxiv.org/abs/1805.05157},\n\tvolume = {abs/1805.05157},\n\tyear = {2018},\n\tbdsk-url-1 = {http://arxiv.org/abs/1805.05157}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Simple Load Balancing.\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Kaaser, D.; and Kling, P.\n\n\n \n\n\n\n CoRR, abs/1808.05389. 2018.\n \n\n\n\n
\n\n\n\n \n \n $\"Simple$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1808-05389,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Kaaser, Dominik and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-1808-05389.bib},\n\teprint = {1808.05389},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Sun, 02 Sep 2018 01:00:00 +0200},\n\ttitle = {Simple Load Balancing},\n\turl = {http://arxiv.org/abs/1808.05389},\n\tvolume = {abs/1808.05389},\n\tyear = {2018},\n\tbdsk-url-1 = {http://arxiv.org/abs/1808.05389}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2017\n \n \n (10)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Was macht Theoretische Informatik so schwierig? Ergebnisse einer qualitativen Einzelfallstudie.\n \n \n \n \n\n\n \n Kiehn, F.; Frede, C.; and Knobelsdorf, M.\n\n\n \n\n\n\n In Eibl, M.; and Gaedke, M., editor(s), 47. Jahrestagung der Gesellschaft für Informatik, Digitale Kulturen, INFORMATIK 2017, Chemnitz, Germany, September 25-29, 2017, volume P-275, of LNI, pages 267–278, 2017. GI\n \n\n\n\n
\n\n\n\n \n \n $\"Was$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 2 downloads\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/gi/KiehnFK17,\n\tauthor = {Kiehn, Felix and Frede, Christiane and Knobelsdorf, Maria},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/gi/KiehnFK17.bib},\n\tbooktitle = {47. Jahrestagung der Gesellschaft f{\\"{u}}r Informatik, Digitale Kulturen, {INFORMATIK} 2017, Chemnitz, Germany, September 25-29, 2017},\n\tdoi = {10.18420/IN2017\\_20},\n\teditor = {Eibl, Maximilian and Gaedke, Martin},\n\tpages = {267--278},\n\tpublisher = {{GI}},\n\tseries = {{LNI}},\n\ttimestamp = {Sun, 02 Oct 2022 01:00:00 +0200},\n\ttitle = {Was macht Theoretische Informatik so schwierig? Ergebnisse einer qualitativen Einzelfallstudie},\n\turl = {https://doi.org/10.18420/in2017\\_20},\n\tvolume = {{P-275}},\n\tyear = {2017},\n\tbdsk-url-1 = {https://doi.org/10.18420/in2017%5C_20}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Theorem Provers as a Learning Tool in Theory of Computation.\n \n \n \n \n\n\n \n Knobelsdorf, M.; Frede, C.; Böhne, S.; and Kreitz, C.\n\n\n \n\n\n\n In Tenenberg, J.; Chinn, D.; Sheard, J.; and Malmi, L., editor(s), Proceedings of the 2017 ACM Conference on International Computing Education Research, ICER 2017, Tacoma, WA, USA, August 18-20, 2017, pages 83–92, 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Theorem$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icer/KnobelsdorfFBK17,\n\tauthor = {Knobelsdorf, Maria and Frede, Christiane and B{\\"{o}}hne, Sebastian and Kreitz, Christoph},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icer/KnobelsdorfFBK17.bib},\n\tbooktitle = {Proceedings of the 2017 {ACM} Conference on International Computing Education Research, {ICER} 2017, Tacoma, WA, USA, August 18-20, 2017},\n\tdoi = {10.1145/3105726.3106184},\n\teditor = {Tenenberg, Josh and Chinn, Donald and Sheard, Judy and Malmi, Lauri},\n\tpages = {83--92},\n\tpublisher = {{ACM}},\n\ttimestamp = {Tue, 06 Nov 2018 11:06:32 +0100},\n\ttitle = {Theorem Provers as a Learning Tool in Theory of Computation},\n\turl = {https://doi.org/10.1145/3105726.3106184},\n\tyear = {2017},\n\tbdsk-url-1 = {https://doi.org/10.1145/3105726.3106184}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Using Mediational Means during Learning and Understanding of Proof Assignments from Theory of Computation.\n \n \n \n \n\n\n \n Frede, C.\n\n\n \n\n\n\n In Tenenberg, J.; Chinn, D.; Sheard, J.; and Malmi, L., editor(s), Proceedings of the 2017 ACM Conference on International Computing Education Research, ICER 2017, Tacoma, WA, USA, August 18-20, 2017, pages 277–278, 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Using$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icer/Frede17,\n\tauthor = {Frede, Christiane},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icer/Frede17.bib},\n\tbooktitle = {Proceedings of the 2017 {ACM} Conference on International Computing Education Research, {ICER} 2017, Tacoma, WA, USA, August 18-20, 2017},\n\tdoi = {10.1145/3105726.3105734},\n\teditor = {Tenenberg, Josh and Chinn, Donald and Sheard, Judy and Malmi, Lauri},\n\tpages = {277--278},\n\tpublisher = {{ACM}},\n\ttimestamp = {Tue, 06 Nov 2018 00:00:00 +0100},\n\ttitle = {Using Mediational Means during Learning and Understanding of Proof Assignments from Theory of Computation},\n\turl = {https://doi.org/10.1145/3105726.3105734},\n\tyear = {2017},\n\tbdsk-url-1 = {https://doi.org/10.1145/3105726.3105734}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules.\n \n \n \n \n\n\n \n Antoniadis, A.; Barcelo, N.; Consuegra, M. E.; Kling, P.; Nugent, M.; Pruhs, K.; and Scquizzato, M.\n\n\n \n\n\n\n Algorithmica, 79(2): 568–597. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/algorithmica/AntoniadisBCKNP17,\n\tauthor = {Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario E. and Kling, Peter and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/algorithmica/AntoniadisBCKNP17.bib},\n\tdoi = {10.1007/S00453-016-0208-X},\n\tjournal = {Algorithmica},\n\tnumber = {2},\n\tpages = {568--597},\n\ttimestamp = {Wed, 10 May 2023 01:00:00 +0200},\n\ttitle = {Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-Off Schedules},\n\turl = {https://doi.org/10.1007/s00453-016-0208-x},\n\tvolume = {79},\n\tyear = {2017},\n\tbdsk-url-1 = {https://doi.org/10.1007/s00453-016-0208-x}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Continuous speed scaling with variability: A simple and direct approach.\n \n \n \n \n\n\n \n Antoniadis, A.; Kling, P.; Ott, S.; and Riechers, S.\n\n\n \n\n\n\n Theor. Comput. Sci., 678: 1–13. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Continuous$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/tcs/AntoniadisKOR17,\n\tauthor = {Antoniadis, Antonios and Kling, Peter and Ott, Sebastian and Riechers, S{\\"{o}}ren},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/tcs/AntoniadisKOR17.bib},\n\tdoi = {10.1016/J.TCS.2017.03.021},\n\tjournal = {Theor. Comput. Sci.},\n\tpages = {1--13},\n\ttimestamp = {Wed, 10 May 2023 01:00:00 +0200},\n\ttitle = {Continuous speed scaling with variability: {A} simple and direct approach},\n\turl = {https://doi.org/10.1016/j.tcs.2017.03.021},\n\tvolume = {678},\n\tyear = {2017},\n\tbdsk-url-1 = {https://doi.org/10.1016/j.tcs.2017.03.021}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Tight Load Balancing Via Randomized Local Search.\n \n \n \n \n\n\n \n Berenbrink, P.; Kling, P.; Liaw, C.; and Mehrabian, A.\n\n\n \n\n\n\n In 2017 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2017, Orlando, FL, USA, May 29 - June 2, 2017, pages 192–201, 2017. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n $\"Tight$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ipps/BerenbrinkKLM17,\n\tauthor = {Berenbrink, Petra and Kling, Peter and Liaw, Christopher and Mehrabian, Abbas},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/ipps/BerenbrinkKLM17.bib},\n\tbooktitle = {2017 {IEEE} International Parallel and Distributed Processing Symposium, {IPDPS} 2017, Orlando, FL, USA, May 29 - June 2, 2017},\n\tdoi = {10.1109/IPDPS.2017.52},\n\tpages = {192--201},\n\tpublisher = {{IEEE} Computer Society},\n\ttimestamp = {Fri, 24 Mar 2023 00:00:00 +0100},\n\ttitle = {Tight Load Balancing Via Randomized Local Search},\n\turl = {https://doi.org/10.1109/IPDPS.2017.52},\n\tyear = {2017},\n\tbdsk-url-1 = {https://doi.org/10.1109/IPDPS.2017.52}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Ignore or Comply?: On Breaking Symmetry in Consensus.\n \n \n \n \n\n\n \n Berenbrink, P.; Clementi, A. E. F.; Elsässer, R.; Kling, P.; Mallmann-Trenn, F.; and Natale, E.\n\n\n \n\n\n\n In Schiller, E. M.; and Schwarzmann, A. A., editor(s), Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pages 335–344, 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Ignore$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/podc/BerenbrinkCEKMN17,\n\tauthor = {Berenbrink, Petra and Clementi, Andrea E. F. and Els{\\"{a}}sser, Robert and Kling, Peter and Mallmann{-}Trenn, Frederik and Natale, Emanuele},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/podc/BerenbrinkCEKMN17.bib},\n\tbooktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing, {PODC} 2017, Washington, DC, USA, July 25-27, 2017},\n\tdoi = {10.1145/3087801.3087817},\n\teditor = {Schiller, Elad Michael and Schwarzmann, Alexander A.},\n\tpages = {335--344},\n\tpublisher = {{ACM}},\n\ttimestamp = {Tue, 21 Mar 2023 00:00:00 +0100},\n\ttitle = {Ignore or Comply?: On Breaking Symmetry in Consensus},\n\turl = {https://doi.org/10.1145/3087801.3087817},\n\tyear = {2017},\n\tbdsk-url-1 = {https://doi.org/10.1145/3087801.3087817}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource.\n \n \n \n \n\n\n \n Kling, P.; Mäcker, A.; Riechers, S.; and Skopalik, A.\n\n\n \n\n\n\n In Scheideler, C.; and Hajiaghayi, M. T., editor(s), Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, July 24-26, 2017, pages 123–132, 2017. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Sharing$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/spaa/KlingMRS17,\n\tauthor = {Kling, Peter and M{\\"{a}}cker, Alexander and Riechers, S{\\"{o}}ren and Skopalik, Alexander},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/spaa/KlingMRS17.bib},\n\tbooktitle = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},\n\tdoi = {10.1145/3087556.3087578},\n\teditor = {Scheideler, Christian and Hajiaghayi, Mohammad Taghi},\n\tpages = {123--132},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource},\n\turl = {https://doi.org/10.1145/3087556.3087578},\n\tyear = {2017},\n\tbdsk-url-1 = {https://doi.org/10.1145/3087556.3087578}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Ignore or Comply? On Breaking Symmetry in Consensus.\n \n \n \n \n\n\n \n Berenbrink, P.; Clementi, A. E. F.; Elsässer, R.; Kling, P.; Mallmann-Trenn, F.; and Natale, E.\n\n\n \n\n\n\n CoRR, abs/1702.04921. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Ignore$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BerenbrinkCEKMN17,\n\tauthor = {Berenbrink, Petra and Clementi, Andrea E. F. and Els{\\"{a}}sser, Robert and Kling, Peter and Mallmann{-}Trenn, Frederik and Natale, Emanuele},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/BerenbrinkCEKMN17.bib},\n\teprint = {1702.04921},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {Ignore or Comply? On Breaking Symmetry in Consensus},\n\turl = {http://arxiv.org/abs/1702.04921},\n\tvolume = {abs/1702.04921},\n\tyear = {2017},\n\tbdsk-url-1 = {http://arxiv.org/abs/1702.04921}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Tight Load Balancing via Randomized Local Search.\n \n \n \n \n\n\n \n Berenbrink, P.; Kling, P.; Liaw, C.; and Mehrabian, A.\n\n\n \n\n\n\n CoRR, abs/1706.09997. 2017.\n \n\n\n\n
\n\n\n\n \n \n $\"Tight$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BerenbrinkKLM17,\n\tauthor = {Berenbrink, Petra and Kling, Peter and Liaw, Christopher and Mehrabian, Abbas},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/BerenbrinkKLM17.bib},\n\teprint = {1706.09997},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {Tight Load Balancing via Randomized Local Search},\n\turl = {http://arxiv.org/abs/1706.09997},\n\tvolume = {abs/1706.09997},\n\tyear = {2017},\n\tbdsk-url-1 = {http://arxiv.org/abs/1706.09997}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2016\n \n \n (9)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Analyzing Student Practices in Theory of Computation in Light of Distributed Cognition Theory.\n \n \n \n \n\n\n \n Knobelsdorf, M.; and Frede, C.\n\n\n \n\n\n\n In Sheard, J.; Tenenberg, J.; Chinn, D.; and Dorn, B., editor(s), Proceedings of the 2016 ACM Conference on International Computing Education Research, ICER 2016, Melbourne, VIC, Australia, September 8-12, 2016, pages 73–81, 2016. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Analyzing$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icer/KnobelsdorfF16,\n\tauthor = {Knobelsdorf, Maria and Frede, Christiane},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icer/KnobelsdorfF16.bib},\n\tbooktitle = {Proceedings of the 2016 {ACM} Conference on International Computing Education Research, {ICER} 2016, Melbourne, VIC, Australia, September 8-12, 2016},\n\tdoi = {10.1145/2960310.2960331},\n\teditor = {Sheard, Judy and Tenenberg, Josh and Chinn, Donald and Dorn, Brian},\n\tpages = {73--81},\n\tpublisher = {{ACM}},\n\ttimestamp = {Tue, 06 Nov 2018 00:00:00 +0100},\n\ttitle = {Analyzing Student Practices in Theory of Computation in Light of Distributed Cognition Theory},\n\turl = {https://doi.org/10.1145/2960310.2960331},\n\tyear = {2016},\n\tbdsk-url-1 = {https://doi.org/10.1145/2960310.2960331}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Towards the price of leasing online.\n \n \n \n \n\n\n \n Abshoff, S.; Kling, P.; Markarian, C.; auf der Heide, F. M.; and Pietrzyk, P.\n\n\n \n\n\n\n J. Comb. Optim., 32(4): 1197–1216. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Towards$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/jco/AbshoffKMHP16,\n\tauthor = {Abshoff, Sebastian and Kling, Peter and Markarian, Christine and auf der Heide, Friedhelm Meyer and Pietrzyk, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/jco/AbshoffKMHP16.bib},\n\tdoi = {10.1007/S10878-015-9915-5},\n\tjournal = {J. Comb. Optim.},\n\tnumber = {4},\n\tpages = {1197--1216},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Towards the price of leasing online},\n\turl = {https://doi.org/10.1007/s10878-015-9915-5},\n\tvolume = {32},\n\tyear = {2016},\n\tbdsk-url-1 = {https://doi.org/10.1007/s10878-015-9915-5}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Optimal Speed Scaling with a Solar Cell - (Extended Abstract).\n \n \n \n \n\n\n \n Barcelo, N.; Kling, P.; Nugent, M.; and Pruhs, K.\n\n\n \n\n\n\n In Chan, T. H.; Li, M.; and Wang, L., editor(s), Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Hong Kong, China, December 16-18, 2016, Proceedings, volume 10043, of Lecture Notes in Computer Science, pages 521–535, 2016. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"Optimal$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/cocoa/BarceloKNP16,\n\tauthor = {Barcelo, Neal and Kling, Peter and Nugent, Michael and Pruhs, Kirk},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/cocoa/BarceloKNP16.bib},\n\tbooktitle = {Combinatorial Optimization and Applications - 10th International Conference, {COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},\n\tdoi = {10.1007/978-3-319-48749-6\\_38},\n\teditor = {Chan, T.{-}H. Hubert and Li, Minming and Wang, Lusheng},\n\tpages = {521--535},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Optimal Speed Scaling with a Solar Cell - (Extended Abstract)},\n\turl = {https://doi.org/10.1007/978-3-319-48749-6\\_38},\n\tvolume = {10043},\n\tyear = {2016},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-319-48749-6%5C_38}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Kling, P.; Mallmann-Trenn, F.; and Wastell, C.\n\n\n \n\n\n\n In Sankowski, P.; and Zaroliagis, C. D., editor(s), 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, volume 57, of LIPIcs, pages 10:1–10:18, 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"Plurality$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/esa/BerenbrinkFKMW16,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Kling, Peter and Mallmann{-}Trenn, Frederik and Wastell, Chris},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/esa/BerenbrinkFKMW16.bib},\n\tbooktitle = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24, 2016, Aarhus, Denmark},\n\tdoi = {10.4230/LIPICS.ESA.2016.10},\n\teditor = {Sankowski, Piotr and Zaroliagis, Christos D.},\n\tpages = {10:1--10:18},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {LIPIcs},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing},\n\turl = {https://doi.org/10.4230/LIPIcs.ESA.2016.10},\n\tvolume = {57},\n\tyear = {2016},\n\tbdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ESA.2016.10}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time.\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Giakkoupis, G.; and Kling, P.\n\n\n \n\n\n\n In Chatzigiannakis, I.; Mitzenmacher, M.; Rabani, Y.; and Sangiorgi, D., editor(s), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, volume 55, of LIPIcs, pages 136:1–136:14, 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icalp/BerenbrinkFGK16,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Giakkoupis, George and Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icalp/BerenbrinkFGK16.bib},\n\tbooktitle = {43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy},\n\tdoi = {10.4230/LIPICS.ICALP.2016.136},\n\teditor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},\n\tpages = {136:1--136:14},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {LIPIcs},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time},\n\turl = {https://doi.org/10.4230/LIPIcs.ICALP.2016.136},\n\tvolume = {55},\n\tyear = {2016},\n\tbdsk-url-1 = {https://doi.org/10.4230/LIPIcs.ICALP.2016.136}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract].\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Kling, P.; Mallmann-Trenn, F.; Nagel, L.; and Wastell, C.\n\n\n \n\n\n\n In Giakkoupis, G., editor(s), Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016, pages 83–92, 2016. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Self-stabilizing$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/podc/BerenbrinkFKMNW16,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Kling, Peter and Mallmann{-}Trenn, Frederik and Nagel, Lars and Wastell, Christopher},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/podc/BerenbrinkFKMNW16.bib},\n\tbooktitle = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},\n\tdoi = {10.1145/2933057.2933092},\n\teditor = {Giakkoupis, George},\n\tpages = {83--92},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Self-stabilizing Balls {\\&} Bins in Batches: The Power of Leaky Bins [Extended Abstract]},\n\turl = {https://doi.org/10.1145/2933057.2933092},\n\tyear = {2016},\n\tbdsk-url-1 = {https://doi.org/10.1145/2933057.2933092}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Plurality Consensus via Shuffling: Lessons Learned from Load Balancing.\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Kling, P.; Mallmann-Trenn, F.; and Wastell, C.\n\n\n \n\n\n\n CoRR, abs/1602.01342. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Plurality$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BerenbrinkFKMW16,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Kling, Peter and Mallmann{-}Trenn, Frederik and Wastell, Chris},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/BerenbrinkFKMW16.bib},\n\teprint = {1602.01342},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {Plurality Consensus via Shuffling: Lessons Learned from Load Balancing},\n\turl = {http://arxiv.org/abs/1602.01342},\n\tvolume = {abs/1602.01342},\n\tyear = {2016},\n\tbdsk-url-1 = {http://arxiv.org/abs/1602.01342}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Self-stabilizing Balls & Bins in Batches.\n \n \n \n \n\n\n \n Berenbrink, P.; Friedetzky, T.; Kling, P.; Mallmann-Trenn, F.; Nagel, L.; and Wastell, C.\n\n\n \n\n\n\n CoRR, abs/1603.02188. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Self-stabilizing$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BerenbrinkFKMNW16,\n\tauthor = {Berenbrink, Petra and Friedetzky, Tom and Kling, Peter and Mallmann{-}Trenn, Frederik and Nagel, Lars and Wastell, Chris},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/BerenbrinkFKMNW16.bib},\n\teprint = {1603.02188},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {Self-stabilizing Balls {\\&} Bins in Batches},\n\turl = {http://arxiv.org/abs/1603.02188},\n\tvolume = {abs/1603.02188},\n\tyear = {2016},\n\tbdsk-url-1 = {http://arxiv.org/abs/1603.02188}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Optimal Speed Scaling with a Solar Cell.\n \n \n \n \n\n\n \n Barcelo, N.; Kling, P.; Nugent, M.; and Pruhs, K.\n\n\n \n\n\n\n CoRR, abs/1609.02668. 2016.\n \n\n\n\n
\n\n\n\n \n \n $\"Optimal$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/BarceloKNP16,\n\tauthor = {Barcelo, Neal and Kling, Peter and Nugent, Michael and Pruhs, Kirk},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/BarceloKNP16.bib},\n\teprint = {1609.02668},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {Optimal Speed Scaling with a Solar Cell},\n\turl = {http://arxiv.org/abs/1609.02668},\n\tvolume = {abs/1609.02668},\n\tyear = {2016},\n\tbdsk-url-1 = {http://arxiv.org/abs/1609.02668}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2015\n \n \n (3)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Linear and Competitive Strategies for Continuous Robot Formation Problems.\n \n \n \n \n\n\n \n Degener, B.; Kempkes, B.; Kling, P.; and auf der Heide, F. M.\n\n\n \n\n\n\n ACM Trans. Parallel Comput., 2(1): 2:1–2:18. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Linear$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/topc/DegenerKKH15,\n\tauthor = {Degener, Bastian and Kempkes, Barbara and Kling, Peter and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/topc/DegenerKKH15.bib},\n\tdoi = {10.1145/2742341},\n\tjournal = {{ACM} Trans. Parallel Comput.},\n\tnumber = {1},\n\tpages = {2:1--2:18},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Linear and Competitive Strategies for Continuous Robot Formation Problems},\n\turl = {https://doi.org/10.1145/2742341},\n\tvolume = {2},\n\tyear = {2015},\n\tbdsk-url-1 = {https://doi.org/10.1145/2742341}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Profitable Scheduling on Multiple Speed-Scalable Processors.\n \n \n \n \n\n\n \n Kling, P.; and Pietrzyk, P.\n\n\n \n\n\n\n ACM Trans. Parallel Comput., 2(3): 19:1–19:19. 2015.\n \n\n\n\n
\n\n\n\n \n \n $\"Profitable$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/topc/Kling015,\n\tauthor = {Kling, Peter and Pietrzyk, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/topc/Kling015.bib},\n\tdoi = {10.1145/2809872},\n\tjournal = {{ACM} Trans. Parallel Comput.},\n\tnumber = {3},\n\tpages = {19:1--19:19},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Profitable Scheduling on Multiple Speed-Scalable Processors},\n\turl = {https://doi.org/10.1145/2809872},\n\tvolume = {2},\n\tyear = {2015},\n\tbdsk-url-1 = {https://doi.org/10.1145/2809872}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n On the Complexity of Speed Scaling.\n \n \n \n \n\n\n \n Barcelo, N.; Kling, P.; Nugent, M.; Pruhs, K.; and Scquizzato, M.\n\n\n \n\n\n\n In Italiano, G. F.; Pighizzini, G.; and Sannella, D., editor(s), Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, volume 9235, of Lecture Notes in Computer Science, pages 75–89, 2015. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"On$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/mfcs/BarceloKNPS15,\n\tauthor = {Barcelo, Neal and Kling, Peter and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/mfcs/BarceloKNPS15.bib},\n\tbooktitle = {Mathematical Foundations of Computer Science 2015 - 40th International Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part {II}},\n\tdoi = {10.1007/978-3-662-48054-0\\_7},\n\teditor = {Italiano, Giuseppe F. and Pighizzini, Giovanni and Sannella, Donald},\n\tpages = {75--89},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {On the Complexity of Speed Scaling},\n\turl = {https://doi.org/10.1007/978-3-662-48054-0\\_7},\n\tvolume = {9235},\n\tyear = {2015},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-662-48054-0%5C_7}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2014\n \n \n (3)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Energy-efficient scheduling algorithms.\n \n \n \n \n\n\n \n Kling, P.\n\n\n \n\n\n\n Ph.D. Thesis, University of Paderborn, 2014.\n \n\n\n\n
\n\n\n\n \n \n $\"Energy-efficient$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@phdthesis{DBLP:phd/dnb/Kling14,\n\tauthor = {Kling, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/phd/dnb/Kling14.bib},\n\tschool = {University of Paderborn},\n\ttimestamp = {Sat, 17 Jul 2021 01:00:00 +0200},\n\ttitle = {Energy-efficient scheduling algorithms},\n\turl = {https://nbn-resolving.org/urn:nbn:de:hbz:466:2-13801},\n\turn = {urn:nbn:de:hbz:466:2-13801},\n\tyear = {2014},\n\tbdsk-url-1 = {https://nbn-resolving.org/urn:nbn:de:hbz:466:2-13801}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Scheduling shared continuous resources on many-cores.\n \n \n \n \n\n\n \n Brinkmann, A.; Kling, P.; auf der Heide, F. M.; Nagel, L.; Riechers, S.; and Süß, T.\n\n\n \n\n\n\n In Blelloch, G. E.; and Sanders, P., editor(s), 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014, pages 128–137, 2014. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Scheduling$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/spaa/BrinkmannKHNRS14,\n\tauthor = {Brinkmann, Andr{\\'{e}} and Kling, Peter and auf der Heide, Friedhelm Meyer and Nagel, Lars and Riechers, S{\\"{o}}ren and S{\\"{u}}ß, Tim},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/spaa/BrinkmannKHNRS14.bib},\n\tbooktitle = {26th {ACM} Symposium on Parallelism in Algorithms and Architectures, {SPAA} '14, Prague, Czech Republic - June 23 - 25, 2014},\n\tdoi = {10.1145/2612669.2612698},\n\teditor = {Blelloch, Guy E. and Sanders, Peter},\n\tpages = {128--137},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Scheduling shared continuous resources on many-cores},\n\turl = {https://doi.org/10.1145/2612669.2612698},\n\tyear = {2014},\n\tbdsk-url-1 = {https://doi.org/10.1145/2612669.2612698}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules.\n \n \n \n \n\n\n \n Antoniadis, A.; Barcelo, N.; Consuegra, M. E.; Kling, P.; Nugent, M.; Pruhs, K.; and Scquizzato, M.\n\n\n \n\n\n\n In Mayr, E. W.; and Portier, N., editor(s), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France, volume 25, of LIPIcs, pages 63–74, 2014. Schloss Dagstuhl - Leibniz-Zentrum für Informatik\n \n\n\n\n
\n\n\n\n \n \n $\"Efficient$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/stacs/AntoniadisBCKNPS14,\n\tauthor = {Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario E. and Kling, Peter and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/stacs/AntoniadisBCKNPS14.bib},\n\tbooktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},\n\tdoi = {10.4230/LIPICS.STACS.2014.63},\n\teditor = {Mayr, Ernst W. and Portier, Natacha},\n\tpages = {63--74},\n\tpublisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n\tseries = {LIPIcs},\n\ttimestamp = {Wed, 10 May 2023 01:00:00 +0200},\n\ttitle = {Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules},\n\turl = {https://doi.org/10.4230/LIPIcs.STACS.2014.63},\n\tvolume = {25},\n\tyear = {2014},\n\tbdsk-url-1 = {https://doi.org/10.4230/LIPIcs.STACS.2014.63}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2013\n \n \n (2)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n On-The-Fly Computing: A novel paradigm for individualized IT services.\n \n \n \n \n\n\n \n Happe, M.; auf der Heide, F. M.; Kling, P.; Platzner, M.; and Plessl, C.\n\n\n \n\n\n\n In 16th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2013, Paderborn, Germany, June 19-21, 2013, pages 1–10, 2013. IEEE Computer Society\n \n\n\n\n
\n\n\n\n \n \n $\"On-The-Fly$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/isorc/HappeHKPP13,\n\tauthor = {Happe, Markus and auf der Heide, Friedhelm Meyer and Kling, Peter and Platzner, Marco and Plessl, Christian},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/isorc/HappeHKPP13.bib},\n\tbooktitle = {16th {IEEE} International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, {ISORC} 2013, Paderborn, Germany, June 19-21, 2013},\n\tdoi = {10.1109/ISORC.2013.6913232},\n\tpages = {1--10},\n\tpublisher = {{IEEE} Computer Society},\n\ttimestamp = {Fri, 24 Mar 2023 00:00:00 +0100},\n\ttitle = {On-The-Fly Computing: {A} novel paradigm for individualized {IT} services},\n\turl = {https://doi.org/10.1109/ISORC.2013.6913232},\n\tyear = {2013},\n\tbdsk-url-1 = {https://doi.org/10.1109/ISORC.2013.6913232}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Profitable scheduling on multiple speed-scalable processors.\n \n \n \n \n\n\n \n Kling, P.; and Pietrzyk, P.\n\n\n \n\n\n\n In Blelloch, G. E.; and Vöcking, B., editor(s), 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013, pages 251–260, 2013. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Profitable$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/spaa/Kling013,\n\tauthor = {Kling, Peter and Pietrzyk, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/spaa/Kling013.bib},\n\tbooktitle = {25th {ACM} Symposium on Parallelism in Algorithms and Architectures, {SPAA} '13, Montreal, QC, Canada - July 23 - 25, 2013},\n\tdoi = {10.1145/2486159.2486183},\n\teditor = {Blelloch, Guy E. and V{\\"{o}}cking, Berthold},\n\tpages = {251--260},\n\tpublisher = {{ACM}},\n\ttimestamp = {Sat, 01 Dec 2018 00:00:00 +0100},\n\ttitle = {Profitable scheduling on multiple speed-scalable processors},\n\turl = {https://doi.org/10.1145/2486159.2486183},\n\tyear = {2013},\n\tbdsk-url-1 = {https://doi.org/10.1145/2486159.2486183}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2012\n \n \n (7)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n Slow Down and Sleep for Profit in Online Deadline Scheduling.\n \n \n \n \n\n\n \n Kling, P.; Cord-Landwehr, A.; and Mallmann-Trenn, F.\n\n\n \n\n\n\n In Even, G.; and Rawitz, D., editor(s), Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings, volume 7659, of Lecture Notes in Computer Science, pages 234–247, 2012. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"Slow$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/medalg/KlingCM12,\n\tauthor = {Kling, Peter and Cord{-}Landwehr, Andreas and Mallmann{-}Trenn, Frederik},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/medalg/KlingCM12.bib},\n\tbooktitle = {Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings},\n\tdoi = {10.1007/978-3-642-34862-4\\_17},\n\teditor = {Even, Guy and Rawitz, Dror},\n\tpages = {234--247},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Tue, 14 May 2019 10:00:54 +0200},\n\ttitle = {Slow Down and Sleep for Profit in Online Deadline Scheduling},\n\turl = {https://doi.org/10.1007/978-3-642-34862-4\\_17},\n\tvolume = {7659},\n\tyear = {2012},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-642-34862-4%5C_17}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Basic Network Creation Games with Communication Interests.\n \n \n \n \n\n\n \n Cord-Landwehr, A.; Hüllmann, M.; Kling, P.; and Setzer, A.\n\n\n \n\n\n\n In Serna, M. J., editor(s), Algorithmic Game Theory - 5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings, volume 7615, of Lecture Notes in Computer Science, pages 72–83, 2012. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"Basic$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/sagt/Cord-LandwehrHKS12,\n\tauthor = {Cord{-}Landwehr, Andreas and H{\\"{u}}llmann, Martina and Kling, Peter and Setzer, Alexander},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/sagt/Cord-LandwehrHKS12.bib},\n\tbooktitle = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012, Barcelona, Spain, October 22-23, 2012. Proceedings},\n\tdoi = {10.1007/978-3-642-33996-7\\_7},\n\teditor = {Serna, Maria J.},\n\tpages = {72--83},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Basic Network Creation Games with Communication Interests},\n\turl = {https://doi.org/10.1007/978-3-642-33996-7\\_7},\n\tvolume = {7615},\n\tyear = {2012},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-642-33996-7%5C_7}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n An Algorithm for Online Facility Leasing.\n \n \n \n \n\n\n \n Kling, P.; auf der Heide, F. M.; and Pietrzyk, P.\n\n\n \n\n\n\n In Even, G.; and Halldórsson, M. M., editor(s), Structural Information and Communication Complexity - 19th International Colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers, volume 7355, of Lecture Notes in Computer Science, pages 61–72, 2012. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"An$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/sirocco/KlingHP12,\n\tauthor = {Kling, Peter and auf der Heide, Friedhelm Meyer and Pietrzyk, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/sirocco/KlingHP12.bib},\n\tbooktitle = {Structural Information and Communication Complexity - 19th International Colloquium, {SIROCCO} 2012, Reykjavik, Iceland, June 30-July 2, 2012, Revised Selected Papers},\n\tdoi = {10.1007/978-3-642-31104-8\\_6},\n\teditor = {Even, Guy and Halld{\\'{o}}rsson, Magn{\\'{u}}s M.},\n\tpages = {61--72},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {An Algorithm for Online Facility Leasing},\n\turl = {https://doi.org/10.1007/978-3-642-31104-8\\_6},\n\tvolume = {7355},\n\tyear = {2012},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-642-31104-8%5C_6}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Optimal and competitive runtime bounds for continuous, local gathering of mobile robots.\n \n \n \n \n\n\n \n Kempkes, B.; Kling, P.; and auf der Heide, F. M.\n\n\n \n\n\n\n In Blelloch, G. E.; and Herlihy, M., editor(s), 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012, pages 18–26, 2012. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Optimal$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/spaa/KempkesKH12,\n\tauthor = {Kempkes, Barbara and Kling, Peter and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/spaa/KempkesKH12.bib},\n\tbooktitle = {24th {ACM} Symposium on Parallelism in Algorithms and Architectures, {SPAA} '12, Pittsburgh, PA, USA, June 25-27, 2012},\n\tdoi = {10.1145/2312005.2312009},\n\teditor = {Blelloch, Guy E. and Herlihy, Maurice},\n\tpages = {18--26},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Optimal and competitive runtime bounds for continuous, local gathering of mobile robots},\n\turl = {https://doi.org/10.1145/2312005.2312009},\n\tyear = {2012},\n\tbdsk-url-1 = {https://doi.org/10.1145/2312005.2312009}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Basic Network Creation Games with Communication Interests.\n \n \n \n \n\n\n \n Cord-Landwehr, A.; Hüllmann, M.; Kling, P.; and Setzer, A.\n\n\n \n\n\n\n CoRR, abs/1207.5419. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Basic$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1207-5419,\n\tauthor = {Cord{-}Landwehr, Andreas and H{\\"{u}}llmann, Martina and Kling, Peter and Setzer, Alexander},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-1207-5419.bib},\n\teprint = {1207.5419},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {Basic Network Creation Games with Communication Interests},\n\turl = {http://arxiv.org/abs/1207.5419},\n\tvolume = {abs/1207.5419},\n\tyear = {2012},\n\tbdsk-url-1 = {http://arxiv.org/abs/1207.5419}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Slow Down & Sleep for Profit in Online Deadline Scheduling.\n \n \n \n \n\n\n \n Kling, P.; Cord-Landwehr, A.; and Mallmann-Trenn, F.\n\n\n \n\n\n\n CoRR, abs/1209.2848. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Slow$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1209-2848,\n\tauthor = {Kling, Peter and Cord{-}Landwehr, Andreas and Mallmann{-}Trenn, Frederik},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-1209-2848.bib},\n\teprint = {1209.2848},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Tue, 28 Jul 2020 01:00:00 +0200},\n\ttitle = {Slow Down {\\&} Sleep for Profit in Online Deadline Scheduling},\n\turl = {http://arxiv.org/abs/1209.2848},\n\tvolume = {abs/1209.2848},\n\tyear = {2012},\n\tbdsk-url-1 = {http://arxiv.org/abs/1209.2848}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Profitable Scheduling on Multiple Speed-Scalable Processors.\n \n \n \n \n\n\n \n Kling, P.; and Pietrzyk, P.\n\n\n \n\n\n\n CoRR, abs/1209.3868. 2012.\n \n\n\n\n
\n\n\n\n \n \n $\"Profitable$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1209-3868,\n\tauthor = {Kling, Peter and Pietrzyk, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-1209-3868.bib},\n\teprint = {1209.3868},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {Profitable Scheduling on Multiple Speed-Scalable Processors},\n\turl = {http://arxiv.org/abs/1209.3868},\n\tvolume = {abs/1209.3868},\n\tyear = {2012},\n\tbdsk-url-1 = {http://arxiv.org/abs/1209.3868}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2011\n \n \n (5)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n A New Approach for Analyzing Convergence Algorithms for Mobile Robots.\n \n \n \n \n\n\n \n Cord-Landwehr, A.; Degener, B.; Fischer, M.; Hüllmann, M.; Kempkes, B.; Klaas, A.; Kling, P.; Kurras, S.; Märtens, M.; auf der Heide, F. M.; Raupach, C.; Swierkot, K.; Warner, D.; Weddemann, C.; and Wonisch, D.\n\n\n \n\n\n\n In Aceto, L.; Henzinger, M.; and Sgall, J., editor(s), Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, volume 6756, of Lecture Notes in Computer Science, pages 650–661, 2011. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/icalp/Cord-LandwehrDFHKKKKMHRSWWW11,\n\tauthor = {Cord{-}Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and H{\\"{u}}llmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and M{\\"{a}}rtens, Marcus and auf der Heide, Friedhelm Meyer and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/icalp/Cord-LandwehrDFHKKKKMHRSWWW11.bib},\n\tbooktitle = {Automata, Languages and Programming - 38th International Colloquium, {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part {II}},\n\tdoi = {10.1007/978-3-642-22012-8\\_52},\n\teditor = {Aceto, Luca and Henzinger, Monika and Sgall, Jir{\\'{\\i}}},\n\tpages = {650--661},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Tue, 18 Oct 2022 01:00:00 +0200},\n\ttitle = {A New Approach for Analyzing Convergence Algorithms for Mobile Robots},\n\turl = {https://doi.org/10.1007/978-3-642-22012-8\\_52},\n\tvolume = {6756},\n\tyear = {2011},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-642-22012-8%5C_52}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.\n \n \n \n \n\n\n \n Gehweiler, J.; Kling, P.; and auf der Heide, F. M.\n\n\n \n\n\n\n In Wyrzykowski, R.; Dongarra, J. J.; Karczewski, K.; and Wasniewski, J., editor(s), Parallel Processing and Applied Mathematics - 9th International Conference, PPAM 2011, Torun, Poland, September 11-14, 2011. Revised Selected Papers, Part II, volume 7204, of Lecture Notes in Computer Science, pages 31–40, 2011. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"An$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/ppam/GehweilerKH11,\n\tauthor = {Gehweiler, Joachim and Kling, Peter and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/ppam/GehweilerKH11.bib},\n\tbooktitle = {Parallel Processing and Applied Mathematics - 9th International Conference, {PPAM} 2011, Torun, Poland, September 11-14, 2011. Revised Selected Papers, Part {II}},\n\tdoi = {10.1007/978-3-642-31500-8\\_4},\n\teditor = {Wyrzykowski, Roman and Dongarra, Jack J. and Karczewski, Konrad and Wasniewski, Jerzy},\n\tpages = {31--40},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment},\n\turl = {https://doi.org/10.1007/978-3-642-31500-8\\_4},\n\tvolume = {7204},\n\tyear = {2011},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-642-31500-8%5C_4}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Collisionless Gathering of Robots with an Extent.\n \n \n \n \n\n\n \n Cord-Landwehr, A.; Degener, B.; Fischer, M.; Hüllmann, M.; Kempkes, B.; Klaas, A.; Kling, P.; Kurras, S.; Märtens, M.; auf der Heide, F. M.; Raupach, C.; Swierkot, K.; Warner, D.; Weddemann, C.; and Wonisch, D.\n\n\n \n\n\n\n In Cerná, I.; Gyimóthy, T.; Hromkovic, J.; Jeffery, K. G.; Královic, R.; Vukolic, M.; and Wolf, S., editor(s), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 22-28, 2011. Proceedings, volume 6543, of Lecture Notes in Computer Science, pages 178–189, 2011. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"Collisionless$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/sofsem/Cord-LandwehrDFHKKKKMHa11,\n\tauthor = {Cord{-}Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and H{\\"{u}}llmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and M{\\"{a}}rtens, Marcus and auf der Heide, Friedhelm Meyer and Raupach, Christoph and Swierkot, Kamil and Warner, Daniel and Weddemann, Christoph and Wonisch, Daniel},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/sofsem/Cord-LandwehrDFHKKKKMHa11.bib},\n\tbooktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Nov{\\'{y}} Smokovec, Slovakia, January 22-28, 2011. Proceedings},\n\tdoi = {10.1007/978-3-642-18381-2\\_15},\n\teditor = {Cern{\\'{a}}, Ivana and Gyim{\\'{o}}thy, Tibor and Hromkovic, Juraj and Jeffery, Keith G. and Kr{\\'{a}}lovic, Rastislav and Vukolic, Marko and Wolf, Stefan},\n\tpages = {178--189},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Tue, 18 Oct 2022 01:00:00 +0200},\n\ttitle = {Collisionless Gathering of Robots with an Extent},\n\turl = {https://doi.org/10.1007/978-3-642-18381-2\\_15},\n\tvolume = {6543},\n\tyear = {2011},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-642-18381-2%5C_15}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed.\n \n \n \n \n\n\n \n Kling, P.; and auf der Heide, F. M.\n\n\n \n\n\n\n In Rajaraman, R.; and auf der Heide, F. M., editor(s), 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), pages 159–166, 2011. ACM\n \n\n\n\n
\n\n\n\n \n \n $\"Convergence$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/spaa/KlingH11,\n\tauthor = {Kling, Peter and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/spaa/KlingH11.bib},\n\tbooktitle = {{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)},\n\tdoi = {10.1145/1989493.1989517},\n\teditor = {Rajaraman, Rajmohan and auf der Heide, Friedhelm Meyer},\n\tpages = {159--166},\n\tpublisher = {{ACM}},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed},\n\turl = {https://doi.org/10.1145/1989493.1989517},\n\tyear = {2011},\n\tbdsk-url-1 = {https://doi.org/10.1145/1989493.1989517}}\n\n

\n\n\n\n

\n\n\n

\n \n\n \n \n \n \n \n \n A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model.\n \n \n \n \n\n\n \n Briest, P.; Degener, B.; Kempkes, B.; Kling, P.; and Pietrzyk, P.\n\n\n \n\n\n\n CoRR, abs/1105.1248. 2011.\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@article{DBLP:journals/corr/abs-1105-1248,\n\tauthor = {Briest, Patrick and Degener, Bastian and Kempkes, Barbara and Kling, Peter and Pietrzyk, Peter},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/journals/corr/abs-1105-1248.bib},\n\teprint = {1105.1248},\n\teprinttype = {arXiv},\n\tjournal = {CoRR},\n\ttimestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n\ttitle = {A Distributed Approximation Algorithm for the Metric Uncapacitated Facility Location Problem in the Congest Model},\n\turl = {http://arxiv.org/abs/1105.1248},\n\tvolume = {abs/1105.1248},\n\tyear = {2011},\n\tbdsk-url-1 = {http://arxiv.org/abs/1105.1248}}\n\n

\n\n\n\n

\n\n\n\n\n\n

\n\n

\n \n 2010\n \n \n (1)\n \n \n

\n \n \n

\n \n\n \n \n \n \n \n \n A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.\n \n \n \n \n\n\n \n Degener, B.; Kempkes, B.; Kling, P.; and auf der Heide, F. M.\n\n\n \n\n\n\n In Patt-Shamir, B.; and Ekim, T., editor(s), Structural Information and Communication Complexity, 17th International Colloquium, SIROCCO 2010, Sirince, Turkey, June 7-11, 2010. Proceedings, volume 6058, of Lecture Notes in Computer Science, pages 168–182, 2010. Springer\n \n\n\n\n
\n\n\n\n \n \n $\"A$ Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n

@inproceedings{DBLP:conf/sirocco/DegenerKKH10,\n\tauthor = {Degener, Bastian and Kempkes, Barbara and Kling, Peter and auf der Heide, Friedhelm Meyer},\n\tbibsource = {dblp computer science bibliography, https://dblp.org},\n\tbiburl = {https://dblp.org/rec/conf/sirocco/DegenerKKH10.bib},\n\tbooktitle = {Structural Information and Communication Complexity, 17th International Colloquium, {SIROCCO} 2010, Sirince, Turkey, June 7-11, 2010. Proceedings},\n\tdoi = {10.1007/978-3-642-13284-1\\_14},\n\teditor = {Patt{-}Shamir, Boaz and Ekim, T{\\'{\\i}}naz},\n\tpages = {168--182},\n\tpublisher = {Springer},\n\tseries = {Lecture Notes in Computer Science},\n\ttimestamp = {Mon, 03 Jan 2022 00:00:00 +0100},\n\ttitle = {A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots},\n\turl = {https://doi.org/10.1007/978-3-642-13284-1\\_14},\n\tvolume = {6058},\n\tyear = {2010},\n\tbdsk-url-1 = {https://doi.org/10.1007/978-3-642-13284-1%5C_14}}\n

\n\n\n\n

\n\n\n\n\n\n

\n\n\n\n\n

\n\n\n \n\n \n \n \n \n\n