Conferences · eligible papers

STOC

2021–2025 確定版

STOC 公式サイト ↗

Algorithms & Complexity

2025 · 219 papers

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

  1. 2025 · STOC

    The Meta-complexity of Secret Sharing

    Benny Applebaum, Oded Nir

    Algorithms & Complexity

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

  2. 2025 · STOC

    The State Hidden Subgroup Problem and an Efficient Algorithm for Locating Unentanglement

    Adam Bouland, Tudor Giurgică-Tiron, John Wright

    Algorithms & Complexity

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

  3. 2025 · STOC

    The Structure of Catalytic Space: Capturing Randomness and Time via Compression

    James Cook, Jiatu Li, Ian Mertz, Edward Pyne

    Algorithms & Complexity

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

  4. 2025 · STOC

    Tight Results for Online Convex Paging

    Anupam Gupta, Amit Kumar, Debmalya Panigrahi

    Algorithms & Complexity

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

  5. 2025 · STOC

    Time and Space Efficient Deterministic Decoders

    Joshua Cook, Dana Moshkovitz

    Algorithms & Complexity

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

  6. 2025 · STOC

    Tolerant Testing of Stabilizer States with a Polynomial Gap via a Generalized Uncertainty Relation

    Zongbo Bao, Philippe van Dordrecht, Jonas Helsen

    Algorithms & Complexity

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

  7. 2025 · STOC

    Tractable Agreement Protocols

    Natalie Collina, Surbhi Goel, Varun Gupta, Aaron Roth

    Algorithms & Complexity

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

  8. 2025 · STOC

    Treewidth Inapproximability and Tight ETH Lower Bound

    Édouard Bonnet

    Algorithms & Complexity

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

  9. 2025 · STOC

    Truly Supercritical Trade-Offs for Resolution, Cutting Planes, Monotone Circuits, and Weisfeiler–Leman

    Susanna F. de Rezende, Noah Fleming, Duri Andrea Janett, Jakob Nordström, Shuo Pang

    Algorithms & Complexity

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

  10. 2025 · STOC

    Unambiguous SNARGs for P from LWE with Applications to PPAD Hardness

    Liyan Chen, Cody Freitag, Zhengzhong Jin, Daniel Wichs

    Algorithms & Complexity

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

  11. 2025 · STOC

    Uncloneable Quantum States Are Necessary as Proofs and Advice

    Rohit Chatterjee, Srijita Kundu, Supartha Podder

    Algorithms & Complexity

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

  12. 2025 · STOC

    Universal SNARGs for NP from Proofs of Correctness

    Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, Surya Mathialagan

    Algorithms & Complexity

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

  13. 2025 · STOC

    Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from Planted Clique and Noisy 𝑘-LIN over Expanders

    Riddhi Ghosal, Isaac M. Hair, Aayush Jain, Amit Sahai

    Algorithms & Complexity

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

  14. 2025 · STOC

    Vanishing of Schubert Coefficients

    Igor Pak, Colleen Robichaux

    Algorithms & Complexity

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

  15. 2025 · STOC

    Vizing’s Theorem in Near-Linear Time

    Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, Tianyi Zhang

    Algorithms & Complexity

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

  16. 2025 · STOC

    Weak Poincaré Inequalities, Simulated Annealing, and Sampling from Spherical Spin Glasses

    Brice Huang, Sidhanth Mohanty, Amit Rajaraman, David X. Wu

    Algorithms & Complexity

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

  17. 2025 · STOC

    Weak Recovery, Hypothesis Testing, and Mutual Information in Stochastic Block Models and Planted Factor Graphs

    Elchanan Mossel, Allan Sly, Youngtak Sohn

    Algorithms & Complexity

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

  18. 2025 · STOC

    When Connectivity Is Hard, Random Walks Are Easy with Non-determinism

    Dean Doron, Edward Pyne, Roei Tell, R. Ryan Williams

    Algorithms & Complexity

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

  19. 2025 · STOC

    Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs

    Itai Boneh, Shiri Chechik, Shay Golan, Shay Mozes, Oren Weimann

    Algorithms & Complexity

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