Compressed data structures

The project covers problems related to the processing of compressed texts and text-like data. Such data increases in volume much faster than the computational power of modern devices. At the same time, the progress of information technology generates new requirements to the methods of processing of large amounts of data. The gap between desires and possibilities in data processing leads to both theoretical and practical challenges. The project assumes research in compressed representations of data with the support of fast search and retrieval. This topic is quite competitive. We consider both purely theoretical problems (the possibilities and limitations for algorithms and data structures in certain computational models) and problems that may have a practical effect (new indexing data structures and search algorithms for them).