The Mergegram of a Dendrogram and Its Stability. - Yury Elkin; Vitaliy Kurlin (MFCS, 2020)

A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space. - Yury Elkin; Di Liu; Vitaliy Kurlin (CoRR, 2020)

Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence. - Yury Elkin; Vitaliy Kurlin (CoRR, 2021)

A new compressed cover tree guarantees a near linear parameterized complexity for all $k$-nearest neighbors search in metric spaces. - Yury Elkin; Vitaliy Kurlin (CoRR, 2021)

Paired compressed cover trees guarantee a near linear parametrized complexity for all k-nearest neighbors search in an arbitrary metric space. - Yury Elkin; Vitaliy Kurlin (CoRR, 2022)

New compressed cover tree for k-nearest neighbor search. - Yury Elkin (CoRR, 2022)

Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006. - Yury Elkin; Vitaliy Kurlin (CoRR, 2022)

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree. - Yury Elkin; Vitaliy Kurlin (ICML, 2023)