Concurrent hash tables — why should I understand them?

During this talk we will touch on an important topic — should we as developers understand the data structures we use and what this knowledge can give us? Using the example of simple, practical, and interesting hash table algorithm proposed by Cliff Click about fifteen years ago we will see what this knowledge gives us in certain usage scenarios and try to use the same algorithmic approaches for other tasks.

Nikita Koval

Nikita is a researcher in the Kotlin team and has been getting a Ph.D. in the field of concurrency. His primary research interests are, but not limited to, concurrent data structures and algorithms, their verification, and practically applicable code analysis. He is also a frequent speaker at JPoint and Joker conferences.

Nikita Koval JetBrains