Andrey Logvinov

Algorithms & Complexity · 2012–2014

A researcher in the Science corpus: 2 papers; trusts 11 researchers and is trusted by 15 researchers here, as inferred from the citation graph.

Subfields

• Algorithms & Complexity — 11 citations into it
• Information Retrieval & Search — 11 citations into it; #306 of 1,022 by trust here, #492 by citations
• Signal Processing — 9 citations into it; #1,801 of 7,572 by trust here, #2,525 by citations
• Computer Vision and Pattern Recognition — 8 citations into it; #9,837 of 21,575 by trust here, #13,269 by citations
• Artificial Intelligence — 7 citations into it; #15,405 of 35,345 by trust here, #19,873 by citations
• Computational Theory and Mathematics — 5 citations into it
• Computer Graphics and Computer-Aided Design — 5 citations into it; #1,050 of 1,584 by trust here, #1,084 by citations

Whom Andrey Logvinov trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Franz Aurenhammer
2. Edgar Chávez
3. Gonzalo Navarro
4. Olivier Beaumont
5. Jon M. Kleinberg
6. Sunil Arya
7. Eric Sadit Tellez
8. Anne-Marie Kermarrec

Who trusts Andrey Logvinov overall

1. Alexander Ponomarenko
2. Yury Malkov
3. Bilegsaikhan Naidan
4. Yu A. Malkov
5. Guillermo Ruiz
6. Dmitry A. Yashunin
7. Ben Harwood
8. Augustus Odena
9. Edgar Chávez

Papers from Andrey Logvinov's perspective

Ordered by how strongly the researchers Andrey Logvinov trusts endorse each paper. Same corpus, a different order for every researcher.

1. Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
2. The small-world phenomenon: an algorithmic perspective
3. Approximate nearest neighbor queries in fixed dimensions
4. Multidimensional binary search trees used for associative searching
5. Collective dynamics of ‘small-world’ networks
6. Similarity Search in High Dimensions via Hashing
7. An optimal algorithm for approximate nearest neighbor searching fixed dimensions
8. Succinct nearest neighbor search
9. Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces
10. Effective Proximity Retrieval by Ordering Permutations

Their papers

• Approximate nearest neighbor algorithm based on navigable small world graphs (2014) — 465 citations
• Scalable Distributed Algorithm for Approximate Nearest Neighbor Search Problem in High Dimensional General Metric Spaces (2012) — 55 citations