• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    International Colloquium on Automata, Languages and Programming

    International Colloquium on Automata, Languages and Programming

    ConferenceCCF 计算机科学理论 B

    年发文量

    研究主题

    论文(5272)

    排序
    1Persistence Meets Resistance: Doubling Down on Hardness.
    Benedikt Kolbe, Tim Mayr

    We present results on the approximate computation of stable invariants for filtrations of finite metric spaces in the context of persistent homology. We establish novel approximation algorithms in the setting of n-point metric spaces where the growth of the doubling dimension is in o(log n) and the diameter is bounded. In the 1-parameter case, by revisiting known techniques (greedy permutations) in a new way, we derive the first linear-time algorithms for the problem of computing additive ε-approximations of any stable barcode. By deriving bounds on the convergence rate and the approximation quality of uniform samples, we extend the approach to selected multiparameter filtrations. We show that for normalized measure bifiltrations, including the multicover and subdivision-Rips bifiltration, any stable invariant can be probabilistically approximated in time constant in n. The constants in the running times of our algorithms depend on the doubling dimension, the diameter and the success probability. We further study the problem through the lens of fine-grained complexity and show that computing the rank of a matrix reduces to that of approximating the barcode of the Vietoris–Rips or Čech filtration. We present two variants of the reduction, one for sufficiently good additive approximations and the other for any constant factor multiplicative approximations.

    2026
    引用
    AI阅读
    加入学术空间
    2Back in the Saddle: Toward Parallel Approximate Minimum-Cost Flow.
    Rasmus Kyng, Aurelio L. Sulser
    2026
    引用
    AI阅读
    加入学术空间
    3Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane.
    Timothy M. Chan,Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, Da Wei Zheng
    2026引用:2
    引用
    AI阅读
    加入学术空间
    4Revisiting Finiteness of Matrix Monoids.
    Rida Ait El Manssour, Roland Guttenberg, Nathan Lhote,Mahsa Shirmohammadi, James B. Worrell
    2026引用:1
    引用
    AI阅读
    加入学术空间
    5Partially-Dynamic Maximum Flow in Dense Graphs.
    Egor Kravchenko, Maximilian Probst Gutenberg
    2026引用:1
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 5272 篇论文

    高被引作者

    作者引用发文
    Matthew Hennessy357812
    Dexter Kozen33849
    Robin Milner32686
    Christos Papadimitriou321715
    Tommaso Toffoli23012
    Moses Charikar22467
    Zohar Manna219810
    Mihalis Yannakakis207722
    Martin Farach20682
    Kurt Mehlhorn202226

    高产作者

    作者引用发文
    James Worrell70333
    Daniel Lokshtanov79026
    Kurt Mehlhorn202226
    Saket Saurabh82826
    Virginia Vassilevska Williams61924
    Leslie Ann Goldberg54023
    Fedor V. Fomin94423
    Mihalis Yannakakis207722
    Paul Spirakis87322
    Dániel Marx55121

    相关期刊

    ACM Transactions on Computation Theory
    ACM Transactions on Algorithms
    Electronic Colloquium on Computational Complexity
    Symposium on Theoretical Aspects of Computer Science
    Computational Complexity Conference
    European Symposium on Algorithms
    Foundations of Software Technology and Theoretical Computer Science
    International Symposium on Mathematical Foundations of Computer Science
    SIAM Journal on Computing
    ACM-SIAM Symposium on Discrete Algorithms