Gonzalo Navarro

Available identifiers

zbMath Open navarro.gonzaloDBLPn/GonzaloNavarroWikidataQ63033736 ScholiaQ63033736MaRDI QIDQ270015

List of research outcomes

Publication	Date of Publication	Type
Bi-directional \(r\)-indexes	2024-05-06	Paper
Efficient construction of the BWT for repetitive text using string compression	2024-05-06	Paper
Grammar Compression by Induced Suffix Sorting	2024-04-14	Paper
Near-optimal search time in \(\delta \)-optimal space, and vice versa	2024-04-02	Paper
Toward a Definitive Compressibility Measure for Repetitive Sequences	2024-03-19	Paper
Efficient construction of the BWT for repetitive text using string compression	2023-09-27	Paper
Balancing run-length straight-line programs	2023-08-04	Paper
Near-optimal search time in \(\delta \)-optimal space	2023-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q6098784	2023-06-14	Paper
Compact representations of spatial hierarchical structures with support for topological queries	2023-05-19	Paper
Optimized binary search and text retrieval	2023-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q5874375	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5874454	2023-02-07	Paper
Contextual Pattern Matching	2022-12-22	Paper
Practical Random Access to SLP-Compressed Texts	2022-12-22	Paper
Navigating planar topologies in near-optimal space and time	2022-11-16	Paper
Towards a definitive measure of repetitiveness	2022-10-13	Paper
Faster compressed quadtrees	2022-10-13	Paper
Engineering Practical Lempel-Ziv Tries	2022-09-06	Paper
Multiple approximate string matching	2022-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q5091063	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5088917	2022-07-18	Paper
An LMS-based grammar self-index with local consistency properties	2022-06-15	Paper
On stricter reachable repetitiveness measures	2022-06-15	Paper
Faster repetition-aware compressed suffix trees based on block trees	2022-06-08	Paper
A practical succinct dynamic graph representation	2022-06-08	Paper
Efficient and compact representations of some non-canonical prefix-free codes	2022-02-21	Paper
Optimal-Time Dictionary-Compressed Indexes	2022-02-08	Paper
Compact structure for sparse undirected graphs based on a clique graph partition	2021-11-30	Paper
Range majorities and minorities in arrays	2021-06-11	Paper
Grammar-compressed indexes with logarithmic search time	2021-03-10	Paper
On the Approximation Ratio of Ordered Parsings	2021-02-24	Paper
LZ78 Compression in Low Main Memory Space	2021-02-16	Paper
Efficient Compression and Indexing of Trajectories	2021-02-16	Paper
A Self-index on Block Trees	2021-02-16	Paper
Block trees	2021-02-02	Paper
PFP Compressed Suffix Trees	2021-01-27	Paper
Fast Compressed Self-Indexes with Deterministic Linear-Time Construction	2020-11-25	Paper
GraCT: a grammar-based compressed index for trajectory data	2020-11-24	Paper
Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs Bounded Space	2020-11-11	Paper
Fast and compact planar embeddings	2020-10-23	Paper
Lempel-Ziv-like parsing in small space	2020-10-21	Paper
Tree path majority data structures	2020-08-03	Paper
Document Listing on Repetitive Collections with Guaranteed Performance	2020-05-25	Paper
Path queries on functions	2020-05-25	Paper
Compressed dynamic range majority and minority data structures	2020-05-21	Paper
Fast compressed self-indexes with deterministic linear-time construction	2020-04-09	Paper
Parallel computation of the Burrows Wheeler transform in compact space	2020-02-20	Paper
Ranked document selection	2020-02-20	Paper
On the approximation ratio of Lempel-Ziv parsing	2020-02-12	Paper
Lempel-Ziv compressed structures for document retrieval	2019-09-17	Paper
Improved Single-Term Top-k Document Retrieval	2019-09-12	Paper
Optimal Incremental Sorting	2019-09-11	Paper
Succinct Trees in Practice	2019-09-11	Paper
RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy	2019-07-19	Paper
Document listing on repetitive collections with guaranteed performance	2019-05-17	Paper
Optimal Dynamic Sequence Representations	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q5743458	2019-05-10	Paper
Path queries on functions	2019-05-02	Paper
Practical compressed suffix trees	2019-03-26	Paper
Universal compressed text indexing	2019-02-28	Paper
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries	2018-11-05	Paper
Dynamic entropy-compressed sequences and full-text indexes	2018-11-05	Paper
Alphabet-Independent Compressed Text Indexing	2018-10-30	Paper
Optimal Lower and Upper Bounds for Representing Sequences	2018-10-30	Paper
Efficient and compact representations of some non-canonical prefix-free codes	2018-10-17	Paper
Approximate string matching with compressed indexes	2018-08-20	Paper
Space-Efficient Construction of Compressed Indexes in Deterministic Linear Time	2018-07-16	Paper
https://portal.mardi4nfdi.de/entity/Q4607985	2018-03-15	Paper
Fast and compact planar embeddings	2017-09-22	Paper
Top-\(k\) term-proximity in succinct space	2017-07-07	Paper
Practical Compact Indexes for Top-kDocument Retrieval	2017-07-03	Paper
Faster Compressed Suffix Trees for Repetitive Collections	2017-06-16	Paper
Dynamic spatial approximation trees	2017-06-15	Paper
A succinct data structure for self-indexing ternary relations	2017-05-29	Paper
Grammar compressed sequences with rank/select support	2017-05-29	Paper
Improved range minimum queries	2017-05-29	Paper
Efficient and Compact Representations of Prefix Codes	2017-04-28	Paper
Asymptotically Optimal Encodings for Range Selection	2017-04-25	Paper
Time-Optimal Top-$k$ Document Retrieval	2017-02-15	Paper
Simple and efficient fully-functional succinct trees	2017-02-06	Paper
Encoding range minima and range top-2 queries	2017-01-13	Paper
Parallel family trees for transfer matrices in the Potts model	2016-11-10	Paper
Locally Compressed Suffix Arrays	2016-10-24	Paper
General Document Retrieval in Compact Space	2016-10-24	Paper
Very fast and simple approximate string matching	2016-06-16	Paper
Reporting consecutive substring occurrences under bounded gap constraints	2016-06-16	Paper
Fully Functional Static and Dynamic Succinct Trees	2016-04-11	Paper
Optimal encodings for range majority queries	2016-04-06	Paper
Top-$$k$$ Term-Proximity in Succinct Space	2015-09-11	Paper
Compressed representations of sequences and full-text indexes	2015-09-02	Paper
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints	2015-08-20	Paper
Improved and extended locating functionality on compressed suffix arrays	2015-05-04	Paper
Bottom-\(k\) document retrieval	2015-05-04	Paper
Spaces, Trees, and Colors	2015-03-02	Paper
Optimal Dynamic Sequence Representations	2015-02-09	Paper
Efficient fully-compressed sequence representations	2014-11-19	Paper
Document Retrieval on Repetitive Collections	2014-10-08	Paper
Fully compressed suffix trees	2014-09-09	Paper
Ranked Document Selection	2014-09-02	Paper
Indexing Highly Repetitive Collections	2014-08-19	Paper
Encodings for Range Majority Queries	2014-06-30	Paper
New space/time tradeoffs for top-\(k\) document retrieval on sequences	2014-06-23	Paper
https://portal.mardi4nfdi.de/entity/Q5417613	2014-05-22	Paper
Maximum-weight planar boxes in \(O(n^2)\) time (and better)	2014-04-30	Paper
Wavelet trees for all	2014-04-01	Paper
Implementing the LZ-index	2014-04-01	Paper
Compressed text indexes	2014-04-01	Paper
Speeding up spatial approximation search in metric spaces	2014-04-01	Paper
Practical approaches to reduce the space requirement of lempel-ziv--based compressed text indices	2014-04-01	Paper
Top-k Document Retrieval in Compact Space and Near-Optimal Time	2014-01-14	Paper
On compressing permutations and adaptive sorting	2014-01-13	Paper
Colored range queries and document retrieval	2014-01-09	Paper
On compressing and indexing repetitive sequences	2014-01-09	Paper
Space-efficient data-analysis queries on grids	2014-01-09	Paper
Entropy-bounded representation of point grids	2014-01-08	Paper
Compact binary relation representations with rich functionality	2013-12-13	Paper
Encodings for Range Selection and Top-k Queries	2013-09-17	Paper
Better Space Bounds for Parameterized Range Majority and Minority	2013-08-12	Paper
Improved compressed indexes for full-text document retrieval	2013-06-24	Paper
Document Listing on Repetitive Collections	2013-06-14	Paper
LRM-trees: compressed indices, adaptive sorting, and compressed permutations	2012-11-08	Paper
New Lower and Upper Bounds for Representing Sequences	2012-09-25	Paper
Wavelet Trees for All	2012-08-14	Paper
Sorted Range Reporting	2012-08-14	Paper
New algorithms on wavelet trees and applications to information retrieval	2012-05-30	Paper
String matching with alphabet sampling	2012-05-11	Paper
Stronger Lempel-Ziv based compressed text indexing	2012-04-26	Paper
COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS	2012-04-24	Paper
Self-Indexed Grammar-Based Compression	2012-03-22	Paper
On-line approximate string matching with bounded errors	2012-01-09	Paper
Space-Efficient Data-Analysis Queries on Grids	2011-12-16	Paper
Alphabet-Independent Compressed Text Indexing	2011-09-16	Paper
Space-efficient construction of Lempel-Ziv compressed text indexes	2011-07-18	Paper
STRONGER QUICKHEAPS	2011-07-14	Paper
Self-indexing Based on LZ77	2011-06-29	Paper
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations	2011-06-29	Paper
The longest common extension problem revisited and applications to approximate string searching	2011-01-20	Paper
Alphabet Partitioning for Compressed Rank/Select and Applications	2010-12-09	Paper
Entropy-Bounded Representation of Point Grids	2010-12-09	Paper
Top-k Ranked Document Search in General Text Databases	2010-09-06	Paper
Parameterized matching on non-linear structures	2010-08-20	Paper
Parallel and Distributed Compressed Indexes	2010-07-26	Paper
https://portal.mardi4nfdi.de/entity/Q3565915	2010-06-07	Paper
On sorting, heaps, and minimum spanning trees	2010-05-28	Paper
Extended Compact Web Graph Representations	2010-05-04	Paper
Compact Rich-Functional Binary Relation Representations	2010-04-27	Paper
Average-Optimal Multiple Approximate String Matching	2010-04-06	Paper
String Processing and Information Retrieval	2010-02-09	Paper
String Processing and Information Retrieval	2010-02-09	Paper
String Processing and Information Retrieval	2010-02-09	Paper
String Processing and Information Retrieval	2010-02-09	Paper
Improving Semistatic Compression Via Pair-Based Coding	2010-02-02	Paper
Fast and Compact Prefix Codes	2010-01-28	Paper
New bounds on \(D\)-ary optimal codes	2009-12-18	Paper
Faster entropy-bounded compressed suffix trees	2009-11-18	Paper
Self-indexed Text Compression Using Straight-Line Programs	2009-10-16	Paper
Rank/select on dynamic compressed sequences and applications	2009-10-09	Paper
Algorithms and Computation	2009-08-07	Paper
Storage and Retrieval of Individual Genomes	2009-06-03	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections	2009-01-27	Paper
An Index Data Structure for Searching in Metric Space Databases	2008-12-09	Paper
Position-Restricted Substring Searching	2008-09-18	Paper
Increased bit-parallelism for approximate and multiple string matching	2008-06-20	Paper
A Lempel-Ziv Text Index on Secondary Storage	2008-06-17	Paper
Compressed Text Indexes with Fast Locate	2008-06-17	Paper
On-Line Approximate String Matching with Bounded Errors	2008-06-17	Paper
An(other) Entropy-Bounded Compressed Suffix Tree	2008-06-17	Paper
Dynamic Fully-Compressed Suffix Trees	2008-06-17	Paper
Fully-Compressed Suffix Trees	2008-04-15	Paper
Improved Dynamic Rank-Select Entropy-Bound Structures	2008-04-15	Paper
Rank and select revisited and extended	2007-12-19	Paper
https://portal.mardi4nfdi.de/entity/Q5421904	2007-10-24	Paper
Statistical Encoding of Succinct Data Structures	2007-09-14	Paper
Dynamic Entropy-Compressed Sequences and Full-Text Indexes	2007-09-14	Paper
Reducing the Space Requirement of LZ-Index	2007-09-14	Paper
Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces	2007-09-14	Paper
On the Least Cost for Proximity Searching in Metric Spaces	2007-09-14	Paper
Pattern Matching	2007-09-11	Paper
Rotation and lighting invariant template matching	2007-07-16	Paper
Indexing text using the Ziv--Lempel trie	2007-04-26	Paper
Probabilistic proximity searching algorithms based on compact partitions	2007-04-26	Paper
Practical and flexible pattern matching over Ziv-Lempel compressed text.	2007-04-25	Paper
BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS	2007-02-08	Paper
FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME	2007-02-08	Paper
A SIMPLE ALPHABET-INDEPENDENT FM-INDEX	2007-02-08	Paper
Algorithms and Computation	2006-11-14	Paper
String Processing and Information Retrieval	2006-10-24	Paper
String Processing and Information Retrieval	2006-10-24	Paper
String Processing and Information Retrieval	2006-10-24	Paper
String Processing and Information Retrieval	2006-10-24	Paper
A metric index for approximate string matching	2006-03-24	Paper
Sequential and indexed two-dimensional combinatorial template matching allowing rotations	2005-12-29	Paper
Algorithms and Computation	2005-12-22	Paper
Combinatorial Pattern Matching	2005-12-14	Paper
https://portal.mardi4nfdi.de/entity/Q5708460	2005-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q5705142	2005-11-08	Paper
Indexing text with approximate \(q\)-grams	2005-10-27	Paper
Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata	2005-10-27	Paper
Practical algorithms for transposition-invariant string-matching	2005-10-27	Paper
Transposition invariant string matching	2005-09-28	Paper
Combinatorial Pattern Matching	2005-09-07	Paper
Combinatorial Pattern Matching	2005-09-07	Paper
Fast and flexible string matching by combining bit-parallelism and suffix automata	2005-08-04	Paper
Average-optimal single and multiple approximate string matching	2005-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q3024795	2005-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q3024807	2005-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q3024813	2005-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q4672369	2005-04-29	Paper
https://portal.mardi4nfdi.de/entity/Q4661877	2005-03-30	Paper
https://portal.mardi4nfdi.de/entity/Q4662850	2005-03-30	Paper
New techniques for regular expression searching	2005-02-21	Paper
Bit-parallel witnesses and their applications to approximate string matching	2005-02-21	Paper
Theory Is Forever	2005-01-18	Paper
Average complexity of exact and approximate multiple string matching	2004-11-12	Paper
https://portal.mardi4nfdi.de/entity/Q3044326	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4737701	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4737703	2004-08-11	Paper
Regular expression searching on compressed text	2004-08-06	Paper
Approximate string matching on Ziv--Lempel compressed text	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4432971	2003-10-29	Paper
https://portal.mardi4nfdi.de/entity/Q4424240	2003-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4424241	2003-09-04	Paper
Approximate matching of run-length compressed strings	2003-08-19	Paper
Optimal binary search trees with costs depending on the access paths.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4418649	2003-08-11	Paper
Pivot selection techniques for proximity searching in metric spaces	2003-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q4801188	2003-04-07	Paper
Fixed queries array: A fast and economical data structure for proximity searching	2003-02-17	Paper
Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.	2003-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q4785570	2003-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q4536411	2002-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4552046	2002-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4547733	2002-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4547735	2002-08-21	Paper
https://portal.mardi4nfdi.de/entity/Q4534878	2002-06-12	Paper
New and faster filters for multiple approximate string matching	2002-06-05	Paper
NR‐grep: a fast and flexible pattern‐matching tool	2002-04-24	Paper
Improving an algorithm for approximate pattern matching	2001-08-09	Paper
https://portal.mardi4nfdi.de/entity/Q2723949	2001-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q2723951	2001-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q2723965	2001-07-08	Paper
Improved approximate pattern matching on hypertext	2000-06-04	Paper
Binary searching with nonuniform costs and its application to text retrieval	2000-05-09	Paper
Bounding the expected length of longest common subsequences and forests	1999-06-28	Paper
Faster approximate string matching	1999-06-07	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Gonzalo Navarro