Виталий Аксенов
Компания: Университет ИТМО
In this talk, we cover on how to design concurrent Binary Search Trees starting from the simplest ones. Hopefully, after this talk the attendee will understand the standard tricks necessary for the implementation of Binary Search Trees. These tricks are important and can help to implement other more complex data structures.
Компания: Университет ИТМО
Компания: JUG Ru Group