Vitaly Aksenov

1. Skip Hash: A Fast Ordered Map Via Software Transactional Memory
   2024/10/09 by Matthew Rodriguez, Rodriguez, Matthew, Vitaly Aksenov +3 · 1 voice
   Computer Science · #Algorithms and Data Compression #Network Packet Processing and Optimization #Network Security and Intrusion Detection #cs.DC #cs.DS
2. A Concurrency-Optimal Binary Search Tree
   2017/02/15 by Vitaly Aksenov, Aksenov, Vitaly, Vincent Gramoli +7 · 1 citation
   Computer Science · #Distributed #Distributed and Parallel Computing Systems #Distributed systems and fault tolerance #FOS: Computer and information sciences #Parallel #Parallel Computing and Optimization Techniques #and Cluster Computing (cs.DC)
3. Efficient Self-Adjusting Search Trees via Lazy Updates
   2023/10/08 by Alexander Slastin, Dan Alistarh, Slastin, Alexander +3 · 1 citation
   Computer Science · #Algorithms and Data Compression #Distributed systems and fault tolerance #Cloud Computing and Resource Management