Faster Deterministic Distributed MIS and Approximate Matching

被引：0
|
作者：
Ghaffari, Mohsen [1 ]
Grunau, Christoph [2 ]
机构：
[1] MIT, United States
[2] ETH Zurich, Switzerland
来源：
arXiv | 2023年
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Complex networks
引用
收藏
相关论文
共 50 条
  • [21] Improved deterministic distributed matching via rounding
    Manuela Fischer
    Distributed Computing, 2020, 33 : 279 - 291
  • [22] Improved deterministic distributed matching via rounding
    Fischer, Manuela
    DISTRIBUTED COMPUTING, 2020, 33 (3-4) : 279 - 291
  • [23] Optimal spaced. seeds for faster approximate string matching
    Farach-Colton, M
    Landau, GM
    Sahinalp, SC
    Tsur, D
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 1251 - 1262
  • [24] Faster Deterministic Distributed Coloring Through Recursive List Coloring
    Kuhn, Fabian
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1244 - 1259
  • [25] Faster Deterministic Distributed Coloring Through Recursive List Coloring
    Kuhn, Fabian
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1244 - 1259
  • [26] Communication Complexity of Approximate Matching in Distributed Graphs
    Huang, Zengfeng
    Radunovic, Bozidar
    Vojnovic, Milan
    Zhang, Qin
    32ND INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2015), 2015, 30 : 460 - 473
  • [27] FASTER PARALLEL STRING-MATCHING VIA LARGER DETERMINISTIC SAMPLES
    GOLDBERG, T
    ZWICK, U
    JOURNAL OF ALGORITHMS, 1994, 16 (02) : 295 - 308
  • [28] Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition
    Ghaffari, Mohsen
    Kuhn, Fabian
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 1009 - 1020
  • [29] Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions
    Alman, Josh
    Chan, Timothy M.
    Williams, Ryan
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 637 - 649
  • [30] Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions
    Alman, Josh
    Chan, Timothy M.
    Williams, Ryan
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 637 - 649
12345