"Surveys in Algorithm Analysis and Complexity Theory" -- A special issue of
Algorithms (ISSN 1999-4893)
This is a special issue 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 will be 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.
We hope that the surveys published in this special issue will be useful for
other researchers and become highly cited in the near future.
Guest Editor:
Dr. Jesper Jansson, Kyoto University, Japan
Keywords:
* algorithm analysis
* modern data structures
* computational complexity
* fixed-parameter tractability
* approximation algorithms
* lower bounds
* bioinformatics algorithms
* computational geometry
* parallel and distributed computing
* quantum computing
Submission information:
Submitted manuscripts should not have been published previously nor be under
consideration for publication elsewhere.
All submissions will be thoroughly refereed through a peer-review process.
Manuscripts should be submitted online after registering and logging in.
Accepted articles will be published continuously in the journal (as soon as
accepted) and will be listed together on the special issue website.
A guide for authors and other information related to the submission of
manuscripts is available on the "Instructions for Authors"-page.
The article processing charges for publication in this open-access journal are
also listed on the journal's webpage.
A limited number of fee waivers are available; in case you are interested in
applying for one, please ask the Guest Editor for details before submitting
your survey to the journal.
Deadline:
The deadline for manuscript submissions is 2022-10-31.
About the journal:
Algorithms (ISSN 1999-4893; CODEN: ALGOCH) is an open-access journal of
computer science, computational mathematics, artificial intelligence,
automation and control systems, theory, methods and interdisciplinary
applications, data and information systems, and software engineering.
It is published online monthly by MDPI.
Journal webpage:
https://www.mdpi.com/journal/algorithms
Special issue main webpage:
https://www.mdpi.com/journal/algorithms/special_issues/survey_algorithm_complexity
Instructions for authors:
https://www.mdpi.com/journal/algorithms/instructions
Submission:
https://susy.mdpi.com/user/manuscripts/upload/?journal=algorithms
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
