Special Issue "Distributed Computing Theory, Systems, Algorithms, and Data Structures"

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Parallel and Distributed Algorithms".

Deadline for manuscript submissions: 15 December 2020.

Special Issue Editor

Dr. Gokarna Sharma
Guest Editor
Department of Computer Science, Kent State University, Kent, OH 44242, USA
Interests: distributed systems and algorithms; blockchain; network, graph, sensor, and robot coordination algorithms

Special Issue Information

Dear Colleagues,

We invite you to submit your latest research on the broad area of distributed computing to this Special Issue, “Distributed Computing Theory, Systems, Algorithms, and Data Structures”. The goal of this Special Issue is to improve understanding of the principles and practices underlying distributed computing. We solicit high-quality original research papers on problems that naturally arise in all areas of distributed computing. We welcome research papers from all viewpoints, including theory, algorithms, systems, practice, and experimentation. Potential topics include but are not limited to the following: design and analysis of distributed algorithms; lower bounds, complexity, and impossibility results; network protocols; distributed machine learning, operating systems, databases, resource management, scheduling, fault tolerance, and reliability; self-stabilization; peer-to-peer systems; concurrency, synchronization, and consistency; multicore and multiprocessor algorithms and architectures; distributed and concurrent data structures; blockchain protocols; wireless and sensor networks; mobile and robot computing; formal methods; game theory in distributed computing; high-performance, cluster, and grid computing; distributed storage and persistence; security and cryptography; coding and biological algorithms; and experimental evaluation of distributed algorithms and systems.

Dr. Gokarna Sharma
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1000 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.


  • Blockchain protocols
  • Complexity, impossibility, and lower bounds
  • Concurrency, synchronization, and consistency
  • Design and analysis of distributed algorithms
  • Distributed and concurrent data structures
  • Distributed machine learning, operating systems, fault tolerance, and reliability
  • Distributed resource management and scheduling
  • Distributed storage and persistent memory
  • Experimental evaluation of distributed algorithms and systems
  • Formal methods for distributed computing
  • Game theory in distributed computing
  • Mobile and robot computing
  • Multicore and multiprocessor algorithms and architectures
  • Network protocols
  • Peer-to-peer systems
  • Security and cryptography
  • Self-stabilization
  • Wireless and sensor networks

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:


Open AccessArticle
Dynamic Ring Exploration with (H,S) View
Algorithms 2020, 13(6), 141; https://doi.org/10.3390/a13060141 - 12 Jun 2020
The researches about a mobile entity (called agent) on dynamic networks have attracted a lot of attention in recent years. Exploration which requires an agent to visit all the nodes in the network is one of the most fundamental problems. While the exploration [...] Read more.
The researches about a mobile entity (called agent) on dynamic networks have attracted a lot of attention in recent years. Exploration which requires an agent to visit all the nodes in the network is one of the most fundamental problems. While the exploration of dynamic networks with complete information or with no information about network changes has been studied, an agent with partial information about the network changes has not been considered yet despite its practical importance. In this paper, we consider the exploration of dynamic networks by a single agent with partial information about network changes. To the best of our knowledge, this is the very first work to investigate the exploration problem with such partial information. As a first step in this research direction, we focus on 1-interval connected rings as dynamic networks in this paper. We assume that the single agent has partial information called the ( H , S ) view by which it always knows whether or not each of the links within H hops is available in each of the next S time steps. In this setting, we show that H + S n and S n / 2 (n is the size of the network) are necessary and sufficient conditions to explore 1-interval connected rings. Moreover, we investigate the upper and lower bounds of the exploration time. It is proven that the exploration time is O ( n 2 ) for n / 2 S < 2 H 1 , O ( n 2 / H + n H ) for S max ( n / 2 , 2 H 1 ) , O ( n 2 / H + n log H ) for S n 1 , and Ω ( n 2 / H ) for any S where H = min ( H , n / 2 ) . Full article
Show Figures

Figure 1

Back to TopTop