Constant-delay enumeration for SLP-compressed documents
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 2087040 (Why is no real title available?)
- scientific article; zbMATH DE number 7471710 (Why is no real title available?)
- scientific article; zbMATH DE number 7561482 (Why is no real title available?)
- scientific article; zbMATH DE number 7204563 (Why is no real title available?)
- Algorithmics on SLP-compressed strings: a survey
- Constant-delay enumeration for SLP-compressed documents
- Data compression via textual substitution
- Document spanners: a formal approach to information extraction
- Enumerating grammar-based extractions
- Enumeration for FO Queries over Nowhere Dense Graphs
- First-order queries on structures of bounded degree are computable with constant delay
- Grammar-based codes: a new class of universal lossless source codes
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- Self-indexed grammar-based compression
- Streaming enumeration on nested documents
- Towards Streaming Evaluation of Queries with Correlation in Complex Event Processing
This page was built for publication: Constant-delay enumeration for SLP-compressed documents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016770)