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 条
  • [1] Faster Deterministic Distributed MIS and Approximate Matching
    Ghaffari, Mohsen
    Grunau, Christoph
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1777 - 1790
  • [2] Faster Approximate String Matching
    R. Baeza-Yates and G. Navarro
    Algorithmica, 1999, 23 : 127 - 158
  • [3] Faster approximate string matching
    BaezaYates, R
    Navarro, G
    ALGORITHMICA, 1999, 23 (02) : 127 - 158
  • [4] DISTRIBUTED APPROXIMATE MATCHING
    Lotker, Zvi
    Patt-Shamir, Boaz
    Rosen, Adi
    SIAM JOURNAL ON COMPUTING, 2009, 39 (02) : 445 - 460
  • [5] Distributed Approximate Matching
    Lotker, Zvi
    Patt-Shamir, Boaz
    Rosen, Adi
    PODC'07: PROCEEDINGS OF THE 26TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2007, : 167 - 174
  • [6] Faster Filters for Approximate String Matching
    Karkkainen, Juha
    Na, Joong Chae
    PROCEEDINGS OF THE NINTH WORKSHOP ON ALGORITHM ENGINEERING AND EXPERIMENTS AND THE FOURTH WORKSHOP ON ANALYTIC ALGORITHMICS AND COMBINATORICS, 2007, : 84 - 90
  • [7] Approximate string matching: A simpler faster algorithm
    Cole, R
    Hariharan, R
    SIAM JOURNAL ON COMPUTING, 2002, 31 (06) : 1761 - 1782
  • [8] Faster Approximate String Matching for Short Patterns
    Philip Bille
    Theory of Computing Systems, 2012, 50 : 492 - 515
  • [9] Faster Approximate String Matching for Short Patterns
    Bille, Philip
    THEORY OF COMPUTING SYSTEMS, 2012, 50 (03) : 492 - 515
  • [10] Faster Approximate Pattern Matching: A Unified Approach
    Charalampopoulos, Panagiotis
    Kociumaka, Tomasz
    Wellnitz, Philip
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 978 - 989