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 条
  • [1] Erasure-Resilient Sublinear-Time Graph Algorithms
    Levi, Amit
    Pallavoor, Ramesh Krishnan S.
    Raskhodnikova, Sofya
    Varma, Nithin
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2022, 14 (01)
  • [2] SUBLINEAR-TIME ALGORITHMS
    Woeginger, Gerhard J.
    Czumaj, Artur
    Sohler, Christian
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2006, (89): : 23 - 47
  • [3] Sublinear-time Algorithms
    Czumaj, Artur
    Sohler, Christian
    PROPERTY TESTING: CURRENT RESEARCH AND SURVEYS, 2010, 6390 : 41 - +
  • [4] Sublinear-time Algorithms for Stress Minimization in Graph Drawing
    Meidiana, Amyra
    Wood, James
    Hong, Seok-Hee
    2021 IEEE 14TH PACIFIC VISUALIZATION SYMPOSIUM (PACIFICVIS 2021), 2021, : 166 - 175
  • [5] Sublinear-time algorithms for tournament graphs
    Dantchev, Stefan
    Friedetzky, Tom
    Nagel, Lars
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (03) : 469 - 481
  • [6] On derandomizing probabilistic sublinear-time algorithms
    Zimand, Marius
    TWENTY-SECOND ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2007, : 1 - +
  • [7] Combinatorial Sublinear-Time Fourier Algorithms
    M. A. Iwen
    Foundations of Computational Mathematics, 2010, 10 : 303 - 338
  • [8] Sublinear-Time Algorithms for Tournament Graphs
    Dantchev, Stefan
    Friedetzky, Tom
    Nagel, Lars
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 459 - 471
  • [9] Sublinear-time algorithms for tournament graphs
    Stefan Dantchev
    Tom Friedetzky
    Lars Nagel
    Journal of Combinatorial Optimization, 2011, 22 : 469 - 481
  • [10] Combinatorial Sublinear-Time Fourier Algorithms
    Iwen, M. A.
    FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2010, 10 (03) : 303 - 338
12345