var bibbase_data = {"data":"\"Loading..\"\n\n
\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\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 \n <script src=\"https://bibbase.org/show?bib=https://dblp.uni-trier.de/pers/tb1/k/Kling:Peter.bib&jsonp=1&nocache=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https://dblp.uni-trier.de/pers/tb1/k/Kling:Peter.bib&jsonp=1&nocache=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https://dblp.uni-trier.de/pers/tb1/k/Kling:Peter.bib&jsonp=1&nocache=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\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
\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

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

\n\n

\n \n \n Fix it now\n

\n
\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 \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 \"PopulationPaper\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
\n
@article{DBLP:journals/corr/abs-2402-06471,\n  author       = {Gregor Bankhamer and\n                  Petra Berenbrink and\n                  Felix Biermeier and\n                  Robert Els{\\"{a}}sser and\n                  Hamed Hosseinpour and\n                  Dominik Kaaser and\n                  Peter Kling},\n  title        = {Population Protocols for Exact Plurality Consensus - How a small chance\n                  of failure helps to eliminate insignificant opinions},\n  journal      = {CoRR},\n  volume       = {abs/2402.06471},\n  year         = {2024},\n  url          = {https://doi.org/10.48550/arXiv.2402.06471},\n  doi          = {10.48550/ARXIV.2402.06471},\n  eprinttype    = {arXiv},\n  eprint       = {2402.06471},\n  timestamp    = {Fri, 16 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2402-06471.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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 \"ImprovedPaper\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
\n
@inproceedings{DBLP:conf/cocoa/DameriusKS23,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Florian Schneider},\n  editor       = {Weili Wu and\n                  Jianxiong Guo},\n  title        = {Improved Scheduling with a Shared Resource},\n  booktitle    = {Combinatorial Optimization and Applications - 17th International Conference,\n                  {COCOA} 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings,\n                  Part {I}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {14461},\n  pages        = {154--167},\n  publisher    = {Springer},\n  year         = {2023},\n  url          = {https://doi.org/10.1007/978-3-031-49611-0\\_11},\n  doi          = {10.1007/978-3-031-49611-0\\_11},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cocoa/DameriusKS23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"SchedulingPaper\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
\n
@inproceedings{DBLP:conf/esa/DameriusKLX023,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Minming Li and\n                  Chenyang Xu and\n                  Ruilong Zhang},\n  editor       = {Inge Li G{\\o}rtz and\n                  Martin Farach{-}Colton and\n                  Simon J. Puglisi and\n                  Grzegorz Herman},\n  title        = {Scheduling with a Limited Testing Budget: Tight Results for the Offline\n                  and Oblivious Settings},\n  booktitle    = {31st Annual European Symposium on Algorithms, {ESA} 2023, September\n                  4-6, 2023, Amsterdam, The Netherlands},\n  series       = {LIPIcs},\n  volume       = {274},\n  pages        = {38:1--38:15},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2023},\n  url          = {https://doi.org/10.4230/LIPIcs.ESA.2023.38},\n  doi          = {10.4230/LIPICS.ESA.2023.38},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/esa/DameriusKLX023.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"MovingPaper\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
\n
@inproceedings{DBLP:conf/icccn/ErgencSKF23,\n  author       = {Doganalp Ergenc and\n                  Florian Schneider and\n                  Peter Kling and\n                  Mathias Fischer},\n  title        = {Moving Target Defense for Service-Oriented Mission-Critical Networks},\n  booktitle    = {32nd International Conference on Computer Communications and Networks,\n                  {ICCCN} 2023, Honolulu, HI, USA, July 24-27, 2023},\n  pages        = {1--10},\n  publisher    = {{IEEE}},\n  year         = {2023},\n  url          = {https://doi.org/10.1109/ICCCN58024.2023.10230175},\n  doi          = {10.1109/ICCCN58024.2023.10230175},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/icccn/ErgencSKF23.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"MovingPaper\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
\n
@article{DBLP:journals/corr/abs-2303-09893,\n  author       = {Doganalp Ergen{\\c{c}} and\n                  Florian Schneider and\n                  Peter Kling and\n                  Mathias Fischer},\n  title        = {Moving Target Defense for Service-oriented Mission-critical Networks},\n  journal      = {CoRR},\n  volume       = {abs/2303.09893},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2303.09893},\n  doi          = {10.48550/ARXIV.2303.09893},\n  eprinttype    = {arXiv},\n  eprint       = {2303.09893},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2303-09893.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"SchedulingPaper\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
\n
@article{DBLP:journals/corr/abs-2306-15597,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Minming Li and\n                  Chenyang Xu and\n                  Ruilong Zhang},\n  title        = {Scheduling with a Limited Testing Budget},\n  journal      = {CoRR},\n  volume       = {abs/2306.15597},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2306.15597},\n  doi          = {10.48550/ARXIV.2306.15597},\n  eprinttype    = {arXiv},\n  eprint       = {2306.15597},\n  timestamp    = {Sun, 17 Dec 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2306-15597.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"ImprovedPaper\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
\n
@article{DBLP:journals/corr/abs-2310-05732,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Florian Schneider},\n  title        = {Improved Scheduling with a Shared Resource},\n  journal      = {CoRR},\n  volume       = {abs/2310.05732},\n  year         = {2023},\n  url          = {https://doi.org/10.48550/arXiv.2310.05732},\n  doi          = {10.48550/ARXIV.2310.05732},\n  eprinttype    = {arXiv},\n  eprint       = {2310.05732},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-05732.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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 \"APaper\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
\n
@article{DBLP:journals/iandc/CastenowKKH22,\n  author       = {Jannik Castenow and\n                  Peter Kling and\n                  Till Knollmann and\n                  Friedhelm Meyer auf der Heide},\n  title        = {A discrete and continuous study of the Max-Chain-Formation problem},\n  journal      = {Inf. Comput.},\n  volume       = {285},\n  number       = {Part},\n  pages        = {104877},\n  year         = {2022},\n  url          = {https://doi.org/10.1016/j.ic.2022.104877},\n  doi          = {10.1016/J.IC.2022.104877},\n  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/iandc/CastenowKKH22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"DatasetPaper\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
\n
@inproceedings{DBLP:conf/lrec/Petersen-FreySK22,\n  author       = {Fynn Petersen{-}Frey and\n                  Marcus Soll and\n                  Louis Kobras and\n                  Melf Johannsen and\n                  Peter Kling and\n                  Chris Biemann},\n  editor       = {Nicoletta Calzolari and\n                  Fr{\\'{e}}d{\\'{e}}ric B{\\'{e}}chet and\n                  Philippe Blache and\n                  Khalid Choukri and\n                  Christopher Cieri and\n                  Thierry Declerck and\n                  Sara Goggi and\n                  Hitoshi Isahara and\n                  Bente Maegaard and\n                  Joseph Mariani and\n                  H{\\'{e}}l{\\`{e}}ne Mazo and\n                  Jan Odijk and\n                  Stelios Piperidis},\n  title        = {Dataset of Student Solutions to Algorithm and Data Structure Programming\n                  Assignments},\n  booktitle    = {Proceedings of the Thirteenth Language Resources and Evaluation Conference,\n                  {LREC} 2022, Marseille, France, 20-25 June 2022},\n  pages        = {956--962},\n  publisher    = {European Language Resources Association},\n  year         = {2022},\n  url          = {https://aclanthology.org/2022.lrec-1.101},\n  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/lrec/Petersen-FreySK22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"APaper\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
\n
@inproceedings{DBLP:conf/opodis/CastenowH0KKH22,\n  author       = {Jannik Castenow and\n                  Jonas Harbig and\n                  Daniel Jung and\n                  Peter Kling and\n                  Till Knollmann and\n                  Friedhelm Meyer auf der Heide},\n  editor       = {Eshcar Hillel and\n                  Roberto Palmieri and\n                  Etienne Rivi{\\`{e}}re},\n  title        = {A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots\n                  with Limited Visibility},\n  booktitle    = {26th International Conference on Principles of Distributed Systems,\n                  {OPODIS} 2022, December 13-15, 2022, Brussels, Belgium},\n  series       = {LIPIcs},\n  volume       = {253},\n  pages        = {15:1--15:25},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2022},\n  url          = {https://doi.org/10.4230/LIPIcs.OPODIS.2022.15},\n  doi          = {10.4230/LIPICS.OPODIS.2022.15},\n  timestamp    = {Tue, 07 May 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/opodis/CastenowH0KKH22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"PopulationPaper\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
\n
@inproceedings{DBLP:conf/podc/BankhamerBBEHKK22,\n  author       = {Gregor Bankhamer and\n                  Petra Berenbrink and\n                  Felix Biermeier and\n                  Robert Els{\\"{a}}sser and\n                  Hamed Hosseinpour and\n                  Dominik Kaaser and\n                  Peter Kling},\n  editor       = {Alessia Milani and\n                  Philipp Woelfel},\n  title        = {Population Protocols for Exact Plurality Consensus: How a small chance\n                  of failure helps to eliminate insignificant opinions},\n  booktitle    = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing,\n                  Salerno, Italy, July 25 - 29, 2022},\n  pages        = {224--234},\n  publisher    = {{ACM}},\n  year         = {2022},\n  url          = {https://doi.org/10.1145/3519270.3538447},\n  doi          = {10.1145/3519270.3538447},\n  timestamp    = {Mon, 25 Jul 2022 15:01:51 +0200},\n  biburl       = {https://dblp.org/rec/conf/podc/BankhamerBBEHKK22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"FastPaper\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
\n
@inproceedings{DBLP:conf/soda/BankhamerBBEHKK22,\n  author       = {Gregor Bankhamer and\n                  Petra Berenbrink and\n                  Felix Biermeier and\n                  Robert Els{\\"{a}}sser and\n                  Hamed Hosseinpour and\n                  Dominik Kaaser and\n                  Peter Kling},\n  editor       = {Joseph (Seffi) Naor and\n                  Niv Buchbinder},\n  title        = {Fast Consensus via the Unconstrained Undecided State Dynamics},\n  booktitle    = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,\n                  {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -\n                  12, 2022},\n  pages        = {3417--3429},\n  publisher    = {{SIAM}},\n  year         = {2022},\n  url          = {https://doi.org/10.1137/1.9781611977073.135},\n  doi          = {10.1137/1.9781611977073.135},\n  timestamp    = {Tue, 12 Apr 2022 11:24:56 +0200},\n  biburl       = {https://dblp.org/rec/conf/soda/BankhamerBBEHKK22.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"APaper\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
\n
@article{DBLP:journals/corr/abs-2206-07567,\n  author       = {Jannik Castenow and\n                  Jonas Harbig and\n                  Daniel Jung and\n                  Peter Kling and\n                  Till Knollmann and\n                  Friedhelm Meyer auf der Heide},\n  title        = {A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots\n                  with Limited Visibility},\n  journal      = {CoRR},\n  volume       = {abs/2206.07567},\n  year         = {2022},\n  url          = {https://doi.org/10.48550/arXiv.2206.07567},\n  doi          = {10.48550/ARXIV.2206.07567},\n  eprinttype    = {arXiv},\n  eprint       = {2206.07567},\n  timestamp    = {Tue, 21 Jun 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2206-07567.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (6)\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-spacePaper\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
\n
@article{DBLP:journals/dc/BerenbrinkEFKKR21,\n  author       = {Petra Berenbrink and\n                  Robert Els{\\"{a}}sser and\n                  Tom Friedetzky and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Tomasz Radzik},\n  title        = {Time-space trade-offs in population protocols for the majority problem},\n  journal      = {Distributed Comput.},\n  volume       = {34},\n  number       = {2},\n  pages        = {91--111},\n  year         = {2021},\n  url          = {https://doi.org/10.1007/s00446-020-00385-0},\n  doi          = {10.1007/S00446-020-00385-0},\n  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/dc/BerenbrinkEFKKR21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 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 \"OnPaper\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
\n
@inproceedings{DBLP:conf/icalp/DameriusKKS21,\n  author       = {Christoph Damerius and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Florian Schneider},\n  editor       = {Nikhil Bansal and\n                  Emanuela Merelli and\n                  James Worrell},\n  title        = {On Greedily Packing Anchored Rectangles},\n  booktitle    = {48th International Colloquium on Automata, Languages, and Programming,\n                  {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)},\n  series       = {LIPIcs},\n  volume       = {198},\n  pages        = {61:1--61:20},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2021},\n  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2021.61},\n  doi          = {10.4230/LIPICS.ICALP.2021.61},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/icalp/DameriusKKS21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"InfinitePaper\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
\n
@inproceedings{DBLP:conf/icdcs/BerenbrinkFHHKK21,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  Christopher Hahn and\n                  Lukas Hintze and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Lars Nagel},\n  title        = {Infinite Balanced Allocation via Finite Capacities},\n  booktitle    = {41st {IEEE} International Conference on Distributed Computing Systems,\n                  {ICDCS} 2021, Washington DC, USA, July 7-10, 2021},\n  pages        = {965--975},\n  publisher    = {{IEEE}},\n  year         = {2021},\n  url          = {https://doi.org/10.1109/ICDCS51616.2021.00096},\n  doi          = {10.1109/ICDCS51616.2021.00096},\n  timestamp    = {Sat, 09 Apr 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icdcs/BerenbrinkFHHKK21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OnPaper\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
\n
@inproceedings{DBLP:conf/wads/AntoniadisCCDKN21,\n  author       = {Antonios Antoniadis and\n                  Margarita Capretto and\n                  Parinya Chalermsook and\n                  Christoph Damerius and\n                  Peter Kling and\n                  Lukas N{\\"{o}}lke and\n                  Nidia Obscura Acosta and\n                  Joachim Spoerhase},\n  editor       = {Anna Lubiw and\n                  Mohammad R. Salavatipour},\n  title        = {On Minimum Generalized Manhattan Connections},\n  booktitle    = {Algorithms and Data Structures - 17th International Symposium, {WADS}\n                  2021, Virtual Event, August 9-11, 2021, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12808},\n  pages        = {85--100},\n  publisher    = {Springer},\n  year         = {2021},\n  url          = {https://doi.org/10.1007/978-3-030-83508-8\\_7},\n  doi          = {10.1007/978-3-030-83508-8\\_7},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/wads/AntoniadisCCDKN21.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OnPaper\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
\n
@article{DBLP:journals/corr/abs-2102-08181,\n  author       = {Christoph Damerius and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Florian Schneider},\n  title        = {On Greedily Packing Anchored Rectangles},\n  journal      = {CoRR},\n  volume       = {abs/2102.08181},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2102.08181},\n  eprinttype    = {arXiv},\n  eprint       = {2102.08181},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2102-08181.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"FastPaper\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
\n
@article{DBLP:journals/corr/abs-2103-10366,\n  author       = {Gregor Bankhamer and\n                  Petra Berenbrink and\n                  Felix Biermeier and\n                  Robert Els{\\"{a}}sser and\n                  Hamed Hosseinpour and\n                  Dominik Kaaser and\n                  Peter Kling},\n  title        = {Fast Consensus via the Unconstrained Undecided State Dynamics},\n  journal      = {CoRR},\n  volume       = {abs/2103.10366},\n  year         = {2021},\n  url          = {https://arxiv.org/abs/2103.10366},\n  eprinttype    = {arXiv},\n  eprint       = {2103.10366},\n  timestamp    = {Wed, 24 Mar 2021 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2103-10366.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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 \"ImprovedPaper\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
\n
@inproceedings{DBLP:conf/cocoa/DameriusKLSZ20,\n  author       = {Christoph Damerius and\n                  Peter Kling and\n                  Minming Li and\n                  Florian Schneider and\n                  Ruilong Zhang},\n  editor       = {Weili Wu and\n                  Zhongnan Zhang},\n  title        = {Improved Scheduling with a Shared Resource via Structural Insights},\n  booktitle    = {Combinatorial Optimization and Applications - 14th International Conference,\n                  {COCOA} 2020, Dallas, TX, USA, December 11-13, 2020, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12577},\n  pages        = {168--182},\n  publisher    = {Springer},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/978-3-030-64843-5\\_12},\n  doi          = {10.1007/978-3-030-64843-5\\_12},\n  timestamp    = {Thu, 08 Feb 2024 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cocoa/DameriusKLSZ20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"BriefPaper\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
\n
@inproceedings{DBLP:conf/podc/BerenbrinkGK20,\n  author       = {Petra Berenbrink and\n                  George Giakkoupis and\n                  Peter Kling},\n  editor       = {Yuval Emek and\n                  Christian Cachin},\n  title        = {Brief Announcement: Optimal Time and Space Leader Election in Population\n                  Protocols},\n  booktitle    = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing,\n                  Virtual Event, Italy, August 3-7, 2020},\n  pages        = {218--220},\n  publisher    = {{ACM}},\n  year         = {2020},\n  url          = {https://doi.org/10.1145/3382734.3405726},\n  doi          = {10.1145/3382734.3405726},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/podc/BerenbrinkGK20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"APaper\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
\n
@inproceedings{DBLP:conf/spaa/CastenowKKH20,\n  author       = {Jannik Castenow and\n                  Peter Kling and\n                  Till Knollmann and\n                  Friedhelm Meyer auf der Heide},\n  editor       = {Christian Scheideler and\n                  Michael Spear},\n  title        = {A Discrete and Continuous Study of the Max-Chain-Formation Problem:\n                  Slow Down to Speed up},\n  booktitle    = {{SPAA} '20: 32nd {ACM} Symposium on Parallelism in Algorithms and\n                  Architectures, Virtual Event, USA, July 15-17, 2020},\n  pages        = {515--517},\n  publisher    = {{ACM}},\n  year         = {2020},\n  url          = {https://doi.org/10.1145/3350755.3400263},\n  doi          = {10.1145/3350755.3400263},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/spaa/CastenowKKH20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"APaper\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
\n
@inproceedings{DBLP:conf/sss/CastenowKKH20,\n  author       = {Jannik Castenow and\n                  Peter Kling and\n                  Till Knollmann and\n                  Friedhelm Meyer auf der Heide},\n  editor       = {St{\\'{e}}phane Devismes and\n                  Neeraj Mittal},\n  title        = {A Discrete and Continuous Study of the Max-Chain-Formation Problem\n                  - Slow down to Speed Up},\n  booktitle    = {Stabilization, Safety, and Security of Distributed Systems - 22nd\n                  International Symposium, {SSS} 2020, Austin, TX, USA, November 18-21,\n                  2020, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {12514},\n  pages        = {65--80},\n  publisher    = {Springer},\n  year         = {2020},\n  url          = {https://doi.org/10.1007/978-3-030-64348-5\\_6},\n  doi          = {10.1007/978-3-030-64348-5\\_6},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/sss/CastenowKKH20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OptimalPaper\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
\n
@inproceedings{DBLP:conf/stoc/BerenbrinkGK20,\n  author       = {Petra Berenbrink and\n                  George Giakkoupis and\n                  Peter Kling},\n  editor       = {Konstantin Makarychev and\n                  Yury Makarychev and\n                  Madhur Tulsiani and\n                  Gautam Kamath and\n                  Julia Chuzhoy},\n  title        = {Optimal time and space leader election in population protocols},\n  booktitle    = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory\n                  of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},\n  pages        = {119--129},\n  publisher    = {{ACM}},\n  year         = {2020},\n  url          = {https://doi.org/10.1145/3357713.3384312},\n  doi          = {10.1145/3357713.3384312},\n  timestamp    = {Mon, 18 Dec 2023 07:33:37 +0100},\n  biburl       = {https://dblp.org/rec/conf/stoc/BerenbrinkGK20.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"APaper\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
\n
@article{DBLP:journals/corr/abs-2010-02043,\n  author       = {Jannik Castenow and\n                  Peter Kling and\n                  Till Knollmann and\n                  Friedhelm Meyer auf der Heide},\n  title        = {A Discrete and Continuous Study of the Max-Chain-Formation Problem},\n  journal      = {CoRR},\n  volume       = {abs/2010.02043},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.02043},\n  eprinttype    = {arXiv},\n  eprint       = {2010.02043},\n  timestamp    = {Mon, 12 Oct 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-02043.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OnPaper\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
\n
@article{DBLP:journals/corr/abs-2010-14338,\n  author       = {Antonios Antoniadis and\n                  Margarita Capretto and\n                  Parinya Chalermsook and\n                  Christoph Damerius and\n                  Peter Kling and\n                  Lukas N{\\"{o}}lke and\n                  Nidia Obscura Acosta and\n                  Joachim Spoerhase},\n  title        = {On Minimum Generalized Manhattan Connections},\n  journal      = {CoRR},\n  volume       = {abs/2010.14338},\n  year         = {2020},\n  url          = {https://arxiv.org/abs/2010.14338},\n  eprinttype    = {arXiv},\n  eprint       = {2010.14338},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-2010-14338.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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 \"TowardsPaper\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
\n
@inproceedings{DBLP:conf/IEEEares/WilkensHKK019,\n  author       = {Florian Wilkens and\n                  Steffen Haas and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Mathias Fischer},\n  title        = {Towards Efficient Reconstruction of Attacker Lateral Movement},\n  booktitle    = {Proceedings of the 14th International Conference on Availability,\n                  Reliability and Security, {ARES} 2019, Canterbury, UK, August 26-29,\n                  2019},\n  pages        = {14:1--14:9},\n  publisher    = {{ACM}},\n  year         = {2019},\n  url          = {https://doi.org/10.1145/3339252.3339254},\n  doi          = {10.1145/3339252.3339254},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/IEEEares/WilkensHKK019.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OnPaper\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
\n
@inproceedings{DBLP:conf/esa/AntoniadisBCDHK19,\n  author       = {Antonios Antoniadis and\n                  Felix Biermeier and\n                  Andr{\\'{e}}s Cristi and\n                  Christoph Damerius and\n                  Ruben Hoeksma and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Lukas N{\\"{o}}lke},\n  editor       = {Michael A. Bender and\n                  Ola Svensson and\n                  Grzegorz Herman},\n  title        = {On the Complexity of Anchored Rectangle Packing},\n  booktitle    = {27th Annual European Symposium on Algorithms, {ESA} 2019, September\n                  9-11, 2019, Munich/Garching, Germany},\n  series       = {LIPIcs},\n  volume       = {144},\n  pages        = {8:1--8:14},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2019},\n  url          = {https://doi.org/10.4230/LIPIcs.ESA.2019.8},\n  doi          = {10.4230/LIPICS.ESA.2019.8},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/esa/AntoniadisBCDHK19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"TightPaper\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
\n
@inproceedings{DBLP:conf/ipps/BerenbrinkFKK19,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  Dominik Kaaser and\n                  Peter Kling},\n  title        = {Tight {\\&} Simple Load Balancing},\n  booktitle    = {2019 {IEEE} International Parallel and Distributed Processing Symposium,\n                  {IPDPS} 2019, Rio de Janeiro, Brazil, May 20-24, 2019},\n  pages        = {718--726},\n  publisher    = {{IEEE}},\n  year         = {2019},\n  url          = {https://doi.org/10.1109/IPDPS.2019.00080},\n  doi          = {10.1109/IPDPS.2019.00080},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/ipps/BerenbrinkFKK19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"ContinuousPaper\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
\n
@incollection{DBLP:series/lncs/KlingH19,\n  author       = {Peter Kling and\n                  Friedhelm Meyer auf der Heide},\n  editor       = {Paola Flocchini and\n                  Giuseppe Prencipe and\n                  Nicola Santoro},\n  title        = {Continuous Protocols for Swarm Robotics},\n  booktitle    = {Distributed Computing by Mobile Entities, Current Research in Moving\n                  and Computing},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {11340},\n  pages        = {317--334},\n  publisher    = {Springer},\n  year         = {2019},\n  url          = {https://doi.org/10.1007/978-3-030-11072-7\\_13},\n  doi          = {10.1007/978-3-030-11072-7\\_13},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/series/lncs/KlingH19.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2018\n \n \n (8)\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-StabilizingPaper\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
\n
@article{DBLP:journals/algorithmica/BerenbrinkFKMNW18,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  Peter Kling and\n                  Frederik Mallmann{-}Trenn and\n                  Lars Nagel and\n                  Chris Wastell},\n  title        = {Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins},\n  journal      = {Algorithmica},\n  volume       = {80},\n  number       = {12},\n  pages        = {3673--3703},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/s00453-018-0411-z},\n  doi          = {10.1007/S00453-018-0411-Z},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/algorithmica/BerenbrinkFKMNW18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"SchedulingPaper\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
\n
@article{DBLP:journals/scheduling/AlthausBKHNRSS18,\n  author       = {Ernst Althaus and\n                  Andr{\\'{e}} Brinkmann and\n                  Peter Kling and\n                  Friedhelm Meyer auf der Heide and\n                  Lars Nagel and\n                  S{\\"{o}}ren Riechers and\n                  Jir{\\'{\\i}} Sgall and\n                  Tim S{\\"{u}}{\\ss}},\n  title        = {Scheduling shared continuous resources on many-cores},\n  journal      = {J. Sched.},\n  volume       = {21},\n  number       = {1},\n  pages        = {77--92},\n  year         = {2018},\n  url          = {https://doi.org/10.1007/s10951-017-0518-0},\n  doi          = {10.1007/S10951-017-0518-0},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/scheduling/AlthausBKHNRSS18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"SimplePaper\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
\n
@inproceedings{DBLP:conf/soda/BerenbrinkKKO18,\n  author       = {Petra Berenbrink and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Lena Otterbach},\n  editor       = {Raimund Seidel},\n  title        = {Simple and Efficient Leader Election},\n  booktitle    = {1st Symposium on Simplicity in Algorithms, {SOSA} 2018, January 7-10,\n                  2018, New Orleans, LA, {USA}},\n  series       = {OASIcs},\n  volume       = {61},\n  pages        = {9:1--9:11},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2018},\n  url          = {https://doi.org/10.4230/OASIcs.SOSA.2018.9},\n  doi          = {10.4230/OASICS.SOSA.2018.9},\n  timestamp    = {Tue, 15 Feb 2022 09:40:03 +0100},\n  biburl       = {https://dblp.org/rec/conf/soda/BerenbrinkKKO18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"TightPaper\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
\n
@inproceedings{DBLP:conf/soda/BerenbrinkGK18,\n  author       = {Petra Berenbrink and\n                  George Giakkoupis and\n                  Peter Kling},\n  editor       = {Artur Czumaj},\n  title        = {Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs},\n  booktitle    = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete\n                  Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},\n  pages        = {1715--1733},\n  publisher    = {{SIAM}},\n  year         = {2018},\n  url          = {https://doi.org/10.1137/1.9781611975031.112},\n  doi          = {10.1137/1.9781611975031.112},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/soda/BerenbrinkGK18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"APaper\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
\n
@inproceedings{DBLP:conf/wdag/BerenbrinkEFKKR18,\n  author       = {Petra Berenbrink and\n                  Robert Els{\\"{a}}sser and\n                  Tom Friedetzky and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Tomasz Radzik},\n  editor       = {Ulrich Schmid and\n                  Josef Widder},\n  title        = {A Population Protocol for Exact Majority with O(log5/3 n) Stabilization\n                  Time and Theta(log n) States},\n  booktitle    = {32nd International Symposium on Distributed Computing, {DISC} 2018,\n                  New Orleans, LA, USA, October 15-19, 2018},\n  series       = {LIPIcs},\n  volume       = {121},\n  pages        = {10:1--10:18},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2018},\n  url          = {https://doi.org/10.4230/LIPIcs.DISC.2018.10},\n  doi          = {10.4230/LIPICS.DISC.2018.10},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/wdag/BerenbrinkEFKKR18.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"MajorityPaper\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
\n
@article{DBLP:journals/corr/abs-1805-04586,\n  author       = {Petra Berenbrink and\n                  Robert Els{\\"{a}}sser and\n                  Tom Friedetzky and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Tomasz Radzik},\n  title        = {Majority {\\&} Stabilization in Population Protocols},\n  journal      = {CoRR},\n  volume       = {abs/1805.04586},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1805.04586},\n  eprinttype    = {arXiv},\n  eprint       = {1805.04586},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-04586.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"APaper\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
\n
@article{DBLP:journals/corr/abs-1805-05157,\n  author       = {Petra Berenbrink and\n                  Robert Els{\\"{a}}sser and\n                  Tom Friedetzky and\n                  Dominik Kaaser and\n                  Peter Kling and\n                  Tomasz Radzik},\n  title        = {A population protocol for exact majority with O({\\textbackslash}log\\({}^{\\mbox{5/3}}\\)n)\n                  stabilization time and asymptotically optimal number of states},\n  journal      = {CoRR},\n  volume       = {abs/1805.05157},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1805.05157},\n  eprinttype    = {arXiv},\n  eprint       = {1805.05157},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1805-05157.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"SimplePaper\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
\n
@article{DBLP:journals/corr/abs-1808-05389,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  Dominik Kaaser and\n                  Peter Kling},\n  title        = {Simple Load Balancing},\n  journal      = {CoRR},\n  volume       = {abs/1808.05389},\n  year         = {2018},\n  url          = {http://arxiv.org/abs/1808.05389},\n  eprinttype    = {arXiv},\n  eprint       = {1808.05389},\n  timestamp    = {Sun, 02 Sep 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1808-05389.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2017\n \n \n (7)\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 \"EfficientPaper\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
\n
@article{DBLP:journals/algorithmica/AntoniadisBCKNP17,\n  author       = {Antonios Antoniadis and\n                  Neal Barcelo and\n                  Mario E. Consuegra and\n                  Peter Kling and\n                  Michael Nugent and\n                  Kirk Pruhs and\n                  Michele Scquizzato},\n  title        = {Efficient Computation of Optimal Energy and Fractional Weighted Flow\n                  Trade-Off Schedules},\n  journal      = {Algorithmica},\n  volume       = {79},\n  number       = {2},\n  pages        = {568--597},\n  year         = {2017},\n  url          = {https://doi.org/10.1007/s00453-016-0208-x},\n  doi          = {10.1007/S00453-016-0208-X},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/algorithmica/AntoniadisBCKNP17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"ContinuousPaper\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
\n
@article{DBLP:journals/tcs/AntoniadisKOR17,\n  author       = {Antonios Antoniadis and\n                  Peter Kling and\n                  Sebastian Ott and\n                  S{\\"{o}}ren Riechers},\n  title        = {Continuous speed scaling with variability: {A} simple and direct approach},\n  journal      = {Theor. Comput. Sci.},\n  volume       = {678},\n  pages        = {1--13},\n  year         = {2017},\n  url          = {https://doi.org/10.1016/j.tcs.2017.03.021},\n  doi          = {10.1016/J.TCS.2017.03.021},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/tcs/AntoniadisKOR17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"TightPaper\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
\n
@inproceedings{DBLP:conf/ipps/BerenbrinkKLM17,\n  author       = {Petra Berenbrink and\n                  Peter Kling and\n                  Christopher Liaw and\n                  Abbas Mehrabian},\n  title        = {Tight Load Balancing Via Randomized Local Search},\n  booktitle    = {2017 {IEEE} International Parallel and Distributed Processing Symposium,\n                  {IPDPS} 2017, Orlando, FL, USA, May 29 - June 2, 2017},\n  pages        = {192--201},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2017},\n  url          = {https://doi.org/10.1109/IPDPS.2017.52},\n  doi          = {10.1109/IPDPS.2017.52},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/ipps/BerenbrinkKLM17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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.; 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 \"IgnorePaper\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
\n
@inproceedings{DBLP:conf/podc/BerenbrinkCEKMN17,\n  author       = {Petra Berenbrink and\n                  Andrea Clementi and\n                  Robert Els{\\"{a}}sser and\n                  Peter Kling and\n                  Frederik Mallmann{-}Trenn and\n                  Emanuele Natale},\n  editor       = {Elad Michael Schiller and\n                  Alexander A. Schwarzmann},\n  title        = {Ignore or Comply?: On Breaking Symmetry in Consensus},\n  booktitle    = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing,\n                  {PODC} 2017, Washington, DC, USA, July 25-27, 2017},\n  pages        = {335--344},\n  publisher    = {{ACM}},\n  year         = {2017},\n  url          = {https://doi.org/10.1145/3087801.3087817},\n  doi          = {10.1145/3087801.3087817},\n  timestamp    = {Thu, 04 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/podc/BerenbrinkCEKMN17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"SharingPaper\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
\n
@inproceedings{DBLP:conf/spaa/KlingMRS17,\n  author       = {Peter Kling and\n                  Alexander M{\\"{a}}cker and\n                  S{\\"{o}}ren Riechers and\n                  Alexander Skopalik},\n  editor       = {Christian Scheideler and\n                  Mohammad Taghi Hajiaghayi},\n  title        = {Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource},\n  booktitle    = {Proceedings of the 29th {ACM} Symposium on Parallelism in Algorithms\n                  and Architectures, {SPAA} 2017, Washington DC, USA, July 24-26, 2017},\n  pages        = {123--132},\n  publisher    = {{ACM}},\n  year         = {2017},\n  url          = {https://doi.org/10.1145/3087556.3087578},\n  doi          = {10.1145/3087556.3087578},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/spaa/KlingMRS17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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.; 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 \"IgnorePaper\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
\n
@article{DBLP:journals/corr/BerenbrinkCEKMN17,\n  author       = {Petra Berenbrink and\n                  Andrea Clementi and\n                  Robert Els{\\"{a}}sser and\n                  Peter Kling and\n                  Frederik Mallmann{-}Trenn and\n                  Emanuele Natale},\n  title        = {Ignore or Comply? On Breaking Symmetry in Consensus},\n  journal      = {CoRR},\n  volume       = {abs/1702.04921},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1702.04921},\n  eprinttype    = {arXiv},\n  eprint       = {1702.04921},\n  timestamp    = {Thu, 04 Apr 2024 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BerenbrinkCEKMN17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"TightPaper\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
\n
@article{DBLP:journals/corr/BerenbrinkKLM17,\n  author       = {Petra Berenbrink and\n                  Peter Kling and\n                  Christopher Liaw and\n                  Abbas Mehrabian},\n  title        = {Tight Load Balancing via Randomized Local Search},\n  journal      = {CoRR},\n  volume       = {abs/1706.09997},\n  year         = {2017},\n  url          = {http://arxiv.org/abs/1706.09997},\n  eprinttype    = {arXiv},\n  eprint       = {1706.09997},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BerenbrinkKLM17.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (8)\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 \"TowardsPaper\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
\n
@article{DBLP:journals/jco/AbshoffKMHP16,\n  author       = {Sebastian Abshoff and\n                  Peter Kling and\n                  Christine Markarian and\n                  Friedhelm Meyer auf der Heide and\n                  Peter Pietrzyk},\n  title        = {Towards the price of leasing online},\n  journal      = {J. Comb. Optim.},\n  volume       = {32},\n  number       = {4},\n  pages        = {1197--1216},\n  year         = {2016},\n  url          = {https://doi.org/10.1007/s10878-015-9915-5},\n  doi          = {10.1007/S10878-015-9915-5},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/jco/AbshoffKMHP16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OptimalPaper\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
\n
@inproceedings{DBLP:conf/cocoa/BarceloKNP16,\n  author       = {Neal Barcelo and\n                  Peter Kling and\n                  Michael Nugent and\n                  Kirk Pruhs},\n  editor       = {T.{-}H. Hubert Chan and\n                  Minming Li and\n                  Lusheng Wang},\n  title        = {Optimal Speed Scaling with a Solar Cell - (Extended Abstract)},\n  booktitle    = {Combinatorial Optimization and Applications - 10th International Conference,\n                  {COCOA} 2016, Hong Kong, China, December 16-18, 2016, Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {10043},\n  pages        = {521--535},\n  publisher    = {Springer},\n  year         = {2016},\n  url          = {https://doi.org/10.1007/978-3-319-48749-6\\_38},\n  doi          = {10.1007/978-3-319-48749-6\\_38},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/cocoa/BarceloKNP16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"PluralityPaper\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
\n
@inproceedings{DBLP:conf/esa/BerenbrinkFKMW16,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  Peter Kling and\n                  Frederik Mallmann{-}Trenn and\n                  Chris Wastell},\n  editor       = {Piotr Sankowski and\n                  Christos D. Zaroliagis},\n  title        = {Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load\n                  Balancing},\n  booktitle    = {24th Annual European Symposium on Algorithms, {ESA} 2016, August 22-24,\n                  2016, Aarhus, Denmark},\n  series       = {LIPIcs},\n  volume       = {57},\n  pages        = {10:1--10:18},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2016},\n  url          = {https://doi.org/10.4230/LIPIcs.ESA.2016.10},\n  doi          = {10.4230/LIPICS.ESA.2016.10},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/esa/BerenbrinkFKMW16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"EfficientPaper\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
\n
@inproceedings{DBLP:conf/icalp/BerenbrinkFGK16,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  George Giakkoupis and\n                  Peter Kling},\n  editor       = {Ioannis Chatzigiannakis and\n                  Michael Mitzenmacher and\n                  Yuval Rabani and\n                  Davide Sangiorgi},\n  title        = {Efficient Plurality Consensus, Or: the Benefits of Cleaning up from\n                  Time to Time},\n  booktitle    = {43rd International Colloquium on Automata, Languages, and Programming,\n                  {ICALP} 2016, July 11-15, 2016, Rome, Italy},\n  series       = {LIPIcs},\n  volume       = {55},\n  pages        = {136:1--136:14},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2016},\n  url          = {https://doi.org/10.4230/LIPIcs.ICALP.2016.136},\n  doi          = {10.4230/LIPICS.ICALP.2016.136},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/icalp/BerenbrinkFGK16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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-stabilizingPaper\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
\n
@inproceedings{DBLP:conf/podc/BerenbrinkFKMNW16,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  Peter Kling and\n                  Frederik Mallmann{-}Trenn and\n                  Lars Nagel and\n                  Christopher Wastell},\n  editor       = {George Giakkoupis},\n  title        = {Self-stabilizing Balls {\\&} Bins in Batches: The Power of Leaky Bins\n                  [Extended Abstract]},\n  booktitle    = {Proceedings of the 2016 {ACM} Symposium on Principles of Distributed\n                  Computing, {PODC} 2016, Chicago, IL, USA, July 25-28, 2016},\n  pages        = {83--92},\n  publisher    = {{ACM}},\n  year         = {2016},\n  url          = {https://doi.org/10.1145/2933057.2933092},\n  doi          = {10.1145/2933057.2933092},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/podc/BerenbrinkFKMNW16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"PluralityPaper\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
\n
@article{DBLP:journals/corr/BerenbrinkFKMW16,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  Peter Kling and\n                  Frederik Mallmann{-}Trenn and\n                  Chris Wastell},\n  title        = {Plurality Consensus via Shuffling: Lessons Learned from Load Balancing},\n  journal      = {CoRR},\n  volume       = {abs/1602.01342},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1602.01342},\n  eprinttype    = {arXiv},\n  eprint       = {1602.01342},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BerenbrinkFKMW16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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-stabilizingPaper\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
\n
@article{DBLP:journals/corr/BerenbrinkFKMNW16,\n  author       = {Petra Berenbrink and\n                  Tom Friedetzky and\n                  Peter Kling and\n                  Frederik Mallmann{-}Trenn and\n                  Lars Nagel and\n                  Chris Wastell},\n  title        = {Self-stabilizing Balls {\\&} Bins in Batches},\n  journal      = {CoRR},\n  volume       = {abs/1603.02188},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1603.02188},\n  eprinttype    = {arXiv},\n  eprint       = {1603.02188},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BerenbrinkFKMNW16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OptimalPaper\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
\n
@article{DBLP:journals/corr/BarceloKNP16,\n  author       = {Neal Barcelo and\n                  Peter Kling and\n                  Michael Nugent and\n                  Kirk Pruhs},\n  title        = {Optimal Speed Scaling with a Solar Cell},\n  journal      = {CoRR},\n  volume       = {abs/1609.02668},\n  year         = {2016},\n  url          = {http://arxiv.org/abs/1609.02668},\n  eprinttype    = {arXiv},\n  eprint       = {1609.02668},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/BarceloKNP16.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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 \"LinearPaper\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
\n
@article{DBLP:journals/topc/DegenerKKH15,\n  author       = {Bastian Degener and\n                  Barbara Kempkes and\n                  Peter Kling and\n                  Friedhelm Meyer auf der Heide},\n  title        = {Linear and Competitive Strategies for Continuous Robot Formation Problems},\n  journal      = {{ACM} Trans. Parallel Comput.},\n  volume       = {2},\n  number       = {1},\n  pages        = {2:1--2:18},\n  year         = {2015},\n  url          = {https://doi.org/10.1145/2742341},\n  doi          = {10.1145/2742341},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/topc/DegenerKKH15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"ProfitablePaper\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
\n
@article{DBLP:journals/topc/Kling015,\n  author       = {Peter Kling and\n                  Peter Pietrzyk},\n  title        = {Profitable Scheduling on Multiple Speed-Scalable Processors},\n  journal      = {{ACM} Trans. Parallel Comput.},\n  volume       = {2},\n  number       = {3},\n  pages        = {19:1--19:19},\n  year         = {2015},\n  url          = {https://doi.org/10.1145/2809872},\n  doi          = {10.1145/2809872},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/journals/topc/Kling015.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OnPaper\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
\n
@inproceedings{DBLP:conf/mfcs/BarceloKNPS15,\n  author       = {Neal Barcelo and\n                  Peter Kling and\n                  Michael Nugent and\n                  Kirk Pruhs and\n                  Michele Scquizzato},\n  editor       = {Giuseppe F. Italiano and\n                  Giovanni Pighizzini and\n                  Donald Sannella},\n  title        = {On the Complexity of Speed Scaling},\n  booktitle    = {Mathematical Foundations of Computer Science 2015 - 40th International\n                  Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,\n                  Part {II}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {9235},\n  pages        = {75--89},\n  publisher    = {Springer},\n  year         = {2015},\n  url          = {https://doi.org/10.1007/978-3-662-48054-0\\_7},\n  doi          = {10.1007/978-3-662-48054-0\\_7},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/mfcs/BarceloKNPS15.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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-efficientPaper\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
\n
@phdthesis{DBLP:phd/dnb/Kling14,\n  author       = {Peter Kling},\n  title        = {Energy-efficient scheduling algorithms},\n  school       = {University of Paderborn},\n  year         = {2014},\n  url          = {https://nbn-resolving.org/urn:nbn:de:hbz:466:2-13801},\n  urn          = {urn:nbn:de:hbz:466:2-13801},\n  timestamp    = {Sat, 17 Jul 2021 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/phd/dnb/Kling14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"SchedulingPaper\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
\n
@inproceedings{DBLP:conf/spaa/BrinkmannKHNRS14,\n  author       = {Andr{\\'{e}} Brinkmann and\n                  Peter Kling and\n                  Friedhelm Meyer auf der Heide and\n                  Lars Nagel and\n                  S{\\"{o}}ren Riechers and\n                  Tim S{\\"{u}}{\\ss}},\n  editor       = {Guy E. Blelloch and\n                  Peter Sanders},\n  title        = {Scheduling shared continuous resources on many-cores},\n  booktitle    = {26th {ACM} Symposium on Parallelism in Algorithms and Architectures,\n                  {SPAA} '14, Prague, Czech Republic - June 23 - 25, 2014},\n  pages        = {128--137},\n  publisher    = {{ACM}},\n  year         = {2014},\n  url          = {https://doi.org/10.1145/2612669.2612698},\n  doi          = {10.1145/2612669.2612698},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/spaa/BrinkmannKHNRS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"EfficientPaper\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
\n
@inproceedings{DBLP:conf/stacs/AntoniadisBCKNPS14,\n  author       = {Antonios Antoniadis and\n                  Neal Barcelo and\n                  Mario E. Consuegra and\n                  Peter Kling and\n                  Michael Nugent and\n                  Kirk Pruhs and\n                  Michele Scquizzato},\n  editor       = {Ernst W. Mayr and\n                  Natacha Portier},\n  title        = {Efficient Computation of Optimal Energy and Fractional Weighted Flow\n                  Trade-off Schedules},\n  booktitle    = {31st International Symposium on Theoretical Aspects of Computer Science\n                  {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},\n  series       = {LIPIcs},\n  volume       = {25},\n  pages        = {63--74},\n  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\\"{u}}r Informatik},\n  year         = {2014},\n  url          = {https://doi.org/10.4230/LIPIcs.STACS.2014.63},\n  doi          = {10.4230/LIPICS.STACS.2014.63},\n  timestamp    = {Wed, 10 May 2023 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/stacs/AntoniadisBCKNPS14.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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-FlyPaper\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
\n
@inproceedings{DBLP:conf/isorc/HappeHKPP13,\n  author       = {Markus Happe and\n                  Friedhelm Meyer auf der Heide and\n                  Peter Kling and\n                  Marco Platzner and\n                  Christian Plessl},\n  title        = {On-The-Fly Computing: {A} novel paradigm for individualized {IT} services},\n  booktitle    = {16th {IEEE} International Symposium on Object/Component/Service-Oriented\n                  Real-Time Distributed Computing, {ISORC} 2013, Paderborn, Germany,\n                  June 19-21, 2013},\n  pages        = {1--10},\n  publisher    = {{IEEE} Computer Society},\n  year         = {2013},\n  url          = {https://doi.org/10.1109/ISORC.2013.6913232},\n  doi          = {10.1109/ISORC.2013.6913232},\n  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/isorc/HappeHKPP13.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"ProfitablePaper\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
\n
@inproceedings{DBLP:conf/spaa/Kling013,\n  author       = {Peter Kling and\n                  Peter Pietrzyk},\n  editor       = {Guy E. Blelloch and\n                  Berthold V{\\"{o}}cking},\n  title        = {Profitable scheduling on multiple speed-scalable processors},\n  booktitle    = {25th {ACM} Symposium on Parallelism in Algorithms and Architectures,\n                  {SPAA} '13, Montreal, QC, Canada - July 23 - 25, 2013},\n  pages        = {251--260},\n  publisher    = {{ACM}},\n  year         = {2013},\n  url          = {https://doi.org/10.1145/2486159.2486183},\n  doi          = {10.1145/2486159.2486183},\n  timestamp    = {Sat, 01 Dec 2018 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/spaa/Kling013.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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 \"SlowPaper\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
\n
@inproceedings{DBLP:conf/medalg/KlingCM12,\n  author       = {Peter Kling and\n                  Andreas Cord{-}Landwehr and\n                  Frederik Mallmann{-}Trenn},\n  editor       = {Guy Even and\n                  Dror Rawitz},\n  title        = {Slow Down and Sleep for Profit in Online Deadline Scheduling},\n  booktitle    = {Design and Analysis of Algorithms - First Mediterranean Conference\n                  on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5,\n                  2012. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7659},\n  pages        = {234--247},\n  publisher    = {Springer},\n  year         = {2012},\n  url          = {https://doi.org/10.1007/978-3-642-34862-4\\_17},\n  doi          = {10.1007/978-3-642-34862-4\\_17},\n  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},\n  biburl       = {https://dblp.org/rec/conf/medalg/KlingCM12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"BasicPaper\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
\n
@inproceedings{DBLP:conf/sagt/Cord-LandwehrHKS12,\n  author       = {Andreas Cord{-}Landwehr and\n                  Martina H{\\"{u}}llmann and\n                  Peter Kling and\n                  Alexander Setzer},\n  editor       = {Maria J. Serna},\n  title        = {Basic Network Creation Games with Communication Interests},\n  booktitle    = {Algorithmic Game Theory - 5th International Symposium, {SAGT} 2012,\n                  Barcelona, Spain, October 22-23, 2012. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7615},\n  pages        = {72--83},\n  publisher    = {Springer},\n  year         = {2012},\n  url          = {https://doi.org/10.1007/978-3-642-33996-7\\_7},\n  doi          = {10.1007/978-3-642-33996-7\\_7},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/sagt/Cord-LandwehrHKS12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"AnPaper\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
\n
@inproceedings{DBLP:conf/sirocco/KlingHP12,\n  author       = {Peter Kling and\n                  Friedhelm Meyer auf der Heide and\n                  Peter Pietrzyk},\n  editor       = {Guy Even and\n                  Magn{\\'{u}}s M. Halld{\\'{o}}rsson},\n  title        = {An Algorithm for Online Facility Leasing},\n  booktitle    = {Structural Information and Communication Complexity - 19th International\n                  Colloquium, {SIROCCO} 2012, Reykjavik, Iceland, June 30-July 2, 2012,\n                  Revised Selected Papers},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7355},\n  pages        = {61--72},\n  publisher    = {Springer},\n  year         = {2012},\n  url          = {https://doi.org/10.1007/978-3-642-31104-8\\_6},\n  doi          = {10.1007/978-3-642-31104-8\\_6},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/sirocco/KlingHP12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"OptimalPaper\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
\n
@inproceedings{DBLP:conf/spaa/KempkesKH12,\n  author       = {Barbara Kempkes and\n                  Peter Kling and\n                  Friedhelm Meyer auf der Heide},\n  editor       = {Guy E. Blelloch and\n                  Maurice Herlihy},\n  title        = {Optimal and competitive runtime bounds for continuous, local gathering\n                  of mobile robots},\n  booktitle    = {24th {ACM} Symposium on Parallelism in Algorithms and Architectures,\n                  {SPAA} '12, Pittsburgh, PA, USA, June 25-27, 2012},\n  pages        = {18--26},\n  publisher    = {{ACM}},\n  year         = {2012},\n  url          = {https://doi.org/10.1145/2312005.2312009},\n  doi          = {10.1145/2312005.2312009},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/spaa/KempkesKH12.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"BasicPaper\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
\n
@article{DBLP:journals/corr/abs-1207-5419,\n  author       = {Andreas Cord{-}Landwehr and\n                  Martina H{\\"{u}}llmann and\n                  Peter Kling and\n                  Alexander Setzer},\n  title        = {Basic Network Creation Games with Communication Interests},\n  journal      = {CoRR},\n  volume       = {abs/1207.5419},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1207.5419},\n  eprinttype    = {arXiv},\n  eprint       = {1207.5419},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1207-5419.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"SlowPaper\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
\n
@article{DBLP:journals/corr/abs-1209-2848,\n  author       = {Peter Kling and\n                  Andreas Cord{-}Landwehr and\n                  Frederik Mallmann{-}Trenn},\n  title        = {Slow Down {\\&} Sleep for Profit in Online Deadline Scheduling},\n  journal      = {CoRR},\n  volume       = {abs/1209.2848},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1209.2848},\n  eprinttype    = {arXiv},\n  eprint       = {1209.2848},\n  timestamp    = {Tue, 28 Jul 2020 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1209-2848.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"ProfitablePaper\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
\n
@article{DBLP:journals/corr/abs-1209-3868,\n  author       = {Peter Kling and\n                  Peter Pietrzyk},\n  title        = {Profitable Scheduling on Multiple Speed-Scalable Processors},\n  journal      = {CoRR},\n  volume       = {abs/1209.3868},\n  year         = {2012},\n  url          = {http://arxiv.org/abs/1209.3868},\n  eprinttype    = {arXiv},\n  eprint       = {1209.3868},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1209-3868.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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 \"APaper\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
\n
@inproceedings{DBLP:conf/icalp/Cord-LandwehrDFHKKKKMHRSWWW11,\n  author       = {Andreas Cord{-}Landwehr and\n                  Bastian Degener and\n                  Matthias Fischer and\n                  Martina H{\\"{u}}llmann and\n                  Barbara Kempkes and\n                  Alexander Klaas and\n                  Peter Kling and\n                  Sven Kurras and\n                  Marcus M{\\"{a}}rtens and\n                  Friedhelm Meyer auf der Heide and\n                  Christoph Raupach and\n                  Kamil Swierkot and\n                  Daniel Warner and\n                  Christoph Weddemann and\n                  Daniel Wonisch},\n  editor       = {Luca Aceto and\n                  Monika Henzinger and\n                  Jir{\\'{\\i}} Sgall},\n  title        = {A New Approach for Analyzing Convergence Algorithms for Mobile Robots},\n  booktitle    = {Automata, Languages and Programming - 38th International Colloquium,\n                  {ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part\n                  {II}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {6756},\n  pages        = {650--661},\n  publisher    = {Springer},\n  year         = {2011},\n  url          = {https://doi.org/10.1007/978-3-642-22012-8\\_52},\n  doi          = {10.1007/978-3-642-22012-8\\_52},\n  timestamp    = {Tue, 18 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/icalp/Cord-LandwehrDFHKKKKMHRSWWW11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"AnPaper\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
\n
@inproceedings{DBLP:conf/ppam/GehweilerKH11,\n  author       = {Joachim Gehweiler and\n                  Peter Kling and\n                  Friedhelm Meyer auf der Heide},\n  editor       = {Roman Wyrzykowski and\n                  Jack J. Dongarra and\n                  Konrad Karczewski and\n                  Jerzy Wasniewski},\n  title        = {An Experimental Comparison of Load Balancing Strategies in a Web Computing\n                  Environment},\n  booktitle    = {Parallel Processing and Applied Mathematics - 9th International Conference,\n                  {PPAM} 2011, Torun, Poland, September 11-14, 2011. Revised Selected\n                  Papers, Part {II}},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {7204},\n  pages        = {31--40},\n  publisher    = {Springer},\n  year         = {2011},\n  url          = {https://doi.org/10.1007/978-3-642-31500-8\\_4},\n  doi          = {10.1007/978-3-642-31500-8\\_4},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/ppam/GehweilerKH11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"CollisionlessPaper\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
\n
@inproceedings{DBLP:conf/sofsem/Cord-LandwehrDFHKKKKMHa11,\n  author       = {Andreas Cord{-}Landwehr and\n                  Bastian Degener and\n                  Matthias Fischer and\n                  Martina H{\\"{u}}llmann and\n                  Barbara Kempkes and\n                  Alexander Klaas and\n                  Peter Kling and\n                  Sven Kurras and\n                  Marcus M{\\"{a}}rtens and\n                  Friedhelm Meyer auf der Heide and\n                  Christoph Raupach and\n                  Kamil Swierkot and\n                  Daniel Warner and\n                  Christoph Weddemann and\n                  Daniel Wonisch},\n  editor       = {Ivana Cern{\\'{a}} and\n                  Tibor Gyim{\\'{o}}thy and\n                  Juraj Hromkovic and\n                  Keith G. Jeffery and\n                  Rastislav Kr{\\'{a}}lovic and\n                  Marko Vukolic and\n                  Stefan Wolf},\n  title        = {Collisionless Gathering of Robots with an Extent},\n  booktitle    = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference\n                  on Current Trends in Theory and Practice of Computer Science, Nov{\\'{y}}\n                  Smokovec, Slovakia, January 22-28, 2011. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {6543},\n  pages        = {178--189},\n  publisher    = {Springer},\n  year         = {2011},\n  url          = {https://doi.org/10.1007/978-3-642-18381-2\\_15},\n  doi          = {10.1007/978-3-642-18381-2\\_15},\n  timestamp    = {Tue, 18 Oct 2022 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/conf/sofsem/Cord-LandwehrDFHKKKKMHa11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"ConvergencePaper\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
\n
@inproceedings{DBLP:conf/spaa/KlingH11,\n  author       = {Peter Kling and\n                  Friedhelm Meyer auf der Heide},\n  editor       = {Rajmohan Rajaraman and\n                  Friedhelm Meyer auf der Heide},\n  title        = {Convergence of local communication chain strategies via linear transformations:\n                  or how to trade locality for speed},\n  booktitle    = {{SPAA} 2011: Proceedings of the 23rd Annual {ACM} Symposium on Parallelism\n                  in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011\n                  (Co-located with {FCRC} 2011)},\n  pages        = {159--166},\n  publisher    = {{ACM}},\n  year         = {2011},\n  url          = {https://doi.org/10.1145/1989493.1989517},\n  doi          = {10.1145/1989493.1989517},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/spaa/KlingH11.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\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 \"APaper\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
\n
@article{DBLP:journals/corr/abs-1105-1248,\n  author       = {Patrick Briest and\n                  Bastian Degener and\n                  Barbara Kempkes and\n                  Peter Kling and\n                  Peter Pietrzyk},\n  title        = {A Distributed Approximation Algorithm for the Metric Uncapacitated\n                  Facility Location Problem in the Congest Model},\n  journal      = {CoRR},\n  volume       = {abs/1105.1248},\n  year         = {2011},\n  url          = {http://arxiv.org/abs/1105.1248},\n  eprinttype    = {arXiv},\n  eprint       = {1105.1248},\n  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},\n  biburl       = {https://dblp.org/rec/journals/corr/abs-1105-1248.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\n}\n\n
\n
\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 \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 \"APaper\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
\n
@inproceedings{DBLP:conf/sirocco/DegenerKKH10,\n  author       = {Bastian Degener and\n                  Barbara Kempkes and\n                  Peter Kling and\n                  Friedhelm Meyer auf der Heide},\n  editor       = {Boaz Patt{-}Shamir and\n                  T{\\'{\\i}}naz Ekim},\n  title        = {A Continuous, Local Strategy for Constructing a Short Chain of Mobile\n                  Robots},\n  booktitle    = {Structural Information and Communication Complexity, 17th International\n                  Colloquium, {SIROCCO} 2010, Sirince, Turkey, June 7-11, 2010. Proceedings},\n  series       = {Lecture Notes in Computer Science},\n  volume       = {6058},\n  pages        = {168--182},\n  publisher    = {Springer},\n  year         = {2010},\n  url          = {https://doi.org/10.1007/978-3-642-13284-1\\_14},\n  doi          = {10.1007/978-3-642-13284-1\\_14},\n  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},\n  biburl       = {https://dblp.org/rec/conf/sirocco/DegenerKKH10.bib},\n  bibsource    = {dblp computer science bibliography, https://dblp.org}\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 \n \n \n\n
\n"}; document.write(bibbase_data.data);