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

    ACM-SIAM Symposium on Discrete Algorithms

    ConferenceCCF 计算机科学理论 A

    年发文量

    研究主题

    论文(5034)

    排序
    1Improving Algorithmic Efficiency Using Cryptography: Trapdoored Matrices and Applications.
    Vinod Vaikuntanathan, Or Zamir
    2026引用:3
    引用
    AI阅读
    加入学术空间
    2Fair Division Beyond Monotone Valuations with Applications to Equitable Graph Partitioning.
    Siddharth Barman,Paritosh Verma
    2026引用:2
    引用
    AI阅读
    加入学术空间
    3An Optimal Online Algorithm for Robust Flow Time Scheduling.
    Anupam Gupta,Amit Kumar,Debmalya Panigrahi, Zhaozi Wang
    2026引用:2
    引用
    AI阅读
    加入学术空间
    4Helly-Type Theorems for Splitting Point Sets.
    Lidor Portal,Natan Rubin

    Let 0 < α≤ 1/2. We say that a finite point set P in ℝ^d is α-split by a hyperplane h if each of the closed half-spaces determined by h, contains at least α|P| of the points of P. We further say P is α-split by a k-dimensional flat τ if P is α-split by any hyperplane through τ. In the standard notation (which coincides with Tukey depth for k= 0), the k-flat τ has depth α with respect to P. We establish interesting Helly-type theorems for splitting families of finite point sets in ℝ^d. Unlike the classical sufficient Helly-type criteria for transversals to families of compact convex sets, which exist only for point and hyperplanes, our results extend to splitting families of point sets by collections of k-flats of arbitrary dimensionality 0 ≤ k ≤ d-1.

    2026
    引用
    AI阅读
    加入学术空间
    5Long Arithmetic Progressions in Sparse Subset Sums: A Computational Perspective.
    Lin Chen,Yuchen Mao,Guochuan Zhang
    2026引用:2
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 5034 篇论文

    高被引作者

    作者引用发文
    Jon Kleinberg130649
    David Mount557316
    S. Muthu Muthukrishnan550125
    Sunil Arya502713
    A. Ruciński47972
    Piotr Indyk472040
    Nathan Netanyahu41464
    R. Silverman41153
    Andrew V. Goldberg395415
    Udi Manber35681

    高产作者

    作者引用发文
    Anupam Gupta254352
    Saket Saurabh153944
    Daniel Lokshtanov161644
    MohammadTaghi HajiAghayi245944
    Sanjeev Khanna288542
    Timothy M. Chan174141
    Uri Zwick256240
    Piotr Indyk472040
    Pankaj K. Agarwal224140
    Venkatesan Guruswami222337

    相关期刊

    ACM Transactions on Algorithms
    Electronic Colloquium on Computational Complexity
    Symposium on the Theory of Computing
    Computational Complexity Conference
    IEEE Annual Symposium on Foundations of Computer Science
    International Colloquium on Automata, Languages and Programming
    Information Technology and Computer Science
    SIAM Journal on Computing
    arXiv: Data Structures and Algorithms
    Foundations of Computer Science