Derandomizing local distributed algorithms under bandwidth restrictions

[1]  K. Censor-Hillel,et al.  Derandomizing local distributed algorithms under bandwidth restrictions , 2020, Distributed Computing.

[2]  Yufan Zheng,et al.  The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation , 2018, PODC.

[3]  Merav Parter.  (Delta+1) Coloring in the Congested Clique Model , 2018, ICALP.

[4]  Tomasz Jurdzinski,et al.  MST in O(1) Rounds of Congested Clique , 2018, SODA.

[5]  Leonid Barenboim,et al.  A fast network-decomposition algorithm and its applications to constant-time distributed computation , 2015, Theor. Comput. Sci..

[6]  Merav Parter.  Randomized ( ∆ + 1 )-Coloring in O ( log ∗ ∆ ) Congested Clique Rounds , 2018 .

[7]  Merav Parter.  (Δ+1) Coloring in the Congested Clique Model , 2018, ArXiv.

[8]  Mohsen Ghaffari.  Distributed MIS via All-to-All Communication , 2017, PODC.

[9]  Leonid Barenboim,et al.  Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks , 2016, J. ACM.

[10]  François Le Gall,et al.  Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems , 2016, DISC.

[11]  Merav Parter,et al.  MST in Log-Star Rounds of Congested Clique , 2016, PODC.

[12]  Tsvi Kopelowitz,et al.  Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model , 2016, FOCS.

[13]  Jukka Suomela,et al.  A lower bound for the distributed Lovász local lemma , 2015, STOC.

[14]  Mohsen Ghaffari,et al.  An Improved Distributed Algorithm for Maximal Independent Set , 2015, SODA.

[15]  Monika Henzinger,et al.  A deterministic almost-tight distributed algorithm for approximating single-source shortest paths , 2015, STOC.

[16]  Christoph Lenzen,et al.  Algebraic methods in the congested clique , 2015, Distributed Computing.

[17]  Roger Wattenhofer,et al.  Local Computation , 2010, J. ACM.

[18]  Barenboim Leonid.  Deterministic (.DELTA. + 1)-Coloring in Sublinear (in .DELTA.) Time in Static, Dynamic, and Faulty Networks , 2016 .

[19]  Leonid Barenboim.  Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic and Faulty Networks , 2015, PODC.

[20]  Sriram V. Pemmaraju,et al.  Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST , 2015, PODC.

[21]  Pierre Fraigniaud,et al.  Randomized Local Network Computing , 2015, SPAA.

[22]  Leonid Barenboim,et al.  A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation - (Extended Abstract) , 2015, SIROCCO.

[23]  Stephan Holzer,et al.  Approximation of Distances and Shortest Paths in the Broadcast Congest Clique , 2014, OPODIS.

[24]  Sriram V. Pemmaraju,et al.  Lessons from the Congested Clique applied to MapReduce , 2015, Theor. Comput. Sci..

[25]  Sriram V. Pemmaraju,et al.  Near-Constant-Time Distributed Algorithms on a Congested Clique , 2014, DISC.

[26]  Fabian Kuhn,et al.  On the power of the congested clique model , 2014, PODC.

[27]  Danupon Nanongkai,et al.  Distributed approximation algorithms for weighted shortest paths , 2014, STOC.

[28]  F. Kuhn,et al.  Distributed (Delta+1)-Coloring in Linear (in Delta) Time , 2008, SIAM J. Comput..

[29]  Leonid Barenboim,et al.  Distributed Graph Coloring: Fundamentals and Recent Developments , 2013, Distributed Graph Coloring: Fundamentals and Recent Developments.

[30]  Jukka Suomela,et al.  Survey of local algorithms , 2013, CSUR.

[31]  Christoph Lenzen,et al.  Optimal deterministic routing and sorting on the congested clique , 2012, PODC '13.

[32]  Leonid Barenboim,et al.  The Locality of Distributed Symmetry Breaking , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[33]  Christoph Lenzen,et al.  "Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract) , 2012, DISC.

[34]  I. Benjamini,et al.  On K-wise Independent Distributions and Boolean Functions , 2012, 1201.3261.

[35]  Salil P. Vadhan,et al.  Pseudorandomness , 2012, Found. Trends Theor. Comput. Sci..

[36]  Roger Wattenhofer,et al.  Tight bounds for parallel randomized load balancing: extended abstract , 2011, STOC '11.

[37]  Boaz Patt-Shamir,et al.  The round complexity of distributed sorting: extended abstract , 2011, PODC '11.

[38]  David Peleg,et al.  Distributed verification and hardness of distributed approximation , 2010, STOC '11.

[39]  Karthekeyan Chandrasekaran,et al.  Deterministic algorithms for the Lovász Local Lemma , 2009, SODA '10.

[40]  Bilel Derbel,et al.  Sublinear Fully Distributed Partition with Applications , 2010, Theory of Computing Systems.

[41]  Bilel Derbel,et al.  Local Computation of Nearly Additive Spanners , 2009, DISC.

[42]  Leonid Barenboim,et al.  Distributed (δ+1)-coloring in linear (in δ) time , 2009, STOC '09.

[43]  Seth Pettie.  Distributed algorithms for ultrasparse spanners and linear size skeletons , 2009, Distributed Computing.

[44]  Bilel Derbel,et al.  On the locality of distributed sparse spanner construction , 2008, PODC '08.

[45]  Bilel Derbel,et al.  Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time , 2007, DISC.

[46]  Sandeep Sen,et al.  A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs , 2007, Random Struct. Algorithms.

[47]  Michael Elkin,et al.  A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners , 2006, PODC '07.

[48]  Anand Srivastav,et al.  Parallel Algorithms via the Probabilistic Method , 2007, Handbook of Parallel Computing.

[49]  Bilel Derbel,et al.  Fast deterministic distributed algorithms for sparse spanners , 2008, Theor. Comput. Sci..

[50]  Mikkel Thorup,et al.  Deterministic Constructions of Approximate Distance Oracles and Spanners , 2005, ICALP.

[51]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[52]  Michael Elkin,et al.  Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem , 2004, STOC '04.

[53]  Michael Elkin,et al.  A faster distributed protocol for constructing a minimum spanning tree , 2004, SODA '04.

[54]  Boaz Patt-Shamir,et al.  MST construction in O(log log n) communication rounds , 2003, SPAA '03.

[55]  Sriram V. Pemmaraju,et al.  Equitable colorings extend Chernoff-Hoeffding bounds , 2001, SODA '01.

[56]  David Peleg,et al.  A near-tight lower bound on the time complexity of distributed MST construction , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[57]  Aravind Srinivasan,et al.  On the Complexity of Distributed Network Decomposition , 1996, J. Algorithms.

[58]  Yijie Han.  A Fast Derandomization Scheme and Its Applications , 1996, SIAM J. Comput..

[59]  Aravind Srinivasan,et al.  Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.

[60]  Moni Naor,et al.  What can be computed locally? , 1993, STOC.

[61]  Aravind Srinivasan,et al.  Improved distributed algorithms for coloring and network decomposition problems , 1992, STOC '92.

[62]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[63]  Bonnie Berger,et al.  Simulating (logcn)-wise independence in NC , 1991, JACM.

[64]  Paul G. Spirakis,et al.  Fast Parallel Approximations of hte Maximum Weighted Cut Problem through Derandomization , 1989, FSTTCS.

[65]  Andrew V. Goldberg,et al.  Network decomposition and locality in distributed computation , 1989, 30th Annual Symposium on Foundations of Computer Science.

[66]  Moni Naor,et al.  The probabilistic method yields deterministic parallel algorithms , 1989, 30th Annual Symposium on Foundations of Computer Science.

[67]  M. Luby.  Removing randomness in parallel computation without a processor penalty , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[68]  Mark K. Goldberg,et al.  A new parallel algorithm for the maximal independent set problem , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[69]  Richard Cole,et al.  Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking , 2018, Inf. Control..

[70]  Alon Itai,et al.  A Fast and Simple Randomized Parallel Algorithm for Maximal Matching , 1986, Inf. Process. Lett..

[71]  Noga Alon,et al.  A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.

[72]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[73]  Richard M. Karp,et al.  A fast parallel algorithm for the maximal independent set problem , 1984, STOC '84.

[74]  L. Lovász.  Combinatorial problems and exercises , 1979 .