Algorithms

Journal Browser

► Journal Browser

Special Issue Editor

Special Issue Information

Dear Colleagues,

This is a Special Issue of Algorithms consisting of surveys in theoretical computer science. We invite original articles summarizing recent breakthroughs and/or describing the state of the art in any currently active research area related to algorithms, data structures, or computational complexity. Articles should be well structured, and each article should focus on a clearly defined topic. In addition, sufficient background, definitions, and figures should be provided to ensure that the text is accessible to anyone interested in theoretical computer science. Implementation-based surveys that compare the practical performance of various algorithms for a particular computational problem are also invited. Moreover, we would like to encourage final-year or recently graduated Ph.D. students to submit surveys based on the introductory chapters of their theses/dissertations.

For some examples of the type of surveys and the quality we are looking for, please refer to: https://www.mdpi.com/journal/algorithms/special_issues/survey_algorithm_complexity.

We hope that the surveys published in this Special Issue will be useful for other researchers and become highly cited in the near future.

Dr. Jesper Jansson
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 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.

Related Special Issue

Published Papers (3 papers)

Download All Papers

Review

24 pages, 514 KiB

Open AccessReview

A Comprehensive Survey of Isocontouring Methods: Applications, Limitations and Perspectives

by Keno Jann Büscher, Jan Philipp Degel and Jan Oellerich

Algorithms 2024, 17(2), 83; https://doi.org/10.3390/a17020083 - 15 Feb 2024

Viewed by 1380

Abstract

This paper provides a comprehensive overview of approaches to the determination of isocontours and isosurfaces from given data sets. Different algorithms are reported in the literature for this purpose, which originate from various application areas, such as computer graphics or medical imaging procedures. In all these applications, the challenge is to extract surfaces with a specific isovalue from a given characteristic, so called isosurfaces. These different application areas have given rise to solution approaches that all solve the problem of isocontouring in their own way. Based on the literature, the following four dominant methods can be identified: the marching cubes algorithms, the tessellation-based algorithms, the surface nets algorithms and the ray tracing algorithms. With regard to their application, it can be seen that the methods are mainly used in the fields of medical imaging, computer graphics and the visualization of simulation results. In our work, we provide a broad and compact overview of the common methods that are currently used in terms of isocontouring with respect to certain criteria and their individual limitations. In this context, we discuss the individual methods and identify possible future research directions in the field of isocontouring. Full article

(This article belongs to the Special Issue Surveys in Algorithm Analysis and Complexity Theory, Part II)

► Show Figures

Figure 1

18 pages, 2282 KiB

Open AccessReview

Performance and Applicability of Post-Quantum Digital Signature Algorithms in Resource-Constrained Environments

by Marin Vidaković and Kruno Miličević

Algorithms 2023, 16(11), 518; https://doi.org/10.3390/a16110518 - 13 Nov 2023

Viewed by 1991

Abstract

The continuous development of quantum computing necessitates the development of quantum-resistant cryptographic algorithms. In response to this demand, the National Institute of Standards and Technology selected standardized algorithms including Crystals-Dilithium, Falcon, and Sphincs+ for digital signatures. This paper provides a comparative evaluation of these algorithms across key metrics. The results indicate varying strengths and weaknesses for each algorithm, underscoring the importance of context-specific deployments. Our findings indicate that Dilithium offers advantages in low-power scenarios, Falcon excels in signature verification speed, and Sphincs+ provides robust security at the cost of computational efficiency. These results underscore the importance of context-specific deployments in specific and resource-constrained technological applications, like IoT, smart cards, blockchain, and vehicle-to-vehicle communication. Full article

(This article belongs to the Special Issue Surveys in Algorithm Analysis and Complexity Theory, Part II)

► Show Figures

Figure 1

63 pages, 3409 KiB

Open AccessReview

Survey of Recent Applications of the Chaotic Lozi Map

by René Lozi

Algorithms 2023, 16(10), 491; https://doi.org/10.3390/a16100491 - 22 Oct 2023

Cited by 3 | Viewed by 2821

Abstract

Since its original publication in 1978, Lozi’s chaotic map has been thoroughly explored and continues to be. Hundreds of publications have analyzed its particular structure and applied its properties in many fields (e.g., improvement of physical devices, electrical components such as memristors, cryptography, optimization, evolutionary algorithms, synchronization, control, secure communications, AI with swarm intelligence, chimeras, solitary states, etc.) through algorithms such as the COLM algorithm (Chaotic Optimization algorithm based on Lozi Map), Particle Swarm Optimization (PSO), and Differential Evolution (DE). In this article, we present a survey based on dozens of articles on the use of this map in algorithms aimed at real applications or applications exploring new directions of dynamical systems such as chimeras and solitary states. Full article

(This article belongs to the Special Issue Surveys in Algorithm Analysis and Complexity Theory, Part II)

► Show Figures