The following pages link to Storing a sparse table (Q3049828):
Displayed 28 items.
- Smaller representation of finite state automata (Q442137) (← links)
- Flash memory efficient LTL model checking (Q617930) (← links)
- Improved behaviour of tries by adaptive branching (Q685503) (← links)
- New trie data structures which support very fast search operations (Q794438) (← links)
- Information compression and Varshamov-Gilbert bound (Q1099128) (← links)
- A greedy approximation algorithm for constructing shortest common superstrings (Q1102756) (← links)
- Order preserving extendible hashing and bucket tries (Q1157906) (← links)
- An implicit data structure for searching a multikey table in logarithmic time (Q1186547) (← links)
- A practical method for implementing string pattern matching machines (Q1193694) (← links)
- Dyn-FO: A parallel, dynamic complexity class (Q1376403) (← links)
- Perfect hashing (Q1391123) (← links)
- Finite automata for compact representation of tuple dictionaries. (Q1426158) (← links)
- Analysis of N-trees (Q1836985) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions (Q1923858) (← links)
- A fast retrieval technique for large graph structures (Q2710761) (← links)
- A practical method for compressing sparse matrices with variant entries (Q3479513) (← links)
- A Table Compression Method for Extended Aho-Corasick Automaton (Q3637345) (← links)
- A compact representation of hierarchical relations using decimal notations (Q4009745) (← links)
- An Efficient Trie Construction for Natural Language Dictionaries (Q4551463) (← links)
- Searching among intervals and compact routing tables (Q4630246) (← links)
- A link trie structure of storing multiple attribute relationships for natural language dictionaries (Q4944663) (← links)
- Tables should be sorted (on random access machines) (Q5057459) (← links)
- Nearly Optimal Static Las Vegas Succinct Dictionary (Q5080480) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- An efficient representation for implementing finite state machines based on the double-array (Q5946284) (← links)
- A fast and compact technique of implementing transition tables for finite state automata (Q5946285) (← links)
- Graphs, hypergraphs and hashing (Q6143973) (← links)