Academic Journal
Q2Distributed Computing
About Distributed Computing
Distributed Computing is a scholarly journal published by Springer Verlag. SCImago 2025 lists it in Q2, with an SJR of 0.499 and H-index of 54.
Coverage: 1986-2026. Research categories: Computational Theory and Mathematics (Q2); Computer Networks and Communications (Q2); Hardware and Architecture (Q2); Theoretical Computer Science (Q3).
Source-backed journal facts
Topics in published research
Legal and Regulatory Analysis; Linguistic, Cultural, and Literary Studies; Military Technology and Strategies; Distributed systems and fault tolerance; Optimization and Search Problems; Parallel Computing and Optimization Techniques.
OpenAlex classifies topics from published works. These topics are not the publisher’s official aims and scope.
Reported open-access list prices
3,490.00 USD; 2,790.00 EUR; 2,490.00 GBP
APC list prices reported by OpenAlex, which obtains this information from DOAJ. Confirm current charges, taxes, waivers and eligibility with the publisher; this is not a fee quotation.
Source: OpenAlex source record. Retrieved 2026-10-03. Source record updated 2026-10-02. OpenAlex metrics are different from SCImago metrics and the Clarivate Journal Impact Factor.
Journal Metrics
Quartile, SJR and the listed SCImago H-index use the 2025 imported SCImago dataset. A quartile may vary by subject category. Values without a source or reporting year are unverified historical entries. Verify the current Journal Impact Factor with Clarivate or the publisher before using it.
Aims & Scope
The publisher’s official aims and scope have not yet been verified for this profile. Use the journal website to check subject fit and accepted article types before submitting.
Recent Research Articles
Latest publications matched automatically by ISSN.
Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
Rex Fernando, Yuval Gelles, Ilan Komargodski
2026-12 · DOI: 10.1007/s00446-026-00519-wApproach of agents with restricted fuel tanks
Adam Ganczorz, Tomasz Jurdzinski, Andrzej Pelc, Grzegorz Stachowiak et al.
2026-12 · DOI: 10.1007/s00446-026-00518-xOn 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
2026-09 · DOI: 10.1007/s00446-026-00512-3Non-uniform content-oblivious leader election in 2-edge-connected networks
Jérémie Chalopin, Yi-Jun Chang, Lyuting Chen, Giuseppe A. Di Luna et al.
2026-09 · DOI: 10.1007/s00446-026-00517-yExploration on highly dynamic graphs
Ashish Saxena, Kaushik Mondal
2026-09 · DOI: 10.1007/s00446-026-00516-zDemand-aware plane Spanners of Bounded Degree
Esra Ceylan, Klaus-Tycho Foerster, Stefan Schmid, Katsiaryna Zaitsava et al.
2026-09 · DOI: 10.1007/s00446-026-00513-2Optimal simultaneous Byzantine Agreement, common knowledge and limited information exchange
Ron van der Meyden
2026-09 · DOI: 10.1007/s00446-026-00514-1Time-optimal self-stabilizing leader election in population protocols
Janna Burman, Ho-Lin Chen, Hsueh-Ping Chen, David Doty et al.
2026-09 · DOI: 10.1007/s00446-026-00509-yTeam formation and applications
Yuval Emek, Shay Kutten, Ido Rafael, Gadi Taubenfeld et al.
2026-09 · DOI: 10.1007/s00446-026-00510-5Memory lower bounds and impossibility results for anonymous dynamic broadcast
Garrett Parzych, Joshua J. Daymude
2026-09 · DOI: 10.1007/s00446-026-00511-4A topological characterization of stabilizing consensus
Ulrich Schmid, Stephan Felber, Hugo Rincon Galeana
2026-09 · DOI: 10.1007/s00446-026-00508-zSatrapy: From abstract to practical consensus for heterogeneous quorum systems
Xiao Li, Eric M. Chan, Mohsen Lesani
2026-06 · DOI: 10.1007/s00446-026-00507-0Polylogarithmic time algorithms for shortest path forests in programmable matter
Andreas Padalkin, Christian Scheideler
2026-06 · DOI: 10.1007/s00446-026-00505-2Connectivity Labeling in Faulty Colored Graphs
Asaf Petruschka, Shay Sapir, Elad Tzalik
2026-06 · DOI: 10.1007/s00446-026-00506-1Improved all-pairs approximate shortest paths in congested clique
Hong Duc Bui, Shashwat Chandra, Yi-Jun Chang, Michal Dory et al.
2026-06 · DOI: 10.1007/s00446-025-00501-yContent-oblivious leader election on rings
Fabian Frei, Ran Gelles, Ahmed Ghazy, Alexandre Nolin et al.
2026-06 · DOI: 10.1007/s00446-025-00491-xUniversal pattern formation by oblivious robots under sequential schedulers
Paola Flocchini, Alfredo Navarra, Debasish Pattanayak, Francesco Piselli et al.
2026-06 · DOI: 10.1007/s00446-026-00504-3Gathering teams of bounded memory agents on a line
Younan Gao, Andrzej Pelc
2026-06 · DOI: 10.1007/s00446-025-00495-7Distributed MIS in O(log log n) Awake Complexity
Fabien Dufoulon, William K. Moses, Gopal Pandurangan
2026-06 · DOI: 10.1007/s00446-025-00498-4Constant-round spanners and shortest paths in congested clique and MPC
Michal Dory, Orr Fischer, Seri Khoury, Dean Leitersdorf et al.
2026-06 · DOI: 10.1007/s00446-025-00503-wReviews
Community Reviews
Version History
October 4, 2026 at 9:18 pm
October 2, 2026