PATRICIA
From MaRDI portal
Software:29185
swMATH17325MaRDI QIDQ29185FDOQ29185
Author name not available (Why is that?)
Cited In (49)
- Space-efficient substring occurrence estimation
- Colored range queries and document retrieval
- Multiple choice tries and distributed hash tables
- Ultra-succinct representation of ordered trees with applications
- Weighted height of random trees
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Fast searches in a recommendation session.
- On the variance of a class of inductive valuations of data structures for digital search
- Sawja: Static Analysis Workshop for Java
- Non-blocking Patricia tries with replace operations
- Flexible indexing of repetitive collections
- On suffix extensions in suffix trees
- Linear-size suffix tries
- Parallel construction and query of index data structures for pattern matching on square matrices
- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
- Full-Text Indexes for High-Throughput Sequencing
- Document listing on repetitive collections with guaranteed performance
- On compressing and indexing repetitive sequences
- A self-stabilizing Hashed Patricia Trie
- Efficient query processing with reduced implicate tries
- A metric index for approximate string matching
- Random access to Fibonacci encoded files
- Optimizing registration based encryption
- The smallest automaton recognizing the subwords of a text
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- A Self-index on Block Trees
- Stronger Lempel-Ziv based compressed text indexing
- Smoothed heights of tries and patricia tries
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Grammar-compressed indexes with logarithmic search time
- Self-indexing Based on LZ77
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems
- Algorithms for Indexing Highly Similar DNA Sequences
- Self-indexed Text Compression Using Straight-Line Programs
- On building minimal automaton for subset matching queries
- I/O efficient dynamic data structures for longest prefix queries
- A compressed dynamic self-index for highly repetitive text collections
- Computing the shortest reset words of synchronizing automata
- Data compression for proof replay
- Efficient multiway radix search trees
- Searching subsequences
- Time-space trade-offs for Lempel-Ziv compressed indexing
- A subquadratic algorithm for 3XOR
- Comparative gene finding. Models, algorithms and implementation
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Forms of representation for simple games: sizes, conversions and equivalences
- Counting Colours in Compressed Strings
This page was built for software: PATRICIA