Tables

DOI10.1007/3-540-62034-6_35zbMATH Open1541.68118MaRDI QIDQ6567753FDOQ6567753

Authors: J. Ian Munro 

Publication date: 5 July 2024

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

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

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

Cited In (5)

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

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)