3 citations · 3 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
Weighted Matching in the Random-Order Streaming and Robust Communication Models
Diba Hashemi, Weronika Wrzos-Kaminska
We study the maximum weight matching problem in the random-order semi-streaming model and in the robust communication model. Unlike many other sublinear models, in these two framew…
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…