Vitaly Aksenov

St George's, University of London — United Kingdom

Computer Science · Physical Sciences

5h-index90citations67works0.62yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Distributed systems and fault tolerance(28), Parallel Computing and Optimization Techniques(25), Advanced Data Storage Technologies(12), Algorithms and Data Compression(10), Optimization and Search Problems(9)

Publications67 total

Efficient OLAP Support of Hierarchical Data Almost in Real-Time
Lecture notes in computer science·2025
Skip Hash: A Fast Ordered Map Via Software Transactional Memory
2025
In the Search of Optimal Tree Networks: Hardness and Heuristics
Proceedings of the Genetic and Evolutionary Computation Conference·2025· 1 citedOpen Access
Data Driven Derivative-based Regularization for Regression
2025
Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers
2025Open Access
An Eulerian approach to regularized JKO scheme with low-rank tensor decompositions for Bayesian inversion
arXiv (Cornell University)·2024Open Access
Skip Hash: A Fast Ordered Map Via Software Transactional Memory
arXiv (Cornell University)·2024Open Access
The Next 700 Benchmarking Frameworks for Concurrent Data Structures
2024Open Access
Toward Self-Adjusting $k$-Ary Search Tree Networks
2024· 2 cited
Wait-free Trees with Asymptotically-Efficient Range Queries
2024· 3 citedOpen Access
Derivative-based regularization for regression
arXiv (Cornell University)·2024Open Access
Trigram-Based Persistent IDE Indices with Quick Startup
arXiv (Cornell University)·2024Open Access
In the Search of Optimal Tree Networks: Hardness and Heuristics
arXiv (Cornell University)·2024Open Access
Memory Bounds for Concurrent Bounded Queues
2024· 1 cited
Practical Hardware Transactional vEB Trees
2024· 2 citedOpen Access
On the Complexity of the Virtual Network Embedding in Specific Tree Topologies
arXiv (Cornell University)·2023Open Access
Efficient Self-Adjusting Search Trees via Lazy Updates
arXiv (Cornell University)·2023Open Access
Wait-free Trees with Asymptotically-Efficient Range Queries
arXiv (Cornell University)·2023Open Access
Parallel-batched Interpolation Search Tree
arXiv (Cornell University)·2023Open Access
Benchmark Framework with Skewed Workloads
arXiv (Cornell University)·2023Open Access
page 1 of 4Next →

Frequent Co-authors

Petr Kuznetsov(12), Stefan Schmid(9), Dan Alistarh(9), Iosif Salem(6), Umut A. Acar(5), Arthur Charguéraud(4), Mike Rainey(4), Nikita Koval(4), Anton Paramonov(4), Evgeniy Feder(3), Amirkeivan Mohtashami(3), K. P. Kokhas(3), Vincent Gramoli(2), Srivatsan Ravi(2), Ichha Rathod(2), Punit Shyamsukha(2), Robert Sama(2), Alexandra Drozdova(2), Janne H. Korhonen(2), Sergey Aganezov(2)