Skip to main content

The cost of limited communication bandwidth in distributed computing

Searching for OpenAIRE data...

Publications

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
DOI: 10.4230/lipics.disc.2020.33

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
DOI: 10.1145/3382734.3405702

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
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
DOI: 10.1145/3382734.3404504

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
DOI: 10.4230/lipics.disc.2020.16

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
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
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
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
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
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
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
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
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
DOI: 10.4230/lipics.disc.2020.17

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
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
DOI: 10.1145/3382734.3405750

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
DOI: 10.1145/3382734.3405706

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
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
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
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
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
DOI: 10.1007/s00446-020-00373-4

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
DOI: 10.1016/j.tcs.2019.11.006