Conferences · eligible papers

STOC

2022–2026 LIVE

STOC 公式サイト ↗

Algorithms & Complexity

2026 · 211 papers

このEditionに反映済みのmain full research papersのみ掲載しています。著者リンクは日本の大学への著者別所属根拠がある場合に限ります。

  1. 2026 · STOC

    The Sample Complexity of Replicable Realizable PAC Learning

    Kasper Green Larsen, Markus Engelund Mathiasen, Chirag Pabbaraju, Clement Svendsen

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  2. 2026 · STOC

    The Sample Complexity of Uniform Approximation for Multi-dimensional CDFs and Fixed-Price Mechanisms

    Matteo Castiglioni, Anna Lunghi, Alberto Marchesi

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  3. 2026 · STOC

    The Skolem Problem in Rings of Positive Characteristic

    Ruiwen Dong, Doron Shafrir

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  4. 2026 · STOC

    The Weak Rank Principle: Lower Bounds and Applications

    Michal Garlík, Svyatoslav Gryaznov, Hanlin Ren, Iddo Tzameret

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  5. 2026 · STOC

    Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling

    Karl Bringmann, Anita Dürr, Karol Węgrzycki

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  6. 2026 · STOC

    Toward Optimal Approximations for Resource-Minimization for Fire Containment on Trees and Non-uniform k-Center

    Jannis Blauth, Christian Nöbel, Rico Zenklusen

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  7. 2026 · STOC

    Trust Region Interior Point Methods: Optimal ℓ₂- and Faster Wide-Neighborhood Path Following

    Daniel Dadush, Haoyuan Ma, Bento Natura, László A. Végh

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  8. 2026 · STOC

    Tâtonnement Dynamics for Fisher Markets with Chores

    Bhaskar Ray Chaudhury, Christian Kroer, Ruta Mehta, Tianlong Nan

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  9. 2026 · STOC

    Universe Reduction for APSP: Equivalence of Three Fine-Grained Hypotheses

    Nick Fischer

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  10. 2026 · STOC

    What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing

    Lélia Blin, Fedor V. Fomin, Pierre Fraigniaud, Sylvain Gay, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)

  11. 2026 · STOC

    Zero-Free Regions and Concentration Inequalities for Hypergraph Colorings in the Local Lemma Regime

    Jingcheng Liu, Yixiao Yu

    Algorithms & Complexity

    日本大学: 関与なし(対象大学)