\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n \n \n 1 download\n \n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\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 \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 Paper\n \n \n\n \n \n doi\n \n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\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 \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 Paper\n \n \n\n \n\n \n link\n \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n \n \n \n\n\n\n
\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