1 citations · 2 across the 4 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
On the Streaming Complexity of Expander Decomposition
Yu Chen, Michael Kapralov, Mikhail Makarov +1
In this paper we study the problem of finding -expander decompositions of a graph in the streaming model, in particular for dynamic streams of edge insertions and deletions…
cs.DS2024★ 1 cited
On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
Michael Kapralov, Mikhail Makarov, Christian Sohler
Locality-sensitive hashing~[Indyk,Motwani'98] is a classical data structure for approximate nearest neighbor search. It allows, after a close to linear time preprocessing of the in…