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 条
  • [41] Sublinear-time approximation for clustering via random sampling
    Czumaj, A
    Sohler, C
    AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 396 - 407
  • [42] Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables
    Choi, Bosu
    Iwen, Mark A.
    Krahmer, Felix
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2021, 21 (02) : 275 - 329
  • [43] A SUBLINEAR-TIME RANDOMIZED APPROXIMATION ALGORITHM FOR MATRIX GAMES
    GRIGORIADIS, MD
    KHACHIYAN, LG
    OPERATIONS RESEARCH LETTERS, 1995, 18 (02) : 53 - 58
  • [44] Sublinear Graph Approximation Algorithms
    Onak, Krzysztof
    PROPERTY TESTING: CURRENT RESEARCH AND SURVEYS, 2010, 6390 : 158 - 166
  • [45] Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables
    Bosu Choi
    Mark A. Iwen
    Felix Krahmer
    Foundations of Computational Mathematics, 2021, 21 : 275 - 329
  • [46] Multiscale Matrix Sampling and Sublinear-Time PageRank Computation
    Borgs, Christian
    Brautbar, Michael
    Chayes, Jennifer
    Teng, Shang-Hua
    INTERNET MATHEMATICS, 2014, 10 (1-2) : 20 - 48
  • [47] A Sublinear-Time Quantum Algorithm for Approximating Partition Functions
    Cornelissen, Arjan
    Hamoudi, Yassine
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 1245 - 1264
  • [48] Sublinear-time approximation of Euclidean minimum spanning tree
    Czumaj, A
    Ergün, F
    Fortnow, L
    Magen, A
    Newman, I
    Rubinfeld, R
    Sohler, C
    PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 813 - 822
  • [49] Sublinear-Time Mutual Visibility for Fat Oblivious Robots
    Poudel, Pavan
    Sharma, Gokarna
    Aljohani, Aisha
    ICDCN '19: PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING AND NETWORKING, 2019, : 238 - 247
  • [50] Improved Sublinear-Time Edit Distance for Preprocessed Strings
    Bringmann, Karl
    Cassis, Alejandro
    Fischer, Nick
    Nakos, Vasileios
    Leibniz International Proceedings in Informatics, LIPIcs, 2022, 229
12345