[CPM-SPIRE-L] Special Issue "Compressed Data Structures: Algorithms and Applications"

[Yakov Nekrich]

Journal: Algorithms
Special Issue "Compressed Data Structures: Algorithms and Applications"
Submission Deadline: 30 April,  2021

Dear Colleagues,

Compressed data structures is 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.

We invite you to submit high-quality papers 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.  A more 
detailed information about the submission process can be found at

https://www.mdpi.com/journal/algorithms/special_issues/Compressed_Data_Structures



Guest Editors

Dr. Meng He, Dalhousie University
Dr. Yakov Nekrich, Michigan Technological University








-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://fenris.cs.ucr.edu/pipermail/cpm-spire-l/attachments/20201009/2cf408a9/attachment-0001.html>