Cited in
(69)- Ultra-succinct representation of ordered trees with applications
- Winnowing
- Space-efficient construction of Lempel-Ziv compressed text indexes
- The smallest automaton recognizing the subwords of a text
- Time-space trade-offs for Lempel-Ziv compressed indexing
- A compressed dynamic self-index for highly repetitive text collections
- Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
- Stronger Lempel-Ziv based compressed text indexing
- A self-stabilizing hashed Patricia trie
- On the variance of a class of inductive valuations of data structures for digital search
- Self-indexing based on LZ77
- Weighted height of random trees
- Self-indexed Text Compression Using Straight-Line Programs
- Efficient query processing with reduced implicate tries
- Sawja: static analysis workshop for Java
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
- Counting Colours in Compressed Strings
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Forms of representation for simple games: sizes, conversions and equivalences
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- COMPAS
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- Sawja
- TESTAS
- Smoothed heights of tries and patricia tries
- Pastry
- Wumpus
- GLIMPSE
- Quilt
- WordSpy
- AsterixDB
- Barista
- A metric index for approximate string matching
- MonetDB
- Vertica
- BUbiNG
- Lorel
- Lore
- Fiona
- MicroRazerS
- r-index
- STELLAR
- Algorithms for indexing highly similar DNA sequences
- On compressing and indexing repetitive sequences
- Document listing on repetitive collections with guaranteed performance
- On suffix extensions in suffix trees
- On building minimal automaton for subset matching queries
- Computing the shortest reset words of synchronizing automata
- Random access to Fibonacci encoded files
- Efficient multiway radix search trees
- I/O efficient dynamic data structures for longest prefix queries
- Searching subsequences
- Data compression for proof replay
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Practical implementation of space-efficient dynamic keyword dictionaries
- A self-index on block trees
- Space-efficient substring occurrence estimation
- Colored range queries and document retrieval
- Grammar-compressed indexes with logarithmic search time
- Non-blocking Patricia tries with replace operations
- Flexible indexing of repetitive collections
- Fast searches in a recommendation session.
- Linear-size suffix tries
- Optimizing registration based encryption
- Parallel construction and query of index data structures for pattern matching on square matrices
- A subquadratic algorithm for 3XOR
- Full-text indexes for high-throughput sequencing
- Comparative gene finding. Models, algorithms and implementation
- Multiple choice tries and distributed hash tables
This page was built for software: PATRICIA
