The cost of limited communication bandwidth in distributed computing

Project Information

BANDWIDTH

Grant agreement ID: 755839

DOI

10.3030/755839

Project closed

EC signature date 6 November 2017

Start date 1 June 2018

End date 30 November 2023

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 486 480,00

EU contribution

€ 1 486 480,00

Coordinated by

TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY
Israel

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (44)

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs

Author(s): Keren Censor-Hillel, Orr Fischer, Tzlil Gonen, François Le Gall, Dean Leitersdorf, Rotem Oshman
Published in: 34th International Symposium on Distributed Computing, 2020, Page(s) 33:1--33:17, ISBN 978-3-95977-168-9
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.disc.2020.33

Locally Checkable Labelings with Small Messages

Author(s): Balliu, Alkida; Censor-Hillel, Keren; Maus, Yannic; Olivetti, Dennis; Suomela, Jukka
Published in: Issue 9, 2021
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2105.05574

Near-optimal distributed degree+1 coloring

Author(s): Halldórsson, Magnús M.; Kuhn, Fabian; Nolin, Alexandre; Tonoyan, Tigran
Published in: STOC, Issue 5, 2022
Publisher: ACM
DOI: 10.1145/3519935.3520023

Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST

Author(s): Yuval Efron, Ofer Grossman, Seri Khoury
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Page(s) 511-520, ISBN 9781450375825
Publisher: ACM
DOI: 10.1145/3382734.3405702

Deterministic Near-Optimal Distributed Listing of Cliques

Author(s): Censor-Hillel, Keren; Leitersdorf, Dean; Vulakh, David
Published in: PODC, Issue 5, 2022
Publisher: ACM
DOI: 10.1145/3519270.3538434

On Distributed Computation of the Minimum Triangle Edge Transversal

Author(s): Keren Censor-Hillel and Majd Khoury
Published in: 2024
Publisher: LNCS

Distributed Subgraph Finding: Progress and Challenges

Author(s): Censor-Hillel, Keren
Published in: ICALP 2021, Issue 1, 2021
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2203.06597

Distributed Spanner Approximation

Author(s): Censor-Hillel, Keren; Dory, Michal
Published in: PODC, Issue 4, 2018
Publisher: ACM
DOI: 10.1145/3212734.3212758

On Distributed Listing of Cliques

Author(s): Keren Censor-Hillel, François Le Gall, Dean Leitersdorf
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Page(s) 474-482, ISBN 9781450375825
Publisher: ACM
DOI: 10.1145/3382734.3405742

Efficient Deterministic Distributed Coloring with Small Bandwidth

Author(s): Philipp Bamberger, Fabian Kuhn, Yannic Maus
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Page(s) 243-252, ISBN 9781450375825
Publisher: ACM
DOI: 10.1145/3382734.3404504

Distributed Computations in Fully-Defective Networks

Author(s): Censor-Hillel, Keren; Cohen, Shir; Gelles, Ran; Sela, Gal
Published in: PODC, Issue 5, 2022
Publisher: ACM
DOI: 10.1145/3519270.3538432

Near-Optimal Scheduling in the Congested Clique

Author(s): Keren Censor-Hillel; Yannic Maus; Volodymyr Polosukhin
Published in: SIROCCO, Issue 10, 2021
Publisher: Springer
DOI: 10.1007/978-3-030-79527-6_4

Fast Deterministic Algorithms for Highly-Dynamic Networks

Author(s): Censor-Hillel, Keren; Dafni, Neta; Kolobov, Victor I.; Paz, Ami; Schwartzman, Gregory
Published in: OPODIS, Issue 35, 2020
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.1901.04008

Efficient randomized distributed coloring in CONGEST

Author(s): Halld��rsson, Magn��s M.; Kuhn, Fabian; Maus, Yannic; Tonoyan, Tigran
Published in: STOC, Issue 5, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451089

Quantum Distributed Algorithms for Detection of Cliques

Author(s): Censor-Hillel, Keren; Fischer, Orr; Le Gall, François; Leitersdorf, Dean; Oshman, Rotem
Published in: Issue 1, 2022
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2201.03000

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens

Author(s): Censor-Hillel, Keren; Machino, Yuka; Soto, Pedro
Published in: SIROCCO 2024, Issue 1, 2024
Publisher: LNCS
DOI: 10.48550/arxiv.2312.16460

Near-Optimal Scheduling in the Congested Clique

Author(s): Censor-Hillel, Keren; Maus, Yannic; Polosukhin, Volodymyr
Published in: Issue 9, 2021
Publisher: Springer
DOI: 10.48550/arxiv.2102.07221

Local Conflict Coloring Revisited: Linial for Lists

Author(s): Maus, Yannic; Tonoyan, Tigran
Published in: 34th International Symposium on Distributed Computing, Issue 1, 2020, Page(s) 16:1--16:18, ISBN 978-3-95977-168-9
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.disc.2020.16

Fault Tolerant Max-Cut

Author(s): Censor-Hillel, Keren; Marelly, Noa; Schwartz, Roy; Tonoyan, Tigran
Published in: Issue 10, 2021
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2105.01138

Distributed weighted min-cut in nearly-optimal time

Author(s): Michal Dory; Yuval Efron; Sagnik Mukhopadhyay; Danupon Nanongkai
Published in: STOC, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451020

Distributed Vertex Cover Reconfiguration

Author(s): Censor-Hillel, Keren; Maus, Yannic; Romem-Peled, Shahar; Tonoyan, Tigran
Published in: Issue 10, 2022
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2109.06601

Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs

Author(s): Censor-Hillel, Keren; Fischer, Orr; Gonen, Tzlil; Le Gall, François; Leitersdorf, Dean; Oshman, Rotem
Published in: DISC, Issue 1, 2020
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2101.07590

Tight Distributed Listing of Cliques

Author(s): Censor-Hillel, Keren; Chang, Yi-Jun; Gall, François Le; Leitersdorf, Dean
Published in: Issue 3, 2021
Publisher: SIAM
DOI: 10.48550/arxiv.2011.07405

A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma

Author(s): Brandt, Sebastian; Maus, Yannic; Uitto, Jara
Published in: PODC, Issue 1, 2019
Publisher: ACM
DOI: 10.1145/3293611.3331636

Overcoming Congestion in Distributed Coloring

Author(s): Halldórsson, Magnús M.; Nolin, Alexandre; Tonoyan, Tigran
Published in: Crossref, Issue 4, 2022
Publisher: ACM
DOI: 10.1145/3519270.3538438

Finding Subgraphs in Highly Dynamic Networks

Author(s): Censor-Hillel, Keren; Kolobov, Victor I.; Schwartzman, Gregory
Published in: SPAA, Issue 10, 2021
Publisher: ACM
DOI: 10.1145/3409964.3461788

On Sparsity Awareness in Distributed Computations

Author(s): Censor-Hillel, Keren; Leitersdorf, Dean; Polosukhin, Volodymyr
Published in: SPAA, Issue 34, 2021
Publisher: ACM
DOI: 10.1145/3409964.3461798

Distributed Distance Approximation

Author(s): Ancona, Bertie; Censor-Hillel, Keren; Dalirrooyfard, Mina; Efron, Yuval; Williams, Virginia Vassilevska
Published in: Issue 10, 2020
Publisher: Springer
DOI: 10.48550/arxiv.2011.05066

Coloring Fast Without Learning Your Neighbors' Colors

Author(s): Magnus M. Halldorsson, Fabian Kuhn, Yannic Maus, Alexandre Nolin
Published in: 34th International Symposium on Distributed Computing, 2020, Page(s) 39:1--39:17, ISBN 978-3-95977-168-9
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.disc.2020.39

The Sparsest Additive Spanner via Multiple Weighted BFS Trees

Author(s): Censor-Hillel, Keren; Paz, Ami; Ravid, Noam
Published in: OPODIS2018, Issue 1, 2018
Publisher: DROPS
DOI: 10.4230/lipics.opodis.2018.7

Fast Approximate Shortest Paths in the Congested Clique

Author(s): Keren Censor-Hillel, Michal Dory, Janne H. Korhonen, Dean Leitersdorf
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing - PODC '19, 2019, Page(s) 74-83, ISBN 9781-450362177
Publisher: ACM Press
DOI: 10.1145/3293611.3331633

Hardness of Distributed Optimization

Author(s): Nir Bacrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing - PODC '19, 2019, Page(s) 238-247, ISBN 9781-450362177
Publisher: ACM Press
DOI: 10.1145/3293611.3331597

Erasure Correction for Noisy Radio Networks

Author(s): Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz and Goran Zuzic
Published in: DISC2019, 2019
Publisher: DROPS
DOI: 10.4230/lipics.disc.2019.10

Distributed reconfiguration of maximal independent sets

Author(s): Censor-Hillel, Keren; Rabie, Mikaël
Published in: ICALP2019, Issue 1, 2019, ISSN 1868-8969
Publisher: DROPS
DOI: 10.4230/LIPIcs.ICALP.2019.135

Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph

Author(s): Michal Dory, Mohsen Ghaffari
Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing - PODC '19, 2019, Page(s) 521-530, ISBN 9781-450362177
Publisher: ACM Press
DOI: 10.1145/3293611.3331617

Distributed Detection of Cliques in Dynamic Networks

Author(s): Matthias Bonne, Keren Censor-Hillel
Published in: ICALP 2019, 2019, Page(s) 132:1--132:15
Publisher: DROPS
DOI: 10.4230/lipics.icalp.2019.132

Classification of Distributed Binary Labeling Problems

Author(s): Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, Jukka Suomela
Published in: 34th International Symposium on Distributed Computing, 2020, Page(s) 17:1--17:17, ISBN 978-3-95977-168-9
Publisher: "Schloss Dagstuhl--Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.disc.2020.17

Distributed Graph Coloring Made Easy

Author(s): Yannic Maus
Published in: SPAA, Issue 1, 2021
Publisher: ACM
DOI: 10.1145/3409964.3461804

Local Conflict Coloring Revisited: Linial for Lists

Author(s): Maus, Yannic; Tonoyan, Tigran
Published in: Issue 1, 2020
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2007.15251

Efficient CONGEST Algorithms for the Lovasz Local Lemma

Author(s): Maus, Yannic; Uitto, Jara
Published in: Issue 7, 2021
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2108.02638

Exponentially Faster Shortest Paths in the Congested Clique

Author(s): Michal Dory, Merav Parter
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Page(s) 59-68, ISBN 9781450375825
Publisher: ACM
DOI: 10.1145/3382734.3405711

Distributed Approximation on Power Graphs

Author(s): Reuven Bar-Yehuda, Keren Censor-Hillel, Yannic Maus, Shreyas Pai, Sriram V. Pemmaraju
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Page(s) 501-510, ISBN 9781450375825
Publisher: ACM
DOI: 10.1145/3382734.3405750

Distance Computations in the Hybrid Network Model via Oracle Simulations

Author(s): Censor-Hillel, Keren; Leitersdorf, Dean; Polosukhin, Volodymyr
Published in: STACS, Issue 8, 2021
Publisher: "Schloss Dagstuhl - Leibniz-Zentrum f{\""{u}}r Informatik"
DOI: 10.48550/arxiv.2010.13831

Distance-2 Coloring in the CONGEST Model

Author(s): Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus
Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020, Page(s) 233-242, ISBN 9781450375825
Publisher: ACM
DOI: 10.1145/3382734.3405706

Peer reviewed articles (7)

Derandomizing local distributed algorithms under bandwidth restrictions

Author(s): Keren Censor-Hillel, Merav Parter, Gregory Schwartzman
Published in: Distributed Computing, Issue 33/3-4, 2020, Page(s) 349-366, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-020-00376-1

Fast distributed approximation for TAP and 2-edge-connectivity

Author(s): Keren Censor-Hillel, Michal Dory
Published in: Distributed Computing, Issue 33/2, 2020, Page(s) 145-168, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-019-00353-3

Distributed reconfiguration of maximal independent sets

Author(s): Keren Censor-Hillel, Mikaël Rabie
Published in: Journal of Computer and System Sciences, Issue 112, 2020, Page(s) 85-96, ISSN 0022-0000
Publisher: Academic Press
DOI: 10.1016/j.jcss.2020.03.003

The sparsest additive spanner via multiple weighted BFS trees

Author(s): Keren Censor-Hillel, Ami Paz, Noam Ravid
Published in: Theoretical Computer Science, Issue 840, 2020, Page(s) 33-44, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2020.05.035

Fooling views: a new lower bound technique for distributed computations under congestion

Author(s): Amir Abboud, Keren Censor-Hillel, Seri Khoury, Christoph Lenzen
Published in: Distributed Computing, Issue 33/6, 2020, Page(s) 545-559, ISSN 0178-2770
Publisher: Springer Verlag
DOI: 10.1007/s00446-020-00373-4

Smaller Cuts, Higher Lower Bounds

Author(s): Abboud, Amir; Censor-Hillel, Keren; Khoury, Seri; Paz, Ami
Published in: CoRR, Issue 1, 2019, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3469834

Sparse matrix multiplication and triangle listing in the Congested Clique model

Author(s): Keren Censor-Hillel, Dean Leitersdorf, Elia Turner
Published in: Theoretical Computer Science, Issue 809, 2020, Page(s) 45-60, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2019.11.006