Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Vitaly Aksenov

Vitaly Aksenov

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Distributed×2Algorithms×1

Frequent co-authors

Rene van Bevern1×
Artem Shilkin1×
Denis Korotchenko1×

Research Timeline

2026
Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph

A new lock, SemanticLock, is proposed based on conflict graphs between operations, demonstrated effective in two applications: a toy data structure and ConcurrentHashMap.

Concurrent Splay-Based Tree

This paper proposes a splay-like rotation design for concurrent binary search trees to preserve the main benefit of splaying on skewed workloads while reducing contention near the root.

Highlighted terms show continued research focus across papers

Papers

cs.DCcs.DSEmpiricalRecentJun 27, 2026

Concurrent Splay-Based Tree

Vitaly Aksenov, Rene van Bevern, Artem Shilkin

This paper proposes a splay-like rotation design for concurrent binary search trees to preserve the main benefit of splaying on skewed workloads while reducing contention near the root.

View →
cs.DCEmpiricalRecent
Jun 23, 2026

Semantic Lock: Synchronization Based on the Analysis of the Operation Conflict Graph

Denis Korotchenko, Vitaly Aksenov

A new lock, SemanticLock, is proposed based on conflict graphs between operations, demonstrated effective in two applications: a toy data structure and ConcurrentHashMap.

View →