1 citations · 1 across the 5 of their papers we have counts for
6 papers
Model-based Testing of Practical Distributed Systems in Actor Model
Ilya Kokorin, Evgeny Chernatskiy, Vitaly Aksenov
Designing and implementing distributed systems correctly can be quite challenging. Although these systems are often accompanied by formal specifications that are verified using mod…
Wait-free Trees with Asymptotically-Efficient Range Queries
Ilya Kokorin, Dan Alistarh, Vitaly Aksenov
Tree data structures, such as red-black trees, quad trees, treaps, or tries, are fundamental tools in computer science. A classical problem in concurrency is to obtain expressive,…
Parallel-batched Interpolation Search Tree
Ilya Kokorin, Vitaly Aksenov, Alena Martsenyuk
A sorted set (or map) is one of the most used data types in computer science. In addition to standard set operations, like Insert, Remove, and Contains, it can provide set-set oper…
Unexpected Scaling in Path Copying Trees
Ilya Kokorin, Alexander Fedorov, Trevor Brown +1
Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (henceforth called Universal Constructi…
Parallel Batched Interpolation Search Tree
Vitaly Aksenov, Ilya Kokorin, Alena Martsenyuk
Ordered set (and map) is one of the most used data type. In addition to standard set operations, like insert, delete and contains, it can provide set-set operations such as union,…
Execution of NVRAM Programs with Persistent Stack
Vitaly Aksenov, Ohad Ben-Baruch, Danny Hendler +2
Non-Volatile Random Access Memory (NVRAM) is a novel type of hardware that combines the benefits of traditional persistent memory (persistency of data over hardware failures) and D…