Erasure-resilient sublinear-time graph algorithms

被引：0
|
作者：
Levi, Amit [1 ]
Pallavoor, Ramesh Krishnan S. [2 ]
Raskhodnikova, Sofya [2 ]
Varma, Nithin [3 ]
机构：
[1] David R. Cheriton School of Computer Science, University of Waterloo, Canada
[2] Department of Computer Science, Boston University, MA, United States
[3] Department of Computer Science, University of Haifa, Israel
来源：
Leibniz International Proceedings in Informatics, LIPIcs | 2021年 / 185卷
关键词：
Number:; CCF-1909612; Acronym:; CISE; Sponsor: Directorate for Computer and Information Science and Engineering; NSF; Sponsor: National Science Foundation; 497/17; ISF; Sponsor: Israel Science Foundation;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Parameter estimation
引用
收藏
相关论文
共 50 条
  • [21] Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
    Aliakbarpour, Maryam
    Biswas, Amartya Shankha
    Gouleakis, Themis
    Peebles, John
    Rubinfeld, Ronitt
    Yodpinyanee, Anak
    ALGORITHMICA, 2018, 80 (02) : 668 - 697
  • [22] Sublinear-time distributed algorithms for detecting small cliques and even cycles
    Eden, Talya
    Fiat, Nimrod
    Fischer, Orr
    Kuhn, Fabian
    Oshman, Rotem
    DISTRIBUTED COMPUTING, 2022, 35 (03) : 207 - 234
  • [23] Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling
    Maryam Aliakbarpour
    Amartya Shankha Biswas
    Themis Gouleakis
    John Peebles
    Ronitt Rubinfeld
    Anak Yodpinyanee
    Algorithmica, 2018, 80 : 668 - 697
  • [24] Sublinear-time distributed algorithms for detecting small cliques and even cycles
    Talya Eden
    Nimrod Fiat
    Orr Fischer
    Fabian Kuhn
    Rotem Oshman
    Distributed Computing, 2022, 35 : 207 - 234
  • [25] SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing
    Meidiana, Amyra
    Hong, Seok-Hee
    Cai, Shijun
    Torkel, Marnijati
    Eades, Peter
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2024, 30 (07) : 3386 - 3399
  • [26] Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
    Lelarge, Marc
    Zhou, Hang
    THEORETICAL COMPUTER SCIENCE, 2014, 548 : 68 - 78
  • [27] Faster Sublinear-Time Edit Distance
    Bringmann, Karl
    Cassis, Alejandro
    Fischer, Nick
    Kociumaka, Tomasz
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 3274 - 3301
  • [28] Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding
    Pan, Victor Y.
    Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, 2000, : 266 - 271
  • [29] Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
    Lelarge, Marc
    Zhou, Hang
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 141 - 151
  • [30] Asymptotically optimal erasure-resilient codes for large disk arrays
    Chee, YM
    Colbourn, CJ
    Ling, ACH
    DISCRETE APPLIED MATHEMATICS, 2000, 102 (1-2) : 3 - 36
12345