The following pages link to Gonzalo Navarro (Q270015):
Displaying 50 items.
- (Q196679) (redirect page) (← links)
- Optimal encodings for range majority queries (Q270016) (← links)
- Very fast and simple approximate string matching (Q294703) (← links)
- Reporting consecutive substring occurrences under bounded gap constraints (Q294948) (← links)
- Parallel family trees for transfer matrices in the Potts model (Q337713) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- On compressing permutations and adaptive sorting (Q391981) (← links)
- String matching with alphabet sampling (Q414445) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- The longest common extension problem revisited and applications to approximate string searching (Q616995) (← links)
- On-line approximate string matching with bounded errors (Q653329) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Tree path majority data structures (Q784481) (← links)
- A metric index for approximate string matching (Q818138) (← links)
- Indexing text using the Ziv--Lempel trie (Q876708) (← links)
- Probabilistic proximity searching algorithms based on compact partitions (Q876710) (← links)
- Practical and flexible pattern matching over Ziv-Lempel compressed text. (Q878012) (← links)
- On sorting, heaps, and minimum spanning trees (Q973020) (← links)
- Parameterized matching on non-linear structures (Q989510) (← links)
- Faster entropy-bounded compressed suffix trees (Q1038474) (← links)
- New bounds on \(D\)-ary optimal codes (Q1044733) (← links)
- Faster approximate string matching (Q1277393) (← links)
- Bounding the expected length of longest common subsequences and forests (Q1293550) (← links)
- Optimal binary search trees with costs depending on the access paths. (Q1401195) (← links)
- Approximate matching of run-length compressed strings (Q1402213) (← links)
- Improved approximate pattern matching on hypertext (Q1566744) (← links)
- Approximate string matching with compressed indexes (Q1662494) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- Path queries on functions (Q1740690) (← links)
- LRM-trees: compressed indices, adaptive sorting, and compressed permutations (Q1758161) (← links)
- New techniques for regular expression searching (Q1763149) (← links)
- Bit-parallel witnesses and their applications to approximate string matching (Q1763154) (← links)
- Regular expression searching on compressed text (Q1827268) (← links)
- Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
- Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. (Q1853173) (← links)
- Fixed queries array: A fast and economical data structure for proximity searching (Q1857244) (← links)
- Average complexity of exact and approximate multiple string matching (Q1885904) (← links)
- Binary searching with nonuniform costs and its application to text retrieval (Q1977134) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
