Distributed Computing

ISSN: 0178-2770

Journal Home

Journal Guideline

Distributed Computing Q1 Unclaimed

Springer Verlag Germany
Unfortunately this journal has not been claimed yet. For this reason, some information may be unavailable.

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: -

Metrics

Distributed Computing

1,025

SJR Impact factor

51

H Index

26

Total Docs (Last Year)

79

Total Docs (3 years)

932

Total Refs

115

Total Cites (3 years)

74

Citable Docs (3 years)

1.23

Cites/Doc (2 years)

35.85

Ref/Doc

Comments

No comments ... Be the first to comment!



Best articles by citations

Appraising fairness in languages for distributed programming

View more

Lower bounds for sense of direction in regular graphs

View more

The torus routing chip

View more

An improved lower bound for the time complexity of mutual exclusion

View more

Efficient reliable communication over partially authenticated networks

View more

Constant-time distributed dominating set approximation

View more

Appraising two decades of distributed computing theory research

View more

Delegation of cryptographic servers for capture-resilient devices

View more

Lock-free reference counting

View more

Derandomizing random walks in undirected graphs using locally fair exploration strategies

View more

Decentralization of process nets with centralized control

View more

Randomized two-process wait-free test-and-set

View more
SHOW MORE ARTICLES

Specification and analysis of a data transfer protocol using systems of communicating machines

View more

Alternators on uniform rings of odd size

View more

Distributed graph searching with a sense of direction

View more

Interval routing schemes allow broadcasting with linear message-complexity

View more

Using mappings to prove timing properties

View more

Sparse communication networks and efficient routing in the plane

View more

Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler

View more

Reaching agreement on processor-group membrship in synchronous distributed systems

View more

Nearly optimal bounds for distributed wireless scheduling in the SINR model

View more

Nearly optimal perfectly periodic schedules

View more

Adaptive and efficient mutual exclusion

View more

Greedy hot-potato routing on the two-dimensional mesh

View more

FAQS