What is he best known for?
The fields of study he is best known for:
- Algorithm
- Artificial intelligence
- Programming language
Gonzalo Navarro mainly investigates Theoretical computer science, Algorithm, Data structure, Search engine indexing and Information retrieval.
His Theoretical computer science research incorporates elements of Tree structure, String searching algorithm, Suffix tree, Compressed suffix array and Adjacency list.
His biological study deals with issues like Approximate string matching, which deal with fields such as String metric.
His Algorithm research incorporates themes from Suffix automaton, Simple, Wavelet Tree and Pattern matching.
His Data structure study incorporates themes from Combinatorics, State, Auxiliary memory, Rank and Bitmap.
His Information retrieval research is multidisciplinary, incorporating elements of Database and Artificial intelligence.
His most cited work include:
- A guided tour to approximate string matching (2095 citations)
- Searching in metric spaces (1111 citations)
- Compressed full-text indexes (702 citations)
What are the main themes of his work throughout his whole career to date?
Gonzalo Navarro mostly deals with Algorithm, Data structure, Combinatorics, Theoretical computer science and Information retrieval.
His work in Algorithm tackles topics such as String searching algorithm which are related to areas like Approximate string matching.
His research investigates the link between Data structure and topics such as Search engine indexing that cross with problems in Data mining.
His Combinatorics study combines topics in areas such as Space, Entropy, Upper and lower bounds and Discrete mathematics.
The various areas that Gonzalo Navarro examines in his Theoretical computer science study include Graph, Succinct data structure, Metric space and Compressed suffix array.
Gonzalo Navarro has researched Information retrieval in several fields, including XML, Natural language and Index.
He most often published in these fields:
- Algorithm (30.10%)
- Data structure (30.10%)
- Combinatorics (29.61%)
What were the highlights of his more recent work (between 2018-2021)?
- Data structure (30.10%)
- Combinatorics (29.61%)
- String (8.25%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Data structure, Combinatorics, String, Theoretical computer science and Search engine indexing.
His study in the fields of Succinct data structure under the domain of Data structure overlaps with other disciplines such as Space.
Gonzalo Navarro interconnects Space and Upper and lower bounds in the investigation of issues within Combinatorics.
The concepts of his String study are interwoven with issues in RDF, Set, Document retrieval, Information retrieval and Listing.
Gonzalo Navarro has included themes like Binary relation, Representation, Structure, Rule-based machine translation and Graph in his Theoretical computer science study.
His work carried out in the field of Search engine indexing brings together such families of science as Base and Pattern matching.
Between 2018 and 2021, his most popular works were:
- Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space (31 citations)
- Universal compressed text indexing (29 citations)
- RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy (21 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Artificial intelligence
- Programming language
His primary areas of study are Data structure, Combinatorics, Upper and lower bounds, Theoretical computer science and Binary logarithm.
His work deals with themes such as Embedding, Reachability, Planar graph, String and Search engine indexing, which intersect with Data structure.
His Search engine indexing research is multidisciplinary, incorporating perspectives in Base, Algorithm and Set.
His Combinatorics study integrates concerns from other disciplines, such as Bounded function, Suffix tree and Constant.
His Theoretical computer science study which covers Structure that intersects with Joins and Point.
His studies deal with areas such as Space, Parsing and Attractor as well as Binary logarithm.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
