3 citations · 3 across the 3 of their papers we have counts for
3 papers · 1 filter
Provably-Efficient and Internally-Deterministic Parallel Union-Find
Alexander Fedorov, Diba Hashemi, Giorgi Nadiradze +1
Determining the degree of inherent parallelism in classical sequential algorithms and leveraging it for fast parallel execution is a key topic in parallel computing, and detailed a…
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…
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…