Storing a sparse table
From MaRDI portal
Publication:3049828
DOI10.1145/359168.359175zbMath0414.68038OpenAlexW2051049045MaRDI QIDQ3049828
Andrew Chi-Chih Yao, Robert Endre Tarjan
Publication date: 1979
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359168.359175
Related Items
Enumeration for FO Queries over Nowhere Dense Graphs, Tables should be sorted (on random access machines), Information compression and Varshamov-Gilbert bound, Searching among intervals and compact routing tables, An Efficient Trie Construction for Natural Language Dictionaries, A greedy approximation algorithm for constructing shortest common superstrings, Searching among intervals and compact routing tables, Nearly Optimal Static Las Vegas Succinct Dictionary, A compact representation of hierarchical relations using decimal notations, A practical method for compressing sparse matrices with variant entries, Dyn-FO: A parallel, dynamic complexity class, Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions, Perfect hashing, Flash memory efficient LTL model checking, Graphs, hypergraphs and hashing, Order preserving extendible hashing and bucket tries, Smaller representation of finite state automata, A fast retrieval technique for large graph structures, Finite automata for compact representation of tuple dictionaries., An implicit data structure for searching a multikey table in logarithmic time, A practical method for implementing string pattern matching machines, Improved behaviour of tries by adaptive branching, An efficient representation for implementing finite state machines based on the double-array, A fast and compact technique of implementing transition tables for finite state automata, A link trie structure of storing multiple attribute relationships for natural language dictionaries, A Table Compression Method for Extended Aho-Corasick Automaton, Analysis of N-trees, New trie data structures which support very fast search operations
