1 citations · 1 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DB2023
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,…
cs.DC2023
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…