A Concurrency-Optimal Binary Search Tree. - Vitaly Aksenov; Vincent Gramoli; Petr Kuznetsov; Anna Malova; Srivatsan Ravi (Euro-Par, 2017)

Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation. - Umut A. Acar; Vitaly Aksenov; Sam Westrick (SPAA, 2017)

Flat Parallelization. - Vitaly Aksenov; Petr Kuznetsov (CoRR, 2017)

Parallel Combining: Making Use of Free Cycles. - Vitaly Aksenov; Petr Kuznetsov (CoRR, 2017)

On Helping and Stacks. - Vitaly Aksenov; Petr Kuznetsov; Anatoly Shalyto 001 (NETYS, 2018)

Parallel Combining: Benefits of Explicit Synchronization. - Vitaly Aksenov; Petr Kuznetsov; Anatoly Shalyto 001 (OPODIS, 2018)

Brief Announcement: Performance Prediction for Coarse-Grained Locking. - Vitaly Aksenov; Dan Alistarh; Petr Kuznetsov (PODC, 2018)

Performance challenges in modular parallel programs. - Umut A. Acar; Vitaly Aksenov; Arthur Charguéraud; Mike Rainey (PPoPP, 2018)

Synchronization Costs in Parallel Programs and Concurrent Data Structures. (Coûts de Synchronization dans les Programmes Parallèles et les Structures de Donnèes Simultanées). - Vitaly Aksenov (2018)

Provably and practically efficient granularity control. - Umut A. Acar; Vitaly Aksenov; Arthur Charguéraud; Mike Rainey (PPoPP, 2019)

Recovering rearranged cancer chromosomes from karyotype graphs. - Sergey Aganezov; Ilya Zban; Vitaly Aksenov; Nikita Alexeev; Michael C. Schatz (BMC Bioinform., 2019)

Performance Prediction for Coarse-Grained Locking. - Vitaly Aksenov; Dan Alistarh; Petr Kuznetsov (CoRR, 2019)

PopSGD: Decentralized Stochastic Gradient Descent in the Population Model. - Giorgi Nadiradze; Amirmojtaba Sabour; Aditya Sharma; Ilia Markov; Vitaly Aksenov; Dan Alistarh (CoRR, 2019)

Scalable Belief Propagation via Relaxed Scheduling. - Vitaly Aksenov; Dan Alistarh; Janne H. Korhonen (NeurIPS, 2020)

Restricted memory-friendly lock-free bounded queues. - Nikita Koval; Vitaly Aksenov (PPoPP, 2020)

Relaxed Scheduling for Scalable Belief Propagation. - Vitaly Aksenov; Dan Alistarh; Janne H. Korhonen (CoRR, 2020)

Review of the Hydra Conference on Concurrent and Distributed Computing Hydra 2020. - Vitaly Aksenov; Alexey Fyodorov (SIGACT News, 2020)

Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020. - Vitaly Aksenov; Petr Kuznetsov (SIGACT News, 2020)

Execution of NVRAM Programs with Persistent Stack. - Vitaly Aksenov; Ohad Ben-Baruch; Danny Hendler; Ilya Kokorin; Matan Rusanovsky (PaCT, 2021)

Optimal Concurrency for List-Based Sets. - Vitaly Aksenov; Vincent Gramoli; Petr Kuznetsov; Di Shang; Srivatsan Ravi (PaCT, 2021)

Toward Self-Adjusting Networks for the Matching Model. - Evgeniy Feder; Ichha Rathod; Punit Shyamsukha; Robert Sama; Vitaly Aksenov; Iosif Salem; Stefan Schmid 001 (SPAA, 2021)

Memory-Optimality for Non-Blocking Containers. - Vitaly Aksenov; Nikita Koval; Petr Kuznetsov (CoRR, 2021)

Overview of Bachelors Theses 2021. - Vitaly Aksenov (CoRR, 2021)

Peformance Prediction for Coarse-Grained Locking: MCS Case. - Vitaly Aksenov; Daniil Bolotov; Petr Kuznetsov (CoRR, 2021)

Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model. - Evgeniy Feder; Ichha Rathod; Punit Shyamsukha; Robert Sama; Vitaly Aksenov; Iosif Salem; Stefan Schmid 001 (INFOCOM, 2022)

Parallel-Batched Interpolation Search Tree. - Vitaly Aksenov; Ilya Kokorin; Alena Martsenyuk (PaCT, 2023)

Unexpected Scaling in Path Copying Trees. - Vitaly Aksenov; Trevor Brown 001; Alexander Fedorov; Ilya Kokorin (PPoPP, 2023)

Self-adjusting Linear Networks with Ladder Demand Graph. - Vitaly Aksenov; Anton Paramonov; Iosif Salem; Stefan Schmid 001 (SIROCCO, 2023)

Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures. - Vitaly Aksenov; Michael Anoprenko; Alexander Fedorov; Michael F. Spear (DISC, 2023)

Toward Self-Adjusting k-ary Search Tree Networks. - Evgenii Feder; Anton Paramonov; Iosif Salem; Stefan Schmid 001; Vitaly Aksenov (CoRR, 2023)

Benchmark Framework with Skewed Workloads. - Vitaly Aksenov; Dmitry Ivanov; Ravil Galiev (CoRR, 2023)

Wait-free Trees with Asymptotically-Efficient Range Queries. - Ilya Kokorin; Dan Alistarh; Vitaly Aksenov (CoRR, 2023)

Efficient Self-Adjusting Search Trees via Lazy Updates. - Alexander Slastin; Dan Alistarh; Vitaly Aksenov (CoRR, 2023)

On the Complexity of the Virtual Network Embedding in Specific Tree Topologies. - Sergey Pankratov; Vitaly Aksenov; Stefan Schmid 001 (CoRR, 2023)

The splay-list: a distribution-adaptive concurrent skip-list. - Vitaly Aksenov; Dan Alistarh; Alexandra Drozdova; Amirkeivan Mohtashami (Distributed Comput., 2023)

The Next 700 Benchmarking Frameworks for Concurrent Data Structures. - Ravil Galiev; Michael F. Spear; Vitaly Aksenov (ApPLIED@PODC, 2024)

Trigram-Based Persistent IDE Indices with Quick Startup. - Zakhar Iakovlev; Alexey Chulkov; Nikita Golikov; Vyacheslav Lukianov; Nikita Zinoviev; Dmitry Ivanov; Vitaly Aksenov (IDE@ICSE, 2024)

Toward Self-Adjusting $k$-Ary Search Tree Networks. - Evgeniy Feder; Anton Paramonov; Pavel Mavrin; Iosif Salem; Stefan Schmid 001; Vitaly Aksenov (IPDPS (Workshops), 2024)

Wait-free Trees with Asymptotically-Efficient Range Queries. - Ilya Kokorin; Victor Yudov; Vitaly Aksenov; Dan Alistarh (IPDPS, 2024)

Memory Bounds for Concurrent Bounded Queues. - Vitaly Aksenov; Nikita Koval; Petr Kuznetsov; Anton Paramonov (PPoPP, 2024)

Practical Hardware Transactional vEB Trees. - Mohammad Khalaji; Trevor Brown 001; Khuzaima Daudjee; Vitaly Aksenov (PPoPP, 2024)

Derivative-based regularization for regression. - Enrico Lopedoto; Maksim Shekhunov; Vitaly Aksenov; Kizito Salako; Tillman Weyde (CoRR, 2024)

Skip Hash: A Fast Ordered Map Via Software Transactional Memory. - Matthew Rodriguez; Vitaly Aksenov; Michael F. Spear (CoRR, 2024)

In the Search of Optimal Tree Networks: Hardness and Heuristics. - Pavel Martynov; Maxim Buzdalov 001; Sergey Pankratov; Vitaly Aksenov; Stefan Schmid 001 (GECCO, 2025)

Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers. - Michael Anoprenko; Petr Kuznetsov; Vitaly Aksenov (PODC, 2025)