Fault Tolerant Algorithms and Data Structures

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Databases and Data Structures".

Deadline for manuscript submissions: closed (30 November 2025) | Viewed by 806

Special Issue Editor

Department of Computer Science, Loughborough University, Loughborough LE11 3TU, UK
Interests: algorithms; random processes; distributed systems; parallel computing; distributed algorithms; scheduling and load balancing; randomised algorithms; CS theory; storage systems
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

We invite you to submit your latest research to our Special Issue titled "Fault Tolerant Algorithms and Data Structures". In recent decades, computer systems have grown increasingly complex, with numerous hardware and software components, and this complexity raises the likelihood of component failures, which can disrupt entire systems. Such disruptions can lead to the unavailability of essential services like business websites and cloud platforms, or halt industrial operations, resulting in significant financial losses.

Therefore, it is crucial that robust systems and fail-safe hardware and software components are developed to mitigate these issues. These advancements invariably heavily rely on fault-tolerant algorithms and data structures, which form the foundation of dependable systems.

We welcome submissions that explore new approaches, methodologies, and empirical findings in the field of fault tolerance in computer systems. Your contributions will enhance our understanding and implementation of fault tolerance, ultimately leading to more resilient technological infrastructures.

Topics may include, but are not limited to:

  • Design and analysis of fault-tolerant algorithms;
  • Fault-tolerant data structures;
  • Resilient networks;
  • Error-correcting codes;
  • Coding theory;
  • Fault tolerance in operating systems;
  • Robust machine learning and artificial intelligence;
  • Fault-tolerant algorithms for distributed systems.

Dr. Lars Nagel
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 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 250 words) can be sent to the Editorial Office for assessment.

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

  • fault tolerance
  • algorithms
  • data structures
  • fault-tolerant algorithms for distributed systems
  • coding theory
  • error-correcting codes
  • physical redundancy
  • high-availability systems
  • resilient networks

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (1 paper)

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

Research

17 pages, 431 KB  
Article
Tradeoff Between Speed and Memory Requirements for Decoding of Prefix-Free Codes
by Jörg Keller and Christina Kahle
Algorithms 2026, 19(1), 5; https://doi.org/10.3390/a19010005 - 20 Dec 2025
Viewed by 213
Abstract
For the decoding of prefix-free codes such as Huffman code, we present a tradeoff between the decoding speed and memory requirements that results in an adapted decoding algorithm. Our decoding experiments on different codes demonstrate that the Pareto front of non-dominated solutions from [...] Read more.
For the decoding of prefix-free codes such as Huffman code, we present a tradeoff between the decoding speed and memory requirements that results in an adapted decoding algorithm. Our decoding experiments on different codes demonstrate that the Pareto front of non-dominated solutions from different parameters comprises known solutions and solutions from our adapted algorithm. Each Pareto front comprises five solutions from our adapted algorithm next to five known solutions with a single table and one known solution with all possible tables. Compared to the fastest known solution with all possible tables, our adapted algorithm can achieve only 3.8% runtime overhead with only 66% of the memory requirements. Compared to a known solution with only one table, our adapted algorithm achieves up to 10% runtime improvement with three tables instead of one table. We conclude that our algorithm gives developers more and better choices to balance decoding speed and memory requirements. Full article
(This article belongs to the Special Issue Fault Tolerant Algorithms and Data Structures)
Show Figures

Figure 1

Back to TopTop