Vitaly Aksenov

According to our database, Vitaly Aksenov authored at least 44 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Skip Hash: A Fast Ordered Map Via Software Transactional Memory.

Matthew Rodriguez, Vitaly Aksenov, Michael F. Spear

CoRR, 2024

Derivative-based regularization for regression.

Enrico Lopedoto, Maksim Shekhunov, Vitaly Aksenov, Kizito Salako, Tillman Weyde

CoRR, 2024

In the Search of Optimal Tree Networks: Hardness and Heuristics.

Maxim Buzdalov, Pavel Martynov, Sergey Pankratov, Vitaly Aksenov, Stefan Schmid

CoRR, 2024

Practical Hardware Transactional vEB Trees.

Mohammad Khalaji, Trevor Brown, Khuzaima Daudjee, Vitaly Aksenov

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Memory Bounds for Concurrent Bounded Queues.

Vitaly Aksenov, Nikita Koval, Petr Kuznetsov, Anton Paramonov

Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Wait-free Trees with Asymptotically-Efficient Range Queries.

Ilya Kokorin, Victor Yudov, Vitaly Aksenov, Dan Alistarh

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024

Toward Self-Adjusting $k$-Ary Search Tree Networks.

Evgeniy Feder, Anton Paramonov, Pavel Mavrin, Iosif Salem, Stefan Schmid, Vitaly Aksenov

Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024

Trigram-Based Persistent IDE Indices with Quick Startup.

Zakhar Iakovlev, Alexey Chulkov, Nikita Golikov, Vyacheslav Lukianov, Nikita Zinoviev, Dmitry Ivanov, Vitaly Aksenov

Proceedings of the 1st ACM/IEEE Workshop on Integrated Development Environments, 2024

The Next 700 Benchmarking Frameworks for Concurrent Data Structures.

Ravil Galiev, Michael F. Spear, Vitaly Aksenov

Proceedings of the 2024 Workshop on Advanced Tools, 2024

2023

The splay-list: a distribution-adaptive concurrent skip-list.

Vitaly Aksenov, Dan Alistarh, Alexandra Drozdova, Amirkeivan Mohtashami

Distributed Comput., September, 2023

On the Complexity of the Virtual Network Embedding in Specific Tree Topologies.

Sergey Pankratov, Vitaly Aksenov, Stefan Schmid

CoRR, 2023

Efficient Self-Adjusting Search Trees via Lazy Updates.

Alexander Slastin, Dan Alistarh, Vitaly Aksenov

CoRR, 2023

Wait-free Trees with Asymptotically-Efficient Range Queries.

Ilya Kokorin, Dan Alistarh, Vitaly Aksenov

CoRR, 2023

Benchmark Framework with Skewed Workloads.

Vitaly Aksenov, Dmitry Ivanov, Ravil Galiev

CoRR, 2023

Toward Self-Adjusting k-ary Search Tree Networks.

Evgenii Feder, Anton Paramonov, Iosif Salem, Stefan Schmid, Vitaly Aksenov

CoRR, 2023

Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.

Vitaly Aksenov, Michael Anoprenko, Alexander Fedorov, Michael F. Spear

Proceedings of the 37th International Symposium on Distributed Computing, 2023

Self-adjusting Linear Networks with Ladder Demand Graph.

Vitaly Aksenov, Anton Paramonov, Iosif Salem, Stefan Schmid

Proceedings of the Structural Information and Communication Complexity, 2023

Unexpected Scaling in Path Copying Trees.

Vitaly Aksenov, Trevor Brown, Alexander Fedorov, Ilya Kokorin

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Parallel-Batched Interpolation Search Tree.

Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk

Proceedings of the Parallel Computing Technologies, 2023

2022

Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model.

Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid

Proceedings of the IEEE INFOCOM 2022, 2022

2021

Peformance Prediction for Coarse-Grained Locking: MCS Case.

Vitaly Aksenov, Daniil Bolotov, Petr Kuznetsov

CoRR, 2021

Overview of Bachelors Theses 2021.

Vitaly Aksenov

CoRR, 2021

Memory-Optimality for Non-Blocking Containers.

Vitaly Aksenov, Nikita Koval, Petr Kuznetsov

CoRR, 2021

Toward Self-Adjusting Networks for the Matching Model.

Evgeniy Feder, Ichha Rathod, Punit Shyamsukha, Robert Sama, Vitaly Aksenov, Iosif Salem, Stefan Schmid

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Optimal Concurrency for List-Based Sets.

Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Di Shang, Srivatsan Ravi

Proceedings of the Parallel Computing Technologies, 2021

Execution of NVRAM Programs with Persistent Stack.

Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler, Ilya Kokorin, Matan Rusanovsky

Proceedings of the Parallel Computing Technologies, 2021

2020

Review of the Third Summer School on the Practice and Theory of Distributed Computing SPTDC 2020.

Vitaly Aksenov, Petr Kuznetsov

SIGACT News, 2020

Review of the Hydra Conference on Concurrent and Distributed Computing Hydra 2020.

Vitaly Aksenov, Alexey Fyodorov

SIGACT News, 2020

Relaxed Scheduling for Scalable Belief Propagation.

Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen

CoRR, 2020

Restricted memory-friendly lock-free bounded queues.

Nikita Koval, Vitaly Aksenov

Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Scalable Belief Propagation via Relaxed Scheduling.

Vitaly Aksenov, Dan Alistarh, Janne H. Korhonen

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

PopSGD: Decentralized Stochastic Gradient Descent in the Population Model.

Giorgi Nadiradze, Amirmojtaba Sabour, Aditya Sharma, Ilia Markov, Vitaly Aksenov, Dan Alistarh

CoRR, 2019

Performance Prediction for Coarse-Grained Locking.

Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov

CoRR, 2019

Recovering rearranged cancer chromosomes from karyotype graphs.

Sergey Aganezov, Ilya Zban, Vitaly Aksenov, Nikita Alexeev, Michael C. Schatz

BMC Bioinform., 2019

Provably and practically efficient granularity control.

Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey

Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

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

PhD thesis, 2018

Performance challenges in modular parallel programs.

Umut A. Acar, Vitaly Aksenov, Arthur Charguéraud, Mike Rainey

Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Brief Announcement: Performance Prediction for Coarse-Grained Locking.

Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Parallel Combining: Benefits of Explicit Synchronization.

Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto

Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

On Helping and Stacks.

Vitaly Aksenov, Petr Kuznetsov, Anatoly Shalyto

Proceedings of the Networked Systems - 6th International Conference, 2018

2017

Parallel Combining: Making Use of Free Cycles.

Vitaly Aksenov, Petr Kuznetsov

CoRR, 2017

Flat Parallelization.

Vitaly Aksenov, Petr Kuznetsov

CoRR, 2017

Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation.

Umut A. Acar, Vitaly Aksenov, Sam Westrick

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

A Concurrency-Optimal Binary Search Tree.

Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Anna Malova, Srivatsan Ravi

Proceedings of the Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28, 2017