Showing 1–20 of 25 results
/ Date/ Name
Dec 10, 2021Collecting Coupons is Faster with FriendsFeb 14, 2021Communication-Efficient Distributed Optimization with Quantized PreconditionersOct 27, 2021Distributed Principal Component Analysis with Limited CommunicationMar 27, 2023Optimal Message-Passing with Noisy BeepsMar 29, 2023Uniting General-Graph and Geometric-Based Radio Networks via Independence Number ParametrizationFeb 8, 2023Parallel Derandomization for ColoringApr 18, 2019SPONGE: A generalized eigenproblem for clustering signed networksFeb 21, 2020New Bounds For Distributed Mean Estimation and Variance ReductionDec 11, 2019Graph Sparsification for Derandomizing Massively Parallel Computation with Low SpaceAug 18, 2022Improved Distributed Algorithms for the Lovász Local Lemma and Edge ColoringJun 2, 2015Deterministic Communication in Radio NetworksMay 22, 2015Communicating with BeepsMay 22, 2015Leader Election in Multi-Hop Radio NetworksDec 10, 2021Improved Deterministic $(Δ+1)$-Coloring in Low-Space MPCMar 6, 2017Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio NetworksSep 13, 2020Simple, Deterministic, Constant-Round Coloring in the Congested CliqueJun 3, 2021Component Stability in Low-Space Massively Parallel ComputationMay 13, 2018Deterministic Blind Radio NetworksMay 13, 2018Randomized Communication Without Network KnowledgeOct 27, 2019Asynchronous Decentralized SGD with Quantized and Local Updates