Yury Elkin

According to our database, Yury Elkin authored at least 8 papers between 2020 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree.

Yury Elkin, Vitaliy Kurlin

Proceedings of the International Conference on Machine Learning, 2023

2022

Counterexamples expose gaps in the proof of time complexity for cover trees introduced in 2006.

Yury Elkin, Vitaliy Kurlin

CoRR, 2022

New compressed cover tree for k-nearest neighbor search.

Yury Elkin

CoRR, 2022

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

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

Isometry invariant shape recognition of projectively perturbed point clouds by the mergegram extending 0D persistence.

Yury Elkin, Vitaliy Kurlin

CoRR, 2021

2020

A fast approximate skeleton with guarantees for any cloud of points in a Euclidean space.

Yury Elkin, Di Liu, Vitaliy Kurlin

CoRR, 2020

The Mergegram of a Dendrogram and Its Stability.

Yury Elkin, Vitaliy Kurlin

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020