Vitaly Aksenov

Orcid: 0000-0001-9134-5490

According to our database1, Vitaly Aksenov authored at least 39 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Trigram-Based Persistent IDE Indices with Quick Startup.
CoRR, 2024

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

Practical Hardware Transactional vEB Trees.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

Memory Bounds for Concurrent Bounded Queues.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024

2023
The splay-list: a distribution-adaptive concurrent skip-list.
Distributed Comput., September, 2023

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

Efficient Self-Adjusting Search Trees via Lazy Updates.
CoRR, 2023

Wait-free Trees with Asymptotically-Efficient Range Queries.
CoRR, 2023

Benchmark Framework with Skewed Workloads.
CoRR, 2023

Toward Self-Adjusting k-ary Search Tree Networks.
CoRR, 2023

Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.
Proceedings of the 37th International Symposium on Distributed Computing, 2023

Self-adjusting Linear Networks with Ladder Demand Graph.
Proceedings of the Structural Information and Communication Complexity, 2023

Unexpected Scaling in Path Copying Trees.
Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

Parallel-Batched Interpolation Search Tree.
Proceedings of the Parallel Computing Technologies, 2023

2022
Lazy Self-Adjusting Bounded-Degree Networks for the Matching Model.
Proceedings of the IEEE INFOCOM 2022, 2022

2021
Peformance Prediction for Coarse-Grained Locking: MCS Case.
CoRR, 2021

Overview of Bachelors Theses 2021.
CoRR, 2021

Memory-Optimality for Non-Blocking Containers.
CoRR, 2021

Toward Self-Adjusting Networks for the Matching Model.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Optimal Concurrency for List-Based Sets.
Proceedings of the Parallel Computing Technologies, 2021

Execution of NVRAM Programs with Persistent Stack.
Proceedings of the Parallel Computing Technologies, 2021

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

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

Relaxed Scheduling for Scalable Belief Propagation.
CoRR, 2020

Restricted memory-friendly lock-free bounded queues.
Proceedings of the PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2020

Scalable Belief Propagation via Relaxed Scheduling.
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.
CoRR, 2019

Performance Prediction for Coarse-Grained Locking.
CoRR, 2019

Recovering rearranged cancer chromosomes from karyotype graphs.
BMC Bioinform., 2019

Provably and practically efficient granularity control.
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).
PhD thesis, 2018

Performance challenges in modular parallel programs.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Brief Announcement: Performance Prediction for Coarse-Grained Locking.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Parallel Combining: Benefits of Explicit Synchronization.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

On Helping and Stacks.
Proceedings of the Networked Systems - 6th International Conference, 2018

2017
Parallel Combining: Making Use of Free Cycles.
CoRR, 2017

Flat Parallelization.
CoRR, 2017

Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

A Concurrency-Optimal Binary Search Tree.
Proceedings of the Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28, 2017


  Loading...