Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
3.7
2.3
Journals
Algorithms
Special Issues
Advances in Distributed Algorithms
share announcement

Advances in Distributed Algorithms

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

Deadline for manuscript submissions: closed (15 September 2023) | Viewed by 3989

Special Issue Editors

Dr. Michele Scquizzato

E-Mail Website
Guest Editor
Department of Computer Science, University of Padova, Via VIII Febbraio, 2, 35122 Padova, Italy
Interests: design and analysis of algorithms
Special Issues, Collections and Topics in MDPI journals
Prof. Dr. Gopal Pandurangan

E-Mail Website
Guest Editor
Department of Computer Science, University of Houston, Houston, TX 77204, USA
Interests: algorithms; networks; distributed computing; big data
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

We solicit original contributions to the design, analysis, implementation, application, or limitations of distributed algorithms. Papers from all viewpoints, including theory, practice, and experimentation, are welcome. Topics of interest include, but are not limited to, the following:

  • Biological distributed algorithms
  • Blockchain protocols
  • Communication networks: algorithms, protocols, and applications
  • Complexity and impossibility results for distributed computing
  • Design and analysis of distributed algorithms
  • Distributed algorithms for Big Data computations
  • Distributed data structures
  • Distributed graph algorithms
  • Distributed machine learning algorithms
  • Distributed resource management and scheduling
  • Experimental evaluation of distributed algorithms
  • Massively parallel, high-performance, cloud and grid computing
  • Mobile computing and autonomous agents
  • Multiprocessor and multi-core algorithms
  • Population protocols.

Dr. Michele Scquizzato
Prof. Dr. Gopal Pandurangan
Guest Editors

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 submissions that pass pre-check are 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 1600 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.

Keywords

  • distributed algorithms
  • distributed computing
  • parallel algorithms
  • networks
  • complexity theory
  • applications

Published Papers (2 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

Jump to: Review

18 pages, 612 KiB  
Article
A Blockchain-Based Auction Framework for Location-Aware Services
by Khaled Almiani, Mutaz Abu Alrub, Young Choon Lee, Taha H. Rashidi and Amirmohammad Pasdar
Algorithms 2023, 16(7), 340; https://doi.org/10.3390/a16070340 - 16 Jul 2023
Viewed by 1795
Abstract
As a critical factor in ensuring the growth of the electronic auction (e-auction) domain, the privacy and security of the participants (sellers and buyers) must always be guaranteed. Traditionally, auction data, including participant details, are stored in a third party (auctioneer) database. This [...] Read more.
As a critical factor in ensuring the growth of the electronic auction (e-auction) domain, the privacy and security of the participants (sellers and buyers) must always be guaranteed. Traditionally, auction data, including participant details, are stored in a third party (auctioneer) database. This leads to a high risk of a single point of failure in terms of privacy and security. Toward this end, blockchain technology has emerged as a promising decentralized communication paradigm to address such risks. This paper presents a blockchain-based auction framework as a decentralized e-auctioning framework for location-aware services. In particular, the framework consists of three components: pre-auctioning, main auctioning, and post-auctioning processes with four algorithms. Our primary focus is on location-aware services, such as storage space rental, apartment rental, transport hire, and parking space rental. The trading volumes are expected to be high; hence, simplifying the design is a crucial requirement. In addition to the benefits of eliminating the centralized entity (the auctioneer), fees are redistributed among participants as rewards. Further, we incorporate a service quality monitoring method that ranks the services provided by participants. This ranking allows participants to determine the rank of other participants with whom they wish to trade. We have conducted several experiments to evaluate the proposed framework’s cost feasibility and to ensure the ease of the business flow. Full article
(This article belongs to the Special Issue Advances in Distributed Algorithms)
►▼ Show Figures

Figure 1

Review

Jump to: Research

15 pages, 590 KiB  
Review
On the Intersection of Computational Geometry Algorithms with Mobile Robot Path Planning
by Ehsan Latif and Ramviyas Parasuraman
Algorithms 2023, 16(11), 498; https://doi.org/10.3390/a16110498 - 27 Oct 2023
Viewed by 1561
Abstract
In the mathematical discipline of computational geometry (CG), practical algorithms for resolving geometric input and output issues are designed, analyzed, and put into practice. It is sometimes used to refer to pattern recognition and to define the solid modeling methods for manipulating curves [...] Read more.
In the mathematical discipline of computational geometry (CG), practical algorithms for resolving geometric input and output issues are designed, analyzed, and put into practice. It is sometimes used to refer to pattern recognition and to define the solid modeling methods for manipulating curves and surfaces. CG is a rich field encompassing theories to solve complex optimization problems, such as path planning for mobile robot systems and extension to distributed multi-robot systems. This brief review discusses the fundamentals of CG and its application in solving well-known automated path-planning problems in single- and multi-robot systems. We also discuss three winning algorithms from the CG-SHOP (Computational Geometry: Solving Hard Optimization Problems) 2021 competition to evidence the practicality of CG in multi-robotic systems. We also mention some open problems at the intersection of CG and robotics. This review provides insights into the potential use of CG in robotics and future research directions at their intersection. Full article
(This article belongs to the Special Issue Advances in Distributed Algorithms)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-2
Back to TopTop