Paper Review Records
全部论文审稿周期
11 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
172
天
Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations.
作者
Pablo Barceló; Alexander Kozachinskiy; Miguel Romero; Bernardo Subercaseaux; José Verschae展开收起
作者单位
1. Pontifical Catholic University of Chile; 2. National Center for Artificial Intelligence; 3. Carnegie Mellon University展开收起
287
天
379
天
History-Independent Dynamic Partitioning with Applications to B-Trees, Skip Lists and Fusion Trees
作者
Michael Bender; Martin Farach-Colton; Michael Goodrich; Hanna Komlos展开收起
作者单位
1. Stony Brook University; 2. New York University; 3. University of California Irvine; 4. Max Planck Institute for Informatics展开收起
585
天
Witness Generation for Classical JSON Schema
作者
Lyes Attouche; Mohamed-Amine Baazizi; Dario Colazzo; Giorgio Ghelli; Carlo Sartiani; Stefanii Scherzinger展开收起
作者单位
1. Université Paris Dauphine - PSL; 2. Sorbonne Universite, LIP6; 3. LAMSADE, Université Paris Dauphine - PSL; 4. Dipartimento di Informatica, Università di Pisa; 5. Università degli Studi della Basilicata; 6. Universitat Passau展开收起
320
天
Adaptive Set Intersection via Trie Partition Certificates
作者
Diego Arroyuelo; Juan Pablo Castillo; José M. Cazorla展开收起
作者单位
1. Escuela de Ingeniería, Department of Computer Science, Pontificia Universidad Católica de Chile; 2. Instituto Milenio Fundamentos de los Datos; 3. Department of Informatics, Universidad Técnica Federico Santa María - Campus San Joaquín; 4. Department of Informatics, Universidad Técnica Federico Santa María展开收起
365
天
FAQ
ACM TRANSACTIONS ON DATABASE SYSTEMS审稿要多久?
截至2026-11-16,CrushSCI 收录了 ACM TRANSACTIONS ON DATABASE SYSTEMS 的 11 篇完整审稿记录。最快一篇从收稿到录用用了 172 天(Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations.,2026-01-15 收稿,2026-07-06 录用),最慢一篇用了 1183 天;平均 456.5 天,中位数 365 天。
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
