期刊审稿周期图谱
JOURNAL OF THE ACM 期刊封面
← 返回期刊列表

Review Cycle Records

JOURNAL OF THE ACM

ACM 非OA 2026新锐 3区2025中科院 2区 已自动采集 最新完整样本 10 篇 平均 471.9 天

数据更新 2026-07-16 · 完整周期 10 篇 · 日期来源可逐条复核

JOURNAL OF THE ACM已收录10篇完整论文周期样本,平均审稿471.9 天,中位审稿462.5 天。2025中科院2区,非OA,2025发文量43。页面含论文收到日期、录用日期、PDF、DOI和出版社网页溯源入口。

471.9平均天数
462.5中位天数
186最短天数
1,069最长天数
10最新论文
432025发文量

Latest Papers

最新发表论文审稿周期

审稿天数=录用日期-收到日期;保留 PDF/DOI/网页源链接

1,069

Robustly Learning Mixtures of k Arbitrary Gaussians

作者Ainesh Bakshi; Ilias Diakonikolas; He Jia; Daniel Kane; Pravesh Kothari; Santosh Vempala

作者单位1. Carnegie Mellon University; 2. New York University; 3. Computer Sciences, University of Wisconsin Madison; 4. Computer Science, Georgia Institute of Technology; 5. Northwestern University; 6. Computer Science and Engineering, University of California San Diego; 7. Princeton University

PDF源文件 DOI 网页
186

Simulating Time with Square-Root Space

作者Ryan Williams

作者单位1. CSAIL and EECS, Massachusetts Institute of Technology

PDF源文件 DOI 网页
242

Vizing’s Theorem in Near-Linear Time

作者Sepehr Assadi; Soheil Behnezhad; Sayan Bhattacharya; Martin Costa; Shay Solomon; Tianyi Zhang

作者单位1. University of Waterloo; 2. Northeastern University; 3. University of Warwick; 4. Tel Aviv University; 5. State Key Laboratory for Novel Software Technology, Nanjing University

PDF源文件 DOI 网页
313

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams

作者Sepehr Assadi; Soheil Behnezhad; Christian Konrad; Kheeran Naidu; Janani Sundaresan

作者单位1. University of Waterloo Faculty of Mathematics; 2. Northeastern University - Boston Campus; 3. University of Bristol

PDF源文件 DOI 网页
318

Minimizing Weighted Flow Time

作者Alexander Armbruster; Lars Rohwedder; Andreas Wiese

作者单位1. Department of Mathematics, Technical University of Munich; 2. Department of Computer Science, University of Southern Denmark

PDF源文件 DOI 网页
402

Equivalence and Conditional Independence in Atomic Sheaf Logic

作者Alex Simpson

作者单位1. Faculty of Mathematics and Physics, University of Ljubljana; 2. Institute of Mathematics Physics and Mechanics

PDF源文件 DOI 网页
523

A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip

作者Iftach Haitner; Yonatan Karidi-Heller

作者单位1. The Blavatnik School of Computer Science, Tel Aviv University

PDF源文件 DOI 网页
535

Distributed \Delta -Coloring Plays Hide-and-Seek

作者Alkida Balliu; Sebastian Brandt; Fabian Kuhn; Dennis Olivetti

作者单位1. Gran Sasso Science Institute; 2. CISPA Helmholtz Center for Information Security; 3. Department of Computer Science, University of Freiburg

PDF源文件 DOI 网页
593

Approximating Nash Social Welfare by Matching and Local Search

作者Jugal Garg; Edin Husić; Wenzheng Li; László Végh; Jan Vondrák

作者单位1. University of Illinois at Urbana-Champaign; 2. Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, IDSIA; 3. Università della Svizzera italiana; 4. Stanford University; 5. Hertz Chair for Algorithms and Optimization, University of Bonn; 6. Mathematics, London School of Economics and Political Science

PDF源文件 DOI 网页
538

On the Computability of Measures of Regular Sets of Infinite Trees

作者Damian Niwiński; Paweł Parys; Michał Skrzypczak

作者单位1. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw

PDF源文件 DOI 网页