Published in: LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022)
Maciej Pacut, Mahmoud Parham, Joel Rybicki, Stefan Schmid, Jukka Suomela, and Aleksandr Tereshchenko. Brief Announcement: Temporal Locality in Online Algorithms. In 36th International Symposium on Distributed Computing (DISC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 246, pp. 52:1-52:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{pacut_et_al:LIPIcs.DISC.2022.52, author = {Pacut, Maciej and Parham, Mahmoud and Rybicki, Joel and Schmid, Stefan and Suomela, Jukka and Tereshchenko, Aleksandr}, title = {{Brief Announcement: Temporal Locality in Online Algorithms}}, booktitle = {36th International Symposium on Distributed Computing (DISC 2022)}, pages = {52:1--52:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-255-6}, ISSN = {1868-8969}, year = {2022}, volume = {246}, editor = {Scheideler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.52}, URN = {urn:nbn:de:0030-drops-172431}, doi = {10.4230/LIPIcs.DISC.2022.52}, annote = {Keywords: Online algorithms, distributed algorithms} }
Published in: LIPIcs, Volume 217, 25th International Conference on Principles of Distributed Systems (OPODIS 2021)
Dan Alistarh, Rati Gelashvili, and Joel Rybicki. Fast Graphical Population Protocols. In 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 217, pp. 14:1-14:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2022)
@InProceedings{alistarh_et_al:LIPIcs.OPODIS.2021.14, author = {Alistarh, Dan and Gelashvili, Rati and Rybicki, Joel}, title = {{Fast Graphical Population Protocols}}, booktitle = {25th International Conference on Principles of Distributed Systems (OPODIS 2021)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-219-8}, ISSN = {1868-8969}, year = {2022}, volume = {217}, editor = {Bramas, Quentin and Gramoli, Vincent and Milani, Alessia}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2021.14}, URN = {urn:nbn:de:0030-drops-157897}, doi = {10.4230/LIPIcs.OPODIS.2021.14}, annote = {Keywords: population protocols, leader election, exact majority, graphs} }
Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)
Dan Alistarh, Rati Gelashvili, and Joel Rybicki. Brief Announcement: Fast Graphical Population Protocols. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 43:1-43:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{alistarh_et_al:LIPIcs.DISC.2021.43, author = {Alistarh, Dan and Gelashvili, Rati and Rybicki, Joel}, title = {{Brief Announcement: Fast Graphical Population Protocols}}, booktitle = {35th International Symposium on Distributed Computing (DISC 2021)}, pages = {43:1--43:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-210-5}, ISSN = {1868-8969}, year = {2021}, volume = {209}, editor = {Gilbert, Seth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.43}, URN = {urn:nbn:de:0030-drops-148451}, doi = {10.4230/LIPIcs.DISC.2021.43}, annote = {Keywords: population protocols, leader election, majority} }
Published in: LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021)
Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, and Jukka Suomela. Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 58:1-58:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{korhonen_et_al:LIPIcs.DISC.2021.58, author = {Korhonen, Janne H. and Paz, Ami and Rybicki, Joel and Schmid, Stefan and Suomela, Jukka}, title = {{Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model}}, booktitle = {35th International Symposium on Distributed Computing (DISC 2021)}, pages = {58:1--58:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-210-5}, ISSN = {1868-8969}, year = {2021}, volume = {209}, editor = {Gilbert, Seth}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.58}, URN = {urn:nbn:de:0030-drops-148609}, doi = {10.4230/LIPIcs.DISC.2021.58}, annote = {Keywords: Supported LOCAL model, sinkless orientation, round elimination} }
Published in: LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)
Da-Jung Cho, Matthias Függer, Corbin Hopper, Manish Kushwaha, Thomas Nowak, and Quentin Soubeyran. Distributed Computation with Continual Population Growth. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 7:1-7:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{cho_et_al:LIPIcs.DISC.2020.7, author = {Cho, Da-Jung and F\"{u}gger, Matthias and Hopper, Corbin and Kushwaha, Manish and Nowak, Thomas and Soubeyran, Quentin}, title = {{Distributed Computation with Continual Population Growth}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {7:1--7:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.7}, URN = {urn:nbn:de:0030-drops-130856}, doi = {10.4230/LIPIcs.DISC.2020.7}, annote = {Keywords: microbiological circuits, majority consensus, birth-death processes} }
Published in: LIPIcs, Volume 179, 34th International Symposium on Distributed Computing (DISC 2020)
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, and Jara Uitto. Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping. In 34th International Symposium on Distributed Computing (DISC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 179, pp. 40:1-40:3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
@InProceedings{brandt_et_al:LIPIcs.DISC.2020.40, author = {Brandt, Sebastian and Keller, Barbara and Rybicki, Joel and Suomela, Jukka and Uitto, Jara}, title = {{Brief Announcement: Efficient Load-Balancing Through Distributed Token Dropping}}, booktitle = {34th International Symposium on Distributed Computing (DISC 2020)}, pages = {40:1--40:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-168-9}, ISSN = {1868-8969}, year = {2020}, volume = {179}, editor = {Attiya, Hagit}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2020.40}, URN = {urn:nbn:de:0030-drops-131182}, doi = {10.4230/LIPIcs.DISC.2020.40}, annote = {Keywords: distributed algorithms, graph problems, semi-matching} }
Published in: LIPIcs, Volume 146, 33rd International Symposium on Distributed Computing (DISC 2019)
Thomas Nowak and Joel Rybicki. Byzantine Approximate Agreement on Graphs. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 29:1-29:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
@InProceedings{nowak_et_al:LIPIcs.DISC.2019.29, author = {Nowak, Thomas and Rybicki, Joel}, title = {{Byzantine Approximate Agreement on Graphs}}, booktitle = {33rd International Symposium on Distributed Computing (DISC 2019)}, pages = {29:1--29:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-126-9}, ISSN = {1868-8969}, year = {2019}, volume = {146}, editor = {Suomela, Jukka}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2019.29}, URN = {urn:nbn:de:0030-drops-113363}, doi = {10.4230/LIPIcs.DISC.2019.29}, annote = {Keywords: consensus, approximate agreement, Byzantine faults, chordal graphs, lattice agreement} }
Published in: LIPIcs, Volume 95, 21st International Conference on Principles of Distributed Systems (OPODIS 2017)
Janne H. Korhonen and Joel Rybicki. Deterministic Subgraph Detection in Broadcast CONGEST. In 21st International Conference on Principles of Distributed Systems (OPODIS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 95, pp. 4:1-4:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{korhonen_et_al:LIPIcs.OPODIS.2017.4, author = {Korhonen, Janne H. and Rybicki, Joel}, title = {{Deterministic Subgraph Detection in Broadcast CONGEST}}, booktitle = {21st International Conference on Principles of Distributed Systems (OPODIS 2017)}, pages = {4:1--4:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-061-3}, ISSN = {1868-8969}, year = {2018}, volume = {95}, editor = {Aspnes, James and Bessani, Alysson and Felber, Pascal and Leit\~{a}o, Jo\~{a}o}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2017.4}, URN = {urn:nbn:de:0030-drops-86252}, doi = {10.4230/LIPIcs.OPODIS.2017.4}, annote = {Keywords: distributed computing, subgraph detection, CONGEST model, lower bounds} }
Published in: LIPIcs, Volume 91, 31st International Symposium on Distributed Computing (DISC 2017)
Christoph Lenzen and Joel Rybicki. Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus. In 31st International Symposium on Distributed Computing (DISC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 91, pp. 32:1-32:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{lenzen_et_al:LIPIcs.DISC.2017.32, author = {Lenzen, Christoph and Rybicki, Joel}, title = {{Self-Stabilising Byzantine Clock Synchronisation is Almost as Easy as Consensus}}, booktitle = {31st International Symposium on Distributed Computing (DISC 2017)}, pages = {32:1--32:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-053-8}, ISSN = {1868-8969}, year = {2017}, volume = {91}, editor = {Richa, Andr\'{e}a}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2017.32}, URN = {urn:nbn:de:0030-drops-79914}, doi = {10.4230/LIPIcs.DISC.2017.32}, annote = {Keywords: Byzantine faults, self-stabilisation, clock synchronisation, consensus} }
Published in: LIPIcs, Volume 40, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, and Joel L. Wolf. The Container Selection Problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 416-434, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{nagarajan_et_al:LIPIcs.APPROX-RANDOM.2015.416, author = {Nagarajan, Viswanath and Sarpatwar, Kanthi K. and Schieber, Baruch and Shachnai, Hadas and Wolf, Joel L.}, title = {{The Container Selection Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)}, pages = {416--434}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-89-7}, ISSN = {1868-8969}, year = {2015}, volume = {40}, editor = {Garg, Naveen and Jansen, Klaus and Rao, Anup and Rolim, Jos\'{e} D. P.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.416}, URN = {urn:nbn:de:0030-drops-53153}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2015.416}, annote = {Keywords: non-metric k-median, geometric hitting set, approximation algorithms, cloud computing, cross platform scheduling.} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, and Ali Kemal Sinop. The Hardness of Approximation of Euclidean k-Means. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 754-767, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{awasthi_et_al:LIPIcs.SOCG.2015.754, author = {Awasthi, Pranjal and Charikar, Moses and Krishnaswamy, Ravishankar and Sinop, Ali Kemal}, title = {{The Hardness of Approximation of Euclidean k-Means}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {754--767}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.754}, URN = {urn:nbn:de:0030-drops-51178}, doi = {10.4230/LIPIcs.SOCG.2015.754}, annote = {Keywords: Euclidean k-means, Hardness of Approximation, Vertex Cover} }
Feedback for Dagstuhl Publishing