26 citations · 50 across the 20 of their papers we have counts for
1 paper · 1 filter
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,…