Distributed Computing Q1 Unclaimed
The international journal Distributed Computing provides a forum for original and significant contributions to the theory, design, specification, and implementation of distributed systems. Topics covered by the journal include but are not limited to: design and analysis of distributed algorithms; multiprocessor and multicore architectures and algorithms; synchronization protocols and concurrent programming; distributed operating systems and middleware; fault-tolerance, reliability, and availability; architectures and protocols for communication networks and peer-to-peer systems; security in distributed computing, cryptographic protocols; mobile, sensor, and ad hoc networks; internet applications; concurrency theory; and specification, semantics, verification, and testing of distributed systems. In general, only original papers will be considered. Papers previously presented in conference proceedings may be submitted in enhanced form. If a paper has appeared previously, in any form, the authors must clearly indicate this and provide an account of the differences between the previously appeared form and the submission. It has an SJR impact factor of 1,025.
Type: Journal
Type of Copyright:
Languages: English
Open Access Policy: Open Choice
Type of publications:
Publication frecuency: -


2390 €
Inmediate OANPD
Embargoed OA0 €
Non OAMetrics
1,025
SJR Impact factor51
H Index26
Total Docs (Last Year)79
Total Docs (3 years)932
Total Refs115
Total Cites (3 years)74
Citable Docs (3 years)1.23
Cites/Doc (2 years)35.85
Ref/DocOther journals with similar parameters
IEEE Transactions on Pattern Analysis and Machine Intelligence Q1
Molecular Systems Biology Q1
IEEE Transactions on Evolutionary Computation Q1
IEEE Transactions on Fuzzy Systems Q1
Computer-Aided Civil and Infrastructure Engineering Q1
Compare this journals
Aims and Scope
Best articles by citations
Appraising fairness in languages for distributed programming
View moreLower bounds for sense of direction in regular graphs
View moreThe torus routing chip
View moreAn improved lower bound for the time complexity of mutual exclusion
View moreEfficient reliable communication over partially authenticated networks
View moreConstant-time distributed dominating set approximation
View moreAppraising two decades of distributed computing theory research
View moreDelegation of cryptographic servers for capture-resilient devices
View moreLock-free reference counting
View moreDerandomizing random walks in undirected graphs using locally fair exploration strategies
View moreDecentralization of process nets with centralized control
View moreRandomized two-process wait-free test-and-set
View moreSpecification and analysis of a data transfer protocol using systems of communicating machines
View moreAlternators on uniform rings of odd size
View moreDistributed graph searching with a sense of direction
View moreInterval routing schemes allow broadcasting with linear message-complexity
View moreUsing mappings to prove timing properties
View moreSparse communication networks and efficient routing in the plane
View moreEfficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
View moreReaching agreement on processor-group membrship in synchronous distributed systems
View moreNearly optimal bounds for distributed wireless scheduling in the SINR model
View moreNearly optimal perfectly periodic schedules
View moreAdaptive and efficient mutual exclusion
View moreGreedy hot-potato routing on the two-dimensional mesh
View more
Comments