计算机科学
Paper Review Records
全部论文审稿周期
17 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期;保留 PDF/DOI/网页源链接
On the notions of bounded bypass, and how to make any deadlock-free MUTEX protocol satisfy one of them
作者Rob van Glabbeek; Daniele Gorla; Myrthe Spronck
作者单位1. School of Informatics, University of Edinburgh, Edinburgh, UK; 2. School of Computer Science and Engineering, University of New South Wales, Sydney, Australia; 3. Dept. of Computer Science, Sapienza University of Rome, Rome, Italy; 4. Dept. of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
Non-uniform content-oblivious leader election in 2-edge-connected networks
作者Jérémie Chalopin; Yi-Jun Chang; Lyuting Chen; Giuseppe A. Di Luna; Haoran Zhou
作者单位1. CNRS, LIS, Aix-Marseille University, Marseille, France; 2. National University of Singapore, Singapore, Singapore; 3. DIAG, Sapienza University of Rome, Rome, Italy
Time-optimal self-stabilizing leader election in population protocols
作者Janna Burman; Ho-Lin Chen; Hsueh-Ping Chen; David Doty; Thomas Nowak; Eric Severson; Chuan Xu
作者单位1. Université Paris-Saclay, CNRS, Orsay, France; 2. National Taiwan University, Taipei, Taiwan; 3. University of California, Davis, Davis, USA; 4. Université Paris-Saclay, CNRS, ENS Paris-Saclay, Gif-sur-Yvette, France; 5. Institut Universitaire de France, Paris, France; 6. Inria Sophia-Antipolis, Valbonne, France
Memory lower bounds and impossibility results for anonymous dynamic broadcast
作者Garrett Parzych; Joshua J. Daymude
作者单位1. School of Computing and Augmented Intelligence, Arizona State University, Tempe, USA; 2. Biodesign Center for Biocomputing, Security and Society, Arizona State University, Tempe, USA
Expert Matching · Case Demo
把投稿要求,转成可验证的期刊方案
说清专业、时限和作者背景,CrushSCI 结合真实审稿样本,给出拟题方向、期刊初筛与周期判断。