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