2 papers
cs.DS2021
A Scalable Concurrent Algorithm for Dynamic Connectivity
Alexander Fedorov, Nikita Koval, Dan Alistarh
Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in vari…
cs.DS2019
In Search of the Fastest Concurrent Union-Find Algorithm
Dan Alistarh, Alexander Fedorov, Nikita Koval
Union-Find (or Disjoint-Set Union) is one of the fundamental problems in computer science; it has been well-studied from both theoretical and practical perspectives in the sequenti…