Paper Review Records
全部论文审稿周期
15 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
505
天
295
天
A Nonsmooth Extension of the Brezzi-Rappaz-Raviart Approximation Theorem Via Metric Regularity Techniques and Applications to Nonlinear PDEs
作者
Jules Berry; Olivier Ley; Francisco J. Silva展开收起
作者单位
1. Université Paris-Saclay, CNRS, CentraleSupélec, Laboratoire des signaux et systèmes, Gif-sur-Yvette, France; 2. Univ Rennes, INSA, CNRS, IRMAR - UMR 6625, Rennes, France; 3. Laboratoire XLIM, Université de Limoges, Limoges, France展开收起
280
天
470
天
217
天
Conley–Morse Persistence Barcode: A Homological Signature of Combinatorial Bifurcations
作者
Tamal K. Dey; Michał Lipiński; Manuel Soriano-Trigueros展开收起
作者单位
1. Purdue University, West Lafayette, USA; 2. Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria; 3. Universidad de Sevilla, Seville, Spain展开收起
282
天
First-Order Optimality Conditions for Non-Commutative Optimization Problems
作者
Mateus Araújo; Igor Klep; Andrew J. P. Garner; Tamás Vértesi; Miguel Navascués展开收起
作者单位
1. Departamento de Física Teórica, Atómica y Óptica, Laboratory for Disruptive Interdisciplinary Science (LaDIS), Universidad de Valladolid, Valladolid, Spain; 2. Faculty of Mathematics and Physics, University of Ljubljana, Ljubljana, Slovenia; 3. Famnit, University of Primorska, Koper, Slovenia; 4. Institute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia; 5. Institute for Quantum Optics and Quantum Information (IQOQI) Vienna, Austrian Academy of Sciences, Wien, Austria; 6. HUN-REN Institute for Nuclear Research, Debrecen, Hungary展开收起
FAQ
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS审稿要多久?
截至2026-11-16,CrushSCI 收录了 FOUNDATIONS OF COMPUTATIONAL MATHEMATICS 的 15 篇完整审稿记录。最快一篇从收稿到录用用了 217 天(Conley–Morse Persistence Barcode: A Homological Signature of Combinatorial Bifurcations,2025-08-29 收稿,2026-04-03 录用),最慢一篇用了 644 天;平均 394.8 天,中位数 392 天。
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。
