Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Sebastian Brandt 0002
@article{DBLP:journals/dc/BalliuBCOSST23, author = {Alkida Balliu and Sebastian Brandt and Yi{-}Jun Chang and Dennis Olivetti and Jan Studen{\'{y}} and Jukka Suomela and Aleksandr Tereshchenko}, title = {Locally checkable problems in rooted trees}, journal = {Distributed Comput.}, volume = {36}, number = {3}, pages = {277--311}, year = {2023}, url = {https://doi.org/10.1007/s00446-022-00435-9}, doi = {10.1007/S00446-022-00435-9}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dc/BalliuBCOSST23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Balliu0KO23, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti}, editor = {Nikhil Bansal and Viswanath Nagarajan}, title = {Distributed Maximal Matching and Maximal Independent Set on Hypergraphs}, booktitle = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2023, Florence, Italy, January 22-25, 2023}, pages = {2632--2676}, publisher = {{SIAM}}, year = {2023}, url = {https://doi.org/10.1137/1.9781611977554.ch100}, doi = {10.1137/1.9781611977554.CH100}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/Balliu0KO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/Balliu0KOS23, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti and Gustav Schmid}, editor = {Rotem Oshman}, title = {On the Node-Averaged Complexity of Locally Checkable Problems on Trees}, booktitle = {37th International Symposium on Distributed Computing, {DISC} 2023, October 10-12, 2023, L'Aquila, Italy}, series = {LIPIcs}, volume = {281}, pages = {7:1--7:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.DISC.2023.7}, doi = {10.4230/LIPICS.DISC.2023.7}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wdag/Balliu0KOS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-04251, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti and Gustav Schmid}, title = {On the Node-Averaged Complexity of Locally Checkable Problems on Trees}, journal = {CoRR}, volume = {abs/2308.04251}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.04251}, doi = {10.48550/ARXIV.2308.04251}, eprinttype = {arXiv}, eprint = {2308.04251}, timestamp = {Tue, 22 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-04251.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/BalliuBO22, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti}, title = {Distributed Lower Bounds for Ruling Sets}, journal = {{SIAM} J. Comput.}, volume = {51}, number = {1}, pages = {70--115}, year = {2022}, url = {https://doi.org/10.1137/20m1381770}, doi = {10.1137/20M1381770}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/BalliuBO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/0002CGGRV22, author = {Sebastian Brandt and Yi{-}Jun Chang and Jan Greb{\'{\i}}k and Christoph Grunau and V{\'{a}}clav Rozhon and Zolt{\'{a}}n Vidny{\'{a}}nszky}, editor = {Mark Braverman}, title = {Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics}, booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS} 2022, January 31 - February 3, 2022, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {215}, pages = {29:1--29:26}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.29}, doi = {10.4230/LIPICS.ITCS.2022.29}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/0002CGGRV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Balliu0KO22a, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti}, editor = {Alessia Milani and Philipp Woelfel}, title = {Distributed Edge Coloring in Time Polylogarithmic in {\(\Delta\)}}, booktitle = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}, pages = {15--25}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519270.3538440}, doi = {10.1145/3519270.3538440}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/Balliu0KO22a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/GrunauR022, author = {Christoph Grunau and V{\'{a}}clav Rozhon and Sebastian Brandt}, editor = {Alessia Milani and Philipp Woelfel}, title = {The Landscape of Distributed Complexities on Trees and Beyond}, booktitle = {{PODC} '22: {ACM} Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022}, pages = {37--47}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519270.3538452}, doi = {10.1145/3519270.3538452}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/podc/GrunauR022.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Balliu0KO22, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Distributed {\unicode{8710}}-coloring plays hide-and-seek}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {464--477}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3520027}, doi = {10.1145/3519935.3520027}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Balliu0KO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/Balliu0COSS22, author = {Alkida Balliu and Sebastian Brandt and Yi{-}Jun Chang and Dennis Olivetti and Jan Studen{\'{y}} and Jukka Suomela}, editor = {Christian Scheideler}, title = {Efficient Classification of Locally Checkable Problems in Regular Trees}, booktitle = {36th International Symposium on Distributed Computing, {DISC} 2022, October 25-27, 2022, Augusta, Georgia, {USA}}, series = {LIPIcs}, volume = {246}, pages = {8:1--8:19}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.DISC.2022.8}, doi = {10.4230/LIPICS.DISC.2022.8}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wdag/Balliu0COSS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/Balliu0FLMOU22, author = {Alkida Balliu and Sebastian Brandt and Manuela Fischer and Rustam Latypov and Yannic Maus and Dennis Olivetti and Jara Uitto}, editor = {Christian Scheideler}, title = {Exponential Speedup over Locality in {MPC} with Optimal Memory}, booktitle = {36th International Symposium on Distributed Computing, {DISC} 2022, October 25-27, 2022, Augusta, Georgia, {USA}}, series = {LIPIcs}, volume = {246}, pages = {9:1--9:21}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.DISC.2022.9}, doi = {10.4230/LIPICS.DISC.2022.9}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wdag/Balliu0FLMOU22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-04724, author = {Christoph Grunau and V{\'{a}}clav Rozhon and Sebastian Brandt}, title = {The Landscape of Distributed Complexities on Trees and Beyond}, journal = {CoRR}, volume = {abs/2202.04724}, year = {2022}, url = {https://arxiv.org/abs/2202.04724}, eprinttype = {arXiv}, eprint = {2202.04724}, timestamp = {Fri, 18 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-04724.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-08544, author = {Alkida Balliu and Sebastian Brandt and Yi{-}Jun Chang and Dennis Olivetti and Jan Studen{\'{y}} and Jukka Suomela}, title = {Efficient Classification of Local Problems in Regular Trees}, journal = {CoRR}, volume = {abs/2202.08544}, year = {2022}, url = {https://arxiv.org/abs/2202.08544}, eprinttype = {arXiv}, eprint = {2202.08544}, timestamp = {Tue, 01 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-08544.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2204-09329, author = {Sebastian Brandt and Yi{-}Jun Chang and Jan Greb{\'{\i}}k and Christoph Grunau and V{\'{a}}clav Rozhon and Zolt{\'{a}}n Vidny{\'{a}}nszky}, title = {Deterministic Distributed algorithms and Descriptive Combinatorics on {\(\Delta\)}-regular trees}, journal = {CoRR}, volume = {abs/2204.09329}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2204.09329}, doi = {10.48550/ARXIV.2204.09329}, eprinttype = {arXiv}, eprint = {2204.09329}, timestamp = {Mon, 25 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2204-09329.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2206-00976, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti}, title = {Distributed Edge Coloring in Time Polylogarithmic in {\(\Delta\)}}, journal = {CoRR}, volume = {abs/2206.00976}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2206.00976}, doi = {10.48550/ARXIV.2206.00976}, eprinttype = {arXiv}, eprint = {2206.00976}, timestamp = {Mon, 13 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2206-00976.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-09453, author = {Alkida Balliu and Sebastian Brandt and Manuela Fischer and Rustam Latypov and Yannic Maus and Dennis Olivetti and Jara Uitto}, title = {Exponential Speedup Over Locality in {MPC} with Optimal Memory}, journal = {CoRR}, volume = {abs/2208.09453}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.09453}, doi = {10.48550/ARXIV.2208.09453}, eprinttype = {arXiv}, eprint = {2208.09453}, timestamp = {Mon, 22 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-09453.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-01945, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti}, title = {Distributed Maximal Matching and Maximal Independent Set on Hypergraphs}, journal = {CoRR}, volume = {abs/2211.01945}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.01945}, doi = {10.48550/ARXIV.2211.01945}, eprinttype = {arXiv}, eprint = {2211.01945}, timestamp = {Fri, 04 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-01945.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dc/BalliuBOS21, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti and Jukka Suomela}, title = {Almost global problems in the {LOCAL} model}, journal = {Distributed Comput.}, volume = {34}, number = {4}, pages = {259--281}, year = {2021}, url = {https://doi.org/10.1007/s00446-020-00375-2}, doi = {10.1007/S00446-020-00375-2}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dc/BalliuBOS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/BalliuBHORS21, author = {Alkida Balliu and Sebastian Brandt and Juho Hirvonen and Dennis Olivetti and Mika{\"{e}}l Rabie and Jukka Suomela}, title = {Lower Bounds for Maximal Matchings and Maximal Independent Sets}, journal = {J. {ACM}}, volume = {68}, number = {5}, pages = {39:1--39:30}, year = {2021}, url = {https://doi.org/10.1145/3461458}, doi = {10.1145/3461458}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/BalliuBHORS21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/0002FU21, author = {Sebastian Brandt and Manuela Fischer and Jara Uitto}, title = {Breaking the linear-memory barrier in {MPC:} Fast {MIS} on trees with strongly sublinear memory}, journal = {Theor. Comput. Sci.}, volume = {849}, pages = {22--34}, year = {2021}, url = {https://doi.org/10.1016/j.tcs.2020.10.007}, doi = {10.1016/J.TCS.2020.10.007}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/0002FU21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Balliu0OSST21, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti and Jan Studen{\'{y}} and Jukka Suomela and Aleksandr Tereshchenko}, editor = {Avery Miller and Keren Censor{-}Hillel and Janne H. Korhonen}, title = {Locally Checkable Problems in Rooted Trees}, booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021}, pages = {263--272}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3465084.3467934}, doi = {10.1145/3465084.3467934}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/Balliu0OSST21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Balliu0KO21, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti}, editor = {Avery Miller and Keren Censor{-}Hillel and Janne H. Korhonen}, title = {Improved Distributed Lower Bounds for {MIS} and Bounded (Out-)Degree Dominating Sets in Trees}, booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021}, pages = {283--293}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3465084.3467901}, doi = {10.1145/3465084.3467901}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/Balliu0KO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/0002GR21, author = {Sebastian Brandt and Christoph Grunau and V{\'{a}}clav Rozhon}, editor = {Avery Miller and Keren Censor{-}Hillel and Janne H. Korhonen}, title = {The Randomized Local Computation Complexity of the Lov{\'{a}}sz Local Lemma}, booktitle = {{PODC} '21: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021}, pages = {307--317}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3465084.3467931}, doi = {10.1145/3465084.3467931}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/podc/0002GR21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/spaa/0002KRSU21, author = {Sebastian Brandt and Barbara Keller and Joel Rybicki and Jukka Suomela and Jara Uitto}, editor = {Kunal Agrawal and Yossi Azar}, title = {Efficient Load-Balancing through Distributed Token Dropping}, booktitle = {{SPAA} '21: 33rd {ACM} Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6-8 July, 2021}, pages = {129--139}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3409964.3461785}, doi = {10.1145/3409964.3461785}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/spaa/0002KRSU21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/BrandtLU21, author = {Sebastian Brandt and Rustam Latypov and Jara Uitto}, editor = {Seth Gilbert}, title = {Brief Announcement: Memory Efficient Massively Parallel Algorithms for {LCL} Problems on Trees}, booktitle = {35th International Symposium on Distributed Computing, {DISC} 2021, October 4-8, 2021, Freiburg, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {209}, pages = {50:1--50:4}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.DISC.2021.50}, doi = {10.4230/LIPICS.DISC.2021.50}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wdag/BrandtLU21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-09277, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti and Jan Studen{\'{y}} and Jukka Suomela and Aleksandr Tereshchenko}, title = {Locally Checkable Problems in Rooted Trees}, journal = {CoRR}, volume = {abs/2102.09277}, year = {2021}, url = {https://arxiv.org/abs/2102.09277}, eprinttype = {arXiv}, eprint = {2102.09277}, timestamp = {Wed, 24 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-09277.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2103-16251, author = {Sebastian Brandt and Christoph Grunau and V{\'{a}}clav Rozhon}, title = {The randomized local computation complexity of the Lov{\'{a}}sz local lemma}, journal = {CoRR}, volume = {abs/2103.16251}, year = {2021}, url = {https://arxiv.org/abs/2103.16251}, eprinttype = {arXiv}, eprint = {2103.16251}, timestamp = {Wed, 07 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2103-16251.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-02066, author = {Sebastian Brandt and Yi{-}Jun Chang and Jan Greb{\'{\i}}k and Christoph Grunau and V{\'{a}}clav Rozhon and Zolt{\'{a}}n Vidny{\'{a}}nszky}, title = {Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics}, journal = {CoRR}, volume = {abs/2106.02066}, year = {2021}, url = {https://arxiv.org/abs/2106.02066}, eprinttype = {arXiv}, eprint = {2106.02066}, timestamp = {Fri, 11 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-02066.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2106-02440, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti}, title = {Improved Distributed Lower Bounds for {MIS} and Bounded (Out-)Degree Dominating Sets in Trees}, journal = {CoRR}, volume = {abs/2106.02440}, year = {2021}, url = {https://arxiv.org/abs/2106.02440}, eprinttype = {arXiv}, eprint = {2106.02440}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2106-02440.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2110-00643, author = {Alkida Balliu and Sebastian Brandt and Fabian Kuhn and Dennis Olivetti}, title = {Distributed {\(\Delta\)}-Coloring Plays Hide-and-Seek}, journal = {CoRR}, volume = {abs/2110.00643}, year = {2021}, url = {https://arxiv.org/abs/2110.00643}, eprinttype = {arXiv}, eprint = {2110.00643}, timestamp = {Fri, 08 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2110-00643.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-03683, author = {Sebastian Brandt and Yi{-}Jun Chang and Jan Greb{\'{\i}}k and Christoph Grunau and V{\'{a}}clav Rozhon and Zolt{\'{a}}n Vidny{\'{a}}nszky}, title = {On Homomorphism Graphs}, journal = {CoRR}, volume = {abs/2111.03683}, year = {2021}, url = {https://arxiv.org/abs/2111.03683}, eprinttype = {arXiv}, eprint = {2111.03683}, timestamp = {Wed, 10 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-03683.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2112-09479, author = {Sebastian Brandt and Rustam Latypov and Jara Uitto}, title = {Memory Efficient Massively Parallel Algorithms for {LCL} Problems on Trees}, journal = {CoRR}, volume = {abs/2112.09479}, year = {2021}, url = {https://arxiv.org/abs/2112.09479}, eprinttype = {arXiv}, eprint = {2112.09479}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2112-09479.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dc/BrandtUW20, author = {Sebastian Brandt and Jara Uitto and Roger Wattenhofer}, title = {A tight lower bound for semi-synchronous collaborative grid exploration}, journal = {Distributed Comput.}, volume = {33}, number = {6}, pages = {471--484}, year = {2020}, url = {https://doi.org/10.1007/s00446-020-00369-0}, doi = {10.1007/S00446-020-00369-0}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dc/BrandtUW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrandtFRW20, author = {Sebastian Brandt and Klaus{-}Tycho Foerster and Benjamin Richner and Roger Wattenhofer}, title = {Wireless evacuation on \emph{m} rays with \emph{k} searchers}, journal = {Theor. Comput. Sci.}, volume = {811}, pages = {56--69}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2018.10.032}, doi = {10.1016/J.TCS.2018.10.032}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BrandtFRW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrandtEUW20, author = {Sebastian Brandt and Yuval Emek and Jara Uitto and Roger Wattenhofer}, title = {A tight lower bound for the capture time of the Cops and Robbers game}, journal = {Theor. Comput. Sci.}, volume = {839}, pages = {143--163}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.06.004}, doi = {10.1016/J.TCS.2020.06.004}, timestamp = {Sat, 19 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/BrandtEUW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrandtFMW20, author = {Sebastian Brandt and Klaus{-}Tycho Foerster and Jonathan Maurer and Roger Wattenhofer}, title = {Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs}, journal = {Theor. Comput. Sci.}, volume = {839}, pages = {176--185}, year = {2020}, url = {https://doi.org/10.1016/j.tcs.2020.06.007}, doi = {10.1016/J.TCS.2020.06.007}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BrandtFMW20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Balliu0O20, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti}, editor = {Sandy Irani}, title = {Distributed Lower Bounds for Ruling Sets}, booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2020, Durham, NC, USA, November 16-19, 2020}, pages = {365--376}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/FOCS46700.2020.00042}, doi = {10.1109/FOCS46700.2020.00042}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Balliu0O20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/0002O20, author = {Sebastian Brandt and Dennis Olivetti}, editor = {Yuval Emek and Christian Cachin}, title = {Truly Tight-in-{\(\Delta\)} Bounds for Bipartite Maximal Matching and Variants}, booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020}, pages = {69--78}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3382734.3405745}, doi = {10.1145/3382734.3405745}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/0002O20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Balliu0OS20, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti and Jukka Suomela}, editor = {Yuval Emek and Christian Cachin}, title = {How much does randomness help with locally checkable problems?}, booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020}, pages = {299--308}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3382734.3405715}, doi = {10.1145/3382734.3405715}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/Balliu0OS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/0002GR20, author = {Sebastian Brandt and Christoph Grunau and V{\'{a}}clav Rozhon}, editor = {Yuval Emek and Christian Cachin}, title = {Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lov{\'{a}}sz Local Lemma}, booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020}, pages = {329--338}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3382734.3405730}, doi = {10.1145/3382734.3405730}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/podc/0002GR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Balliu0EHMOS20, author = {Alkida Balliu and Sebastian Brandt and Yuval Efron and Juho Hirvonen and Yannic Maus and Dennis Olivetti and Jukka Suomela}, editor = {Yuval Emek and Christian Cachin}, title = {Brief Announcement: Classification of Distributed Binary Labeling Problems}, booktitle = {{PODC} '20: {ACM} Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3-7, 2020}, pages = {349--351}, publisher = {{ACM}}, year = {2020}, url = {https://doi.org/10.1145/3382734.3405703}, doi = {10.1145/3382734.3405703}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/Balliu0EHMOS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/0002PU20, author = {Sebastian Brandt and Julian Portmann and Jara Uitto}, editor = {Hagit Attiya}, title = {Tight Bounds for Deterministic High-Dimensional Grid Exploration}, booktitle = {34th International Symposium on Distributed Computing, {DISC} 2020, October 12-16, 2020, Virtual Conference}, series = {LIPIcs}, volume = {179}, pages = {13:1--13:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.DISC.2020.13}, doi = {10.4230/LIPICS.DISC.2020.13}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/0002PU20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/Balliu0EHMOS20, author = {Alkida Balliu and Sebastian Brandt and Yuval Efron and Juho Hirvonen and Yannic Maus and Dennis Olivetti and Jukka Suomela}, editor = {Hagit Attiya}, title = {Classification of Distributed Binary Labeling Problems}, booktitle = {34th International Symposium on Distributed Computing, {DISC} 2020, October 12-16, 2020, Virtual Conference}, series = {LIPIcs}, volume = {179}, pages = {17:1--17:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.DISC.2020.17}, doi = {10.4230/LIPICS.DISC.2020.17}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/Balliu0EHMOS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/0002KRSU20, author = {Sebastian Brandt and Barbara Keller and Joel Rybicki and Jukka Suomela and Jara Uitto}, editor = {Hagit Attiya}, title = {Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping}, booktitle = {34th International Symposium on Distributed Computing, {DISC} 2020, October 12-16, 2020, Virtual Conference}, series = {LIPIcs}, volume = {179}, pages = {40:1--40:3}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.DISC.2020.40}, doi = {10.4230/LIPICS.DISC.2020.40}, timestamp = {Thu, 16 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/0002KRSU20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2002-08216, author = {Sebastian Brandt and Dennis Olivetti}, title = {Truly Tight-in-{\(\Delta\)} Bounds for Bipartite Maximal Matching and Variants}, journal = {CoRR}, volume = {abs/2002.08216}, year = {2020}, url = {https://arxiv.org/abs/2002.08216}, eprinttype = {arXiv}, eprint = {2002.08216}, timestamp = {Mon, 02 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2002-08216.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2004-08282, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti}, title = {Distributed Lower Bounds for Ruling Sets}, journal = {CoRR}, volume = {abs/2004.08282}, year = {2020}, url = {https://arxiv.org/abs/2004.08282}, eprinttype = {arXiv}, eprint = {2004.08282}, timestamp = {Tue, 21 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-08282.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2005-07761, author = {Sebastian Brandt and Barbara Keller and Joel Rybicki and Jukka Suomela and Jara Uitto}, title = {Efficient Load-Balancing through Distributed Token Dropping}, journal = {CoRR}, volume = {abs/2005.07761}, year = {2020}, url = {https://arxiv.org/abs/2005.07761}, eprinttype = {arXiv}, eprint = {2005.07761}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2005-07761.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2005-12623, author = {Sebastian Brandt and Julian Portmann and Jara Uitto}, title = {Tight Bounds for Deterministic High-Dimensional Grid Exploration}, journal = {CoRR}, volume = {abs/2005.12623}, year = {2020}, url = {https://arxiv.org/abs/2005.12623}, eprinttype = {arXiv}, eprint = {2005.12623}, timestamp = {Thu, 28 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2005-12623.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2006-04625, author = {Sebastian Brandt and Christoph Grunau and V{\'{a}}clav Rozhon}, title = {Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lov{\'{a}}sz Local Lemma}, journal = {CoRR}, volume = {abs/2006.04625}, year = {2020}, url = {https://arxiv.org/abs/2006.04625}, eprinttype = {arXiv}, eprint = {2006.04625}, timestamp = {Tue, 23 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2006-04625.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BrandtW19, author = {Sebastian Brandt and Roger Wattenhofer}, title = {Approximating Small Balanced Vertex Separators in Almost Linear Time}, journal = {Algorithmica}, volume = {81}, number = {10}, pages = {4070--4097}, year = {2019}, url = {https://doi.org/10.1007/s00453-018-0490-x}, doi = {10.1007/S00453-018-0490-X}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/BrandtW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/sigact/BrandtFU19, author = {Sebastian Brandt and Manuela Fischer and Jara Uitto}, title = {{SIROCCO} 2019 Review}, journal = {{SIGACT} News}, volume = {50}, number = {4}, pages = {46--47}, year = {2019}, url = {https://doi.org/10.1145/3374857.3374867}, doi = {10.1145/3374857.3374867}, timestamp = {Fri, 13 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/sigact/BrandtFU19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/Balliu0HORS19, author = {Alkida Balliu and Sebastian Brandt and Juho Hirvonen and Dennis Olivetti and Mika{\"{e}}l Rabie and Jukka Suomela}, editor = {David Zuckerman}, title = {Lower Bounds for Maximal Matchings and Maximal Independent Sets}, booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2019, Baltimore, Maryland, USA, November 9-12, 2019}, pages = {481--497}, publisher = {{IEEE} Computer Society}, year = {2019}, url = {https://doi.org/10.1109/FOCS.2019.00037}, doi = {10.1109/FOCS.2019.00037}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/Balliu0HORS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Balliu0CORS19, author = {Alkida Balliu and Sebastian Brandt and Yi{-}Jun Chang and Dennis Olivetti and Mika{\"{e}}l Rabie and Jukka Suomela}, editor = {Peter Robinson and Faith Ellen}, title = {The Distributed Complexity of Locally Checkable Problems on Paths is Decidable}, booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019}, pages = {262--271}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3293611.3331606}, doi = {10.1145/3293611.3331606}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/Balliu0CORS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Brandt19, author = {Sebastian Brandt}, editor = {Peter Robinson and Faith Ellen}, title = {An Automatic Speedup Theorem for Distributed Problems}, booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019}, pages = {379--388}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3293611.3331611}, doi = {10.1145/3293611.3331611}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/Brandt19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/BrandtMU19, author = {Sebastian Brandt and Yannic Maus and Jara Uitto}, editor = {Peter Robinson and Faith Ellen}, title = {A Sharp Threshold Phenomenon for the Distributed Complexity of the Lov{\'{a}}sz Local Lemma}, booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019}, pages = {389--398}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3293611.3331636}, doi = {10.1145/3293611.3331636}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/BrandtMU19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/Behnezhad0DFHKU19, author = {Soheil Behnezhad and Sebastian Brandt and Mahsa Derakhshan and Manuela Fischer and MohammadTaghi Hajiaghayi and Richard M. Karp and Jara Uitto}, editor = {Peter Robinson and Faith Ellen}, title = {Massively Parallel Computation of Matching and {MIS} in Sparse Graphs}, booktitle = {Proceedings of the 2019 {ACM} Symposium on Principles of Distributed Computing, {PODC} 2019, Toronto, ON, Canada, July 29 - August 2, 2019}, pages = {481--490}, publisher = {{ACM}}, year = {2019}, url = {https://doi.org/10.1145/3293611.3331609}, doi = {10.1145/3293611.3331609}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/Behnezhad0DFHKU19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/0002FU19, author = {Sebastian Brandt and Manuela Fischer and Jara Uitto}, editor = {Keren Censor{-}Hillel and Michele Flammini}, title = {Breaking the Linear-Memory Barrier in {MPC:} Fast {MIS} on Trees with Strongly Sublinear Memory}, booktitle = {Structural Information and Communication Complexity - 26th International Colloquium, {SIROCCO} 2019, L'Aquila, Italy, July 1-4, 2019, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {11639}, pages = {124--138}, publisher = {Springer}, year = {2019}, url = {https://doi.org/10.1007/978-3-030-24922-9\_9}, doi = {10.1007/978-3-030-24922-9\_9}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sirocco/0002FU19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1901-02441, author = {Alkida Balliu and Sebastian Brandt and Juho Hirvonen and Dennis Olivetti and Mika{\"{e}}l Rabie and Jukka Suomela}, title = {Lower bounds for maximal matchings and maximal independent sets}, journal = {CoRR}, volume = {abs/1901.02441}, year = {2019}, url = {http://arxiv.org/abs/1901.02441}, eprinttype = {arXiv}, eprint = {1901.02441}, timestamp = {Thu, 28 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1901-02441.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-06803, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti and Jukka Suomela}, title = {How much does randomness help with locally checkable problems?}, journal = {CoRR}, volume = {abs/1902.06803}, year = {2019}, url = {http://arxiv.org/abs/1902.06803}, eprinttype = {arXiv}, eprint = {1902.06803}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-06803.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1902-09958, author = {Sebastian Brandt}, title = {An Automatic Speedup Theorem for Distributed Problems}, journal = {CoRR}, volume = {abs/1902.09958}, year = {2019}, url = {http://arxiv.org/abs/1902.09958}, eprinttype = {arXiv}, eprint = {1902.09958}, timestamp = {Tue, 21 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1902-09958.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1903-00581, author = {Sebastian Brandt and Klaus{-}Tycho Foerster and Jonathan Maurer and Roger Wattenhofer}, title = {Online Graph Exploration on a Restricted Graph Class: Optimal Solutions for Tadpole Graphs}, journal = {CoRR}, volume = {abs/1903.00581}, year = {2019}, url = {http://arxiv.org/abs/1903.00581}, eprinttype = {arXiv}, eprint = {1903.00581}, timestamp = {Sat, 30 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1903-00581.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1908-06270, author = {Sebastian Brandt and Yannic Maus and Jara Uitto}, title = {A Sharp Threshold Phenomenon for the Distributed Complexity of the Lov{\'{a}}sz Local Lemma}, journal = {CoRR}, volume = {abs/1908.06270}, year = {2019}, url = {http://arxiv.org/abs/1908.06270}, eprinttype = {arXiv}, eprint = {1908.06270}, timestamp = {Mon, 26 Aug 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1908-06270.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1911-13294, author = {Alkida Balliu and Sebastian Brandt and Yuval Efron and Juho Hirvonen and Yannic Maus and Dennis Olivetti and Jukka Suomela}, title = {Classification of distributed binary labeling problems}, journal = {CoRR}, volume = {abs/1911.13294}, year = {2019}, url = {http://arxiv.org/abs/1911.13294}, eprinttype = {arXiv}, eprint = {1911.13294}, timestamp = {Wed, 08 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1911-13294.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BrandtPU18, author = {Sebastian Brandt and Seth Pettie and Jara Uitto}, editor = {Yossi Azar and Hannah Bast and Grzegorz Herman}, title = {Fine-grained Lower Bounds on Cops and Robbers}, booktitle = {26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {112}, pages = {9:1--9:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ESA.2018.9}, doi = {10.4230/LIPICS.ESA.2018.9}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/esa/BrandtPU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/BalliuBOS18, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti and Jukka Suomela}, editor = {Ulrich Schmid and Josef Widder}, title = {Almost Global Problems in the {LOCAL} Model}, booktitle = {32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018}, series = {LIPIcs}, volume = {121}, pages = {9:1--9:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.DISC.2018.9}, doi = {10.4230/LIPICS.DISC.2018.9}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wdag/BalliuBOS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wdag/BrandtUW18, author = {Sebastian Brandt and Jara Uitto and Roger Wattenhofer}, editor = {Ulrich Schmid and Josef Widder}, title = {A Tight Lower Bound for Semi-Synchronous Collaborative Grid Exploration}, booktitle = {32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018}, series = {LIPIcs}, volume = {121}, pages = {13:1--13:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.DISC.2018.13}, doi = {10.4230/LIPICS.DISC.2018.13}, timestamp = {Thu, 02 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wdag/BrandtUW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1805-04776, author = {Alkida Balliu and Sebastian Brandt and Dennis Olivetti and Jukka Suomela}, title = {Almost Global Problems in the {LOCAL} Model}, journal = {CoRR}, volume = {abs/1805.04776}, year = {2018}, url = {http://arxiv.org/abs/1805.04776}, eprinttype = {arXiv}, eprint = {1805.04776}, timestamp = {Thu, 28 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1805-04776.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1807-05374, author = {Sebastian Brandt and Manuela Fischer and Jara Uitto}, title = {Matching and {MIS} for Uniformly Sparse Graphs in the Low-Memory {MPC} Model}, journal = {CoRR}, volume = {abs/1807.05374}, year = {2018}, url = {http://arxiv.org/abs/1807.05374}, eprinttype = {arXiv}, eprint = {1807.05374}, timestamp = {Thu, 28 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1807-05374.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1811-01672, author = {Alkida Balliu and Sebastian Brandt and Yi{-}Jun Chang and Dennis Olivetti and Mika{\"{e}}l Rabie and Jukka Suomela}, title = {The distributed complexity of locally checkable problems on paths is decidable}, journal = {CoRR}, volume = {abs/1811.01672}, year = {2018}, url = {http://arxiv.org/abs/1811.01672}, eprinttype = {arXiv}, eprint = {1811.01672}, timestamp = {Thu, 28 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1811-01672.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/percom/BrandtFW17, author = {Sebastian Brandt and Klaus{-}Tycho Foerster and Roger Wattenhofer}, title = {Augmenting flows for the consistent migration of multi-commodity single-destination flows in SDNs}, journal = {Pervasive Mob. Comput.}, volume = {36}, pages = {134--150}, year = {2017}, url = {https://doi.org/10.1016/j.pmcj.2016.09.012}, doi = {10.1016/J.PMCJ.2016.09.012}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/percom/BrandtFW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/BrandtLLSW17, author = {Sebastian Brandt and Felix Laufenberg and Yuezhou Lv and David Stolz and Roger Wattenhofer}, editor = {Dimitris Fotakis and Aris Pagourtzis and Vangelis Th. Paschos}, title = {Collaboration Without Communication: Evacuating Two Robots from a Disk}, booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC} 2017, Athens, Greece, May 24-26, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10236}, pages = {104--115}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-57586-5\_10}, doi = {10.1007/978-3-319-57586-5\_10}, timestamp = {Thu, 24 Mar 2022 11:08:56 +0100}, biburl = {https://dblp.org/rec/conf/ciac/BrandtLLSW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BrandtEUW17, author = {Sebastian Brandt and Yuval Emek and Jara Uitto and Roger Wattenhofer}, editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl}, title = {A Tight Lower Bound for the Capture Time of the Cops and Robbers Game}, booktitle = {44th International Colloquium on Automata, Languages, and Programming, {ICALP} 2017, July 10-14, 2017, Warsaw, Poland}, series = {LIPIcs}, volume = {80}, pages = {82:1--82:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.82}, doi = {10.4230/LIPICS.ICALP.2017.82}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BrandtEUW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/podc/BrandtHKLOPRSU17, author = {Sebastian Brandt and Juho Hirvonen and Janne H. Korhonen and Tuomo Lempi{\"{a}}inen and Patric R. J. {\"{O}}sterg{\aa}rd and Christopher Purcell and Joel Rybicki and Jukka Suomela and Przemyslaw Uznanski}, editor = {Elad Michael Schiller and Alexander A. Schwarzmann}, title = {{LCL} Problems on Grids}, booktitle = {Proceedings of the {ACM} Symposium on Principles of Distributed Computing, {PODC} 2017, Washington, DC, USA, July 25-27, 2017}, pages = {101--110}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3087801.3087833}, doi = {10.1145/3087801.3087833}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/podc/BrandtHKLOPRSU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sirocco/BrandtFRW17, author = {Sebastian Brandt and Klaus{-}Tycho Foerster and Benjamin Richner and Roger Wattenhofer}, editor = {Shantanu Das and S{\'{e}}bastien Tixeuil}, title = {Wireless Evacuation on m Rays with k Searchers}, booktitle = {Structural Information and Communication Complexity - 24th International Colloquium, {SIROCCO} 2017, Porquerolles, France, June 19-22, 2017, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10641}, pages = {140--157}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-72050-0\_9}, doi = {10.1007/978-3-319-72050-0\_9}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/sirocco/BrandtFRW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/BrandtW17, author = {Sebastian Brandt and Roger Wattenhofer}, editor = {Faith Ellen and Antonina Kolokolova and J{\"{o}}rg{-}R{\"{u}}diger Sack}, title = {Approximating Small Balanced Vertex Separators in Almost Linear Time}, booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS} 2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10389}, pages = {229--240}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-62127-2\_20}, doi = {10.1007/978-3-319-62127-2\_20}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wads/BrandtW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BrandtHKLOPRSU17, author = {Sebastian Brandt and Juho Hirvonen and Janne H. Korhonen and Tuomo Lempi{\"{a}}inen and Patric R. J. {\"{O}}sterg{\aa}rd and Christopher Purcell and Joel Rybicki and Jukka Suomela and Przemyslaw Uznanski}, title = {{LCL} problems on grids}, journal = {CoRR}, volume = {abs/1702.05456}, year = {2017}, url = {http://arxiv.org/abs/1702.05456}, eprinttype = {arXiv}, eprint = {1702.05456}, timestamp = {Thu, 28 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BrandtHKLOPRSU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BrandtUW17, author = {Sebastian Brandt and Jara Uitto and Roger Wattenhofer}, title = {Tight Bounds for Asynchronous Collaborative Grid Exploration}, journal = {CoRR}, volume = {abs/1705.03834}, year = {2017}, url = {http://arxiv.org/abs/1705.03834}, eprinttype = {arXiv}, eprint = {1705.03834}, timestamp = {Thu, 28 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BrandtUW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icdcn/BrandtFW16, author = {Sebastian Brandt and Klaus{-}Tycho F{\"{o}}rster and Roger Wattenhofer}, title = {Augmenting anycast network flows}, booktitle = {Proceedings of the 17th International Conference on Distributed Computing and Networking, Singapore, January 4-7, 2016}, pages = {24:1--24:10}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2833312.2833450}, doi = {10.1145/2833312.2833450}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icdcn/BrandtFW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/infocom/BrandtFW16, author = {Sebastian Brandt and Klaus{-}Tycho F{\"{o}}rster and Roger Wattenhofer}, title = {On consistent migration of flows in SDNs}, booktitle = {35th Annual {IEEE} International Conference on Computer Communications, {INFOCOM} 2016, San Francisco, CA, USA, April 10-14, 2016}, pages = {1--9}, publisher = {{IEEE}}, year = {2016}, url = {https://doi.org/10.1109/INFOCOM.2016.7524332}, doi = {10.1109/INFOCOM.2016.7524332}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/infocom/BrandtFW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BrandtFHKLRSU16, author = {Sebastian Brandt and Orr Fischer and Juho Hirvonen and Barbara Keller and Tuomo Lempi{\"{a}}inen and Joel Rybicki and Jukka Suomela and Jara Uitto}, editor = {Daniel Wichs and Yishay Mansour}, title = {A lower bound for the distributed Lov{\'{a}}sz local lemma}, booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016}, pages = {479--488}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2897518.2897570}, doi = {10.1145/2897518.2897570}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BrandtFHKLRSU16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/BrandtMSW15, author = {Sebastian Brandt and Nicolas Mattia and Jochen Seidel and Roger Wattenhofer}, editor = {Khaled M. Elbassioni and Kazuhisa Makino}, title = {Toehold {DNA} Languages are Regular}, booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC} 2015, Nagoya, Japan, December 9-11, 2015, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9472}, pages = {780--790}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-662-48971-0\_65}, doi = {10.1007/978-3-662-48971-0\_65}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isaac/BrandtMSW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BrandtFHKLRSU15, author = {Sebastian Brandt and Orr Fischer and Juho Hirvonen and Barbara Keller and Tuomo Lempi{\"{a}}inen and Joel Rybicki and Jukka Suomela and Jara Uitto}, title = {A Lower Bound for the Distributed Lov{\'{a}}sz Local Lemma}, journal = {CoRR}, volume = {abs/1511.00900}, year = {2015}, url = {http://arxiv.org/abs/1511.00900}, eprinttype = {arXiv}, eprint = {1511.00900}, timestamp = {Thu, 28 Feb 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/BrandtFHKLRSU15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.