Tables

DOI10.1007/3-540-62034-6_35MaRDI QIDQ6567753zbMATH OpenFDO

Authors J. Ian Munro

Publication date 5 July 2024

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Storing a Sparse Table with 0 (1) Worst Case Access Time
• Tables should be sorted (on random access machines)
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Membership in Constant Time and Almost-Minimum Space

Cites work

• scientific article; zbMATH DE number 3390780 (Why is no real title available?)
• An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
• Generating binary trees of bounded height
• Implicit data structures for fast search and update
• Lexicographic generation of ordered trees
• Suffix Arrays: A New Method for On-Line String Searches
• The Analysis of Heapsort

Cited in

(5)

• Comparative genomics with succinct colored de Bruijn graphs
• Evaluating regular path queries on compressed adjacency matrices
• Dynamic compact planar embeddings
• Faster dynamic compressed \(d\)-ary relations
• The ring: worst-case optimal joins in graph databases using (almost) no extra space

This page was built for publication: Tables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567753)