Analysis of Algorithms and Complexity Theory
A section of Algorithms (ISSN 1999-4893).
“Analysis of Algorithms and Complexity Theory” is a Section of the MDPI open-access journal Algorithms. It focuses on the design, formal analysis, and experimental evaluation of algorithms and algorithmic techniques for efficiently solving fundamental computational problems of a theoretical or practical nature. Research related to complexity aspects such as time–space tradeoffs, information-theoretic entropy, and lower bounds in various models of computation is also covered in this Section of the journal.
We hereby invite original research articles devoted to any of the above (or related) areas and hope to receive many high-quality submissions.
Dr. Jesper Jansson
- Theory of algorithms
- Sorting and searching algorithms
- Automata theory and formal languages
- Parameterized complexity
- Computational geometry
- Quantum algorithms
Following special issues within this section are currently open for submissions:
- Surveys in Algorithm Analysis and Complexity Theory, Part II (Deadline: 15 December 2023)
- String Algorithms and Applications (Deadline: 30 December 2023)
- Meta-Heuristics and Machine Learning in Modelling, Developing and Optimising Complex Systems (Deadline: 15 January 2024)
- Bayesian Networks and Causal Reasoning (Deadline: 31 January 2024)
Following topical collection within this section is currently open for submissions: