TL;DR
This paper provides an overview of six bachelor theses from ITMO University in 2021, covering topics from graph algorithms to concurrent data structures and parallel algorithms.
Contribution
It summarizes recent bachelor research contributions in algorithms and data structures, highlighting advancements in parallel and concurrent computing.
Findings
Development of a streaming algorithm for graph metric decomposition
Design of memory-friendly concurrent data structures
Analysis of performance of concurrent data structures
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Computing and Data Management