The following pages link to PATRICIA (Q29185):
Displaying 49 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Linear-size suffix tries (Q294967) (← links)
- Random access to Fibonacci encoded files (Q313776) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- On compressing and indexing repetitive sequences (Q390894) (← links)
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries (Q405180) (← links)
- Ultra-succinct representation of ordered trees with applications (Q414928) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- On the variance of a class of inductive valuations of data structures for digital search (Q672993) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- A compressed dynamic self-index for highly repetitive text collections (Q776840) (← links)
- A metric index for approximate string matching (Q818138) (← links)
- Efficient query processing with reduced implicate tries (Q877893) (← links)
- Smoothed heights of tries and patricia tries (Q896160) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Weighted height of random trees (Q934911) (← links)
- Data compression for proof replay (Q1040776) (← links)
- The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- Efficient multiway radix search trees (Q1350102) (← links)
- Fast searches in a recommendation session. (Q1411005) (← links)
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees (Q1612291) (← links)
- On building minimal automaton for subset matching queries (Q1675873) (← links)
- Time-space trade-offs for Lempel-Ziv compressed indexing (Q1694685) (← links)
- I/O efficient dynamic data structures for longest prefix queries (Q1939656) (← links)
- Non-blocking Patricia tries with replace operations (Q2010602) (← links)
- Flexible indexing of repetitive collections (Q2011648) (← links)
- A self-stabilizing Hashed Patricia Trie (Q2139093) (← links)
- Optimizing registration based encryption (Q2149790) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- Computing the shortest reset words of synchronizing automata (Q2354297) (← links)
- Stronger Lempel-Ziv based compressed text indexing (Q2428663) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Document listing on repetitive collections with guaranteed performance (Q2632016) (← links)
- Searching subsequences (Q2638800) (← links)
- Grammar-compressed indexes with logarithmic search time (Q2656171) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- Self-indexing Based on LZ77 (Q3011842) (← links)
- Counting Colours in Compressed Strings (Q3011854) (← links)
- Sawja: Static Analysis Workshop for Java (Q3067538) (← links)
- Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems (Q3078395) (← links)
- Self-indexed Text Compression Using Straight-Line Programs (Q3182928) (← links)
- Algorithms for Indexing Highly Similar DNA Sequences (Q3305514) (← links)
- Full-Text Indexes for High-Throughput Sequencing (Q3305517) (← links)
- Multiple choice tries and distributed hash tables (Q3633017) (← links)
- A subquadratic algorithm for 3XOR (Q5005162) (← links)
- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries (Q5150934) (← links)
- A Self-index on Block Trees (Q5150940) (← links)
- Comparative gene finding. Models, algorithms and implementation (Q5919782) (← links)
