期刊审稿周期图谱
DISTRIBUTED COMPUTING 期刊封面
← 返回期刊列表

Review Cycle Records

DISTRIBUTED COMPUTING

Springer 非OA 2026新锐 4区2025中科院 4区 已自动采集 最新完整样本 10 篇 平均 421.9 天

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

DISTRIBUTED COMPUTING已收录10篇完整论文周期样本,平均审稿421.9 天,中位审稿398.5 天。2025中科院4区,非OA,2025发文量20。页面含论文收到日期、录用日期、PDF、DOI和出版社网页溯源入口。

421.9平均天数
398.5中位天数
197最短天数
749最长天数
10最新论文
202025发文量

Latest Papers

最新发表论文审稿周期

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

432

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

PDF源文件 DOI 网页
566

A topological characterization of stabilizing consensus

作者Ulrich Schmid; Stephan Felber; Hugo Rincon Galeana

作者单位1. Embedded Computing Systems Group E191-02, TU Wien, Vienna, Austria; 2. Internet Architecture and Management, TU Berlin, Berlin, Germany

PDF源文件 DOI 网页
670

Satrapy: From abstract to practical consensus for heterogeneous quorum systems

作者Xiao Li; Eric M. Chan; Mohsen Lesani

作者单位1. BCOE, University of California, Riverside, Riverside, USA; 2. BSE, University of California, Santa Cruz, Santa Cruz, USA

PDF源文件 DOI 网页
271

Polylogarithmic time algorithms for shortest path forests in programmable matter

作者Andreas Padalkin; Christian Scheideler

作者单位1. Department of Computer Science, Paderborn University, Paderborn, Germany

PDF源文件 DOI 网页
365

Connectivity Labeling in Faulty Colored Graphs

作者Asaf Petruschka; Shay Sapir; Elad Tzalik

作者单位1. Weizmann Institute, Rehovot, Israel

PDF源文件 DOI 网页
508

Improved all-pairs approximate shortest paths in congested clique

作者Hong Duc Bui; Shashwat Chandra; Yi-Jun Chang; Michal Dory; Dean Leitersdorf

作者单位1. National University of Singapore, Singapore, Singapore; 2. University of Haifa, Haifa, Israel

PDF源文件 DOI 网页
197

Content-oblivious leader election on rings

作者Fabian Frei; Ran Gelles; Ahmed Ghazy; Alexandre Nolin

作者单位1. CSAIL, Massachusetts Institute of Technology, Cambridge, United States of America; 2. Faculty of Engineering, Bar-Ilan University, Ramat Gan, Israel; 3. CISPA Helmholtz Center for Information Security, Saarbrücken, Germany; 4. Saarland University, Saarbrücken, Germany

PDF源文件 DOI 网页
212

Universal pattern formation by oblivious robots under sequential schedulers

作者Paola Flocchini; Alfredo Navarra; Debasish Pattanayak; Francesco Piselli; Nicola Santoro

作者单位1. School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Canada; 2. Department of Mathematics and Computer Science, University of Perugia, Perugia, Italy; 3. Department of Computer Science and Engineering, Indian Institute of Technology Indore, Indore, India; 4. School of Computer Science, Carleton University, Ottawa, Canada

PDF源文件 DOI 网页
249

Gathering teams of bounded memory agents on a line

作者Younan Gao; Andrzej Pelc

作者单位1. Department of Computer Science, University of Milano-Bicocca, Milan, Italy; 2. Départment d’Informatique, Université du Québec en Outaouais, Gatineau, Canada

PDF源文件 DOI 网页
749

Distributed MIS in O (log log n ) Awake Complexity

作者Fabien Dufoulon; William K. Moses Jr.; Gopal Pandurangan

作者单位1. School of Computing and Communications, Lancaster University, Lancaster, UK; 2. Department of Computer Science, Durham University, Durham, UK; 3. Department of Computer Science, University of Houston, Houston, USA

PDF源文件 DOI 网页