Showing 1–20 of 37 results
/ Date/ Name
Feb 8, 2023Parallel Derandomization for ColoringAug 26, 2020Haystack Hunting Hints and Locker Room CommunicationNov 9, 2020Streaming Algorithms for Geometric Steiner ForestJul 11, 2017Round Compression for Parallel Matching AlgorithmsJun 21, 2023Optimal (degree+1)-Coloring in Congested CliqueJul 23, 2010Finding Cycles and Trees in Sublinear TimeFeb 16, 2022Near-Shortest Path Routing in Hybrid Communication NetworksSep 23, 2019A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)Aug 26, 2021On Truly Parallel Time in Population ProtocolsJul 8, 2014Planar Graphs: Random Walks and Bipartiteness TestingSep 13, 2020Simple, Deterministic, Constant-Round Coloring in the Congested CliqueAug 9, 2021Deterministic Massively Parallel ConnectivityJun 3, 2021Component Stability in Low-Space Massively Parallel ComputationJul 3, 2018Detecting cliques in CONGEST networksMay 13, 2018Deterministic Blind Radio NetworksMay 13, 2018Randomized Communication Without Network KnowledgeJul 11, 2014Approximate well-supported Nash equilibria in symmetric bimatrix gamesApr 13, 2015Testing Cluster Structure of GraphsDec 8, 2025Property Testing of Computational NetworksJul 10, 2018Online Facility Location with Deletions