Gonzalo Navarro
Artificial Intelligence · 1999–2016
A researcher in the Science corpus: 10 papers; trusts 35 researchers and is trusted by 120 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 35 citations into it; #2,839 of 36,961 by trust here, #8,979 by citations
- Theoretical Computer Science — 25 citations into it
- Algorithms & Complexity — 22 citations into it; #89 of 516 by trust here, #218 by citations
- Information Retrieval & Search — 21 citations into it; #107 of 1,022 by trust here, #380 by citations
- Molecular Biology — 19 citations into it; #249 of 17,836 by trust here, #8,334 by citations
- Computer Vision and Pattern Recognition — 18 citations into it; #3,940 of 21,973 by trust here, #6,105 by citations
- Information Systems — 14 citations into it; #622 of 9,233 by trust here, #4,335 by citations
- Signal Processing — 14 citations into it; #1,031 of 7,592 by trust here, #1,301 by citations
Whom Gonzalo Navarro trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Giovanni Manzini
- Paolo Ferragina
- Peter Elias
- Alfred V. Aho
- Hanan Samet
- John E. Hopcroft
- Juha Kärkkäinen
- Pang Ko
- Donald Ervin Knuth
- Franz Aurenhammer
Who trusts Gonzalo Navarro overall
- Peter Christen
- Edgar Chávez
- Eric Sadit Tellez
- Yury Malkov
- Kenneth L. Clarkson
- Mark P. J. van der Loo
- Michael E. Houle
- Lei Chen
- Alexander Ponomarenko
- Carl Mooney
Papers from Gonzalo Navarro's perspective
Ordered by how strongly the researchers Gonzalo Navarro trusts endorse each paper. Same corpus, a different order for every researcher.
- A Block-sorting Lossless Data Compression Algorithm
- Succinct indexable dictionaries with applications to encoding k-ary trees and multisets (ACM-SIAM Symposium on Discrete Algorithms)
- High-order entropy-compressed text indexes
- Multidimensional binary search trees used for associative searching
- Indexing compressed text (JACM)
- Replacing suffix trees with enhanced suffix arrays (J. Discrete Algorithms)
- An analysis of the Burrows-Wheeler transform (ACM-SIAM Symposium on Discrete Algorithms)
- Linear Pattern Matching Algorithms
- Data structures and algorithms for nearest neighbor search in general metric spaces
- Similarity Search in High Dimensions via Hashing
Their papers
- A guided tour to approximate string matching (2001) — 2,935 citations
- Compressed full-text indexes (2007) — 773 citations
- Compressed representations of sequences and full-text indexes (2007) — 372 citations
- Compact Data Structures - A Practical Approach (2016) — 388 citations
- Near neighbor searching with K nearest references (2015) — 31 citations
- Succinct nearest neighbor search (2011) — 42 citations
- Effective Proximity Retrieval by Ordering Permutations (2008) — 197 citations
- Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences (2002) — 461 citations
- Searching in metric spaces (2001) — 1,372 citations
- Searching in metric spaces by spatial approximation (1999)