Tables
From MaRDI portal
Publication:6567753
DOI10.1007/3-540-62034-6_35zbMATH Open1541.68118MaRDI QIDQ6567753
Publication date: 5 July 2024
Cites Work
- Title not available (Why is that?)
- An implicit data structure supporting insertion, deletion, and search in \(O(\log ^ 2\,n)\) time
- Generating binary trees of bounded height
- Lexicographic generation of ordered trees
- Implicit data structures for fast search and update
- The Analysis of Heapsort
- Suffix Arrays: A New Method for On-Line String Searches
Related Items (5)
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 ⋮ Comparative genomics with succinct colored de Bruijn graphs
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)
