Compressed Data Structures: Algorithms and Applications

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (30 April 2021) | Viewed by 693

Special Issue Editors

Faculty of Computer Science, Dalhousie University
Interests: Algorithms and Data Structures; Computational Geometry
Department of Computer Science, Michigan Technological University
Interests: Algorithms and Data Structures; Computational Geometry; Data Compression.

Special Issue Information

Dear Colleagues,

Compressed data structures are a thriving research area at the intersection of data structures and data compression. The goal is to represent the data in the most compact way possible so that these data can be queried efficiently. The study of compressed data structures is motivated by the constantly growing volumes of data that must be stored and processed and by situations when the storage capacity is limited. Compressed data structures are interesting in their own right and as a part of algorithms that work on compressed data without decompressing it. Compressed data structures also find numerous applications in other areas, e.g., they are used to reduce the space consumption of geometric data structures. Although this area has been extensively studied for over two decades, there is still a number of important open questions.  

This Special Issue is devoted to all aspects of compressed data structures and their connections to other research areas. Topics include but are not limited to: - compressed and space-efficient data structures
- algorithms on compressed data
- applications of compressed data structures
- space-efficient data structures in computational geometry
- pattern matching 

Both theoretical and experimental works will be considered.

Dr. Yakov Nekrich
Dr. Meng He
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

  • compressed and space-efficient data structures
  • algorithms on compressed data
  • applications of compressed data structures
  • space-efficient data structures in computational geometry
  • pattern matching 

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop