Overview of Bachelors Theses 2021

07/26/2021
by   Vitaly Aksenov, et al.
0

In this work, we review Bachelors Theses done under the supervision of Vitaly Aksenov at ITMO University. This overview contains the short description of six theses: "Development of a Streaming Algorithm for the Decomposition of Graph Metrics to Tree Metrics" by Oleg Fafurin, "Development of Memory-friendly Concurrent Data Structures" by Roman Smirnov, "Theoretical Analysis of the Performance of Concurrent Data Structures" by Daniil Bolotov, "Parallel Batched Interpolation Search Tree" by Alena Martsenyuk, "Parallel Batched Self-adjusting Data Structures" by Vitalii Krasnov, and "Parallel Batched Persistent Binary Search Trees" by Ildar Zinatulin.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/14/2017

Techniques for Constructing Efficient Lock-free Data Structures

Building a library of concurrent data structures is an essential way to ...
research
12/19/2022

PathCAS: An Efficient Middle Ground for Concurrent Search Data Structures

To maximize the performance of concurrent data structures, researchers h...
research
02/07/2018

Optimal data structures for stochastic driven simulations

Simulations where we have some prior information on the probability dist...
research
10/21/2019

Reasoning About Recursive Tree Traversals

Traversals are commonly seen in tree data structures, and performance-en...
research
03/16/2020

Adapting Persistent Data Structures for Concurrency and Speculation

This work unifies insights from the systems and functional programming c...
research
07/19/2018

About BIRDS project (Bioinformatics and Information Retrieval Data Structures Analysis and Design)

BIRDS stands for "Bioinformatics and Information Retrieval Data Structur...
research
10/20/2022

Noisy Tree Data Structures and Quantum Applications

The paper presents a technique for constructing noisy data structures ca...

Please sign up or login with your details

Forgot password? Click here to reset