908 citations · 2.4k across the 149 of their papers we have counts for
Showing 2023 · cs.DSShow all
2 papers · 2 filters
cs.DS2023
Efficient Self-Adjusting Search Trees via Lazy Updates
Alexander Slastin, Dan Alistarh, Vitaly Aksenov
Self-adjusting data structures are a classic approach to adapting the complexity of operations to the data access distribution. While several self-adjusting variants are known for…
cs.DS2023★ 3 cited
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…