FO-query enumeration over SLP-compressed structures of bounded degree
From MaRDI portal
Cites work
- A comparison of boundary graph grammars and context-free hypergraph grammars
- A comparison of succinctly represented finite-state systems
- A formal language perspective on factorized representations
- A Parametrized Analysis of Algorithms on Hierarchical Graphs
- Algorithmics on SLP-compressed strings: a survey
- Answering FO+MOD queries under updates on bounded degree databases
- Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
- Balancing Straight-line Programs
- Constant delay enumeration for FO queries over databases with local bounded expansion
- Constant delay traversal of grammar-compressed graphs with bounded rank
- Constant-delay enumeration for SLP-compressed documents
- Constant-time tree traversal and subtree equality check for grammar-compressed trees
- Context-free graph languages of bounded degree are generated by apex graph grammars
- Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
- Elements of finite model theory.
- Enumerating answers to first-order queries over databases of low degree
- Enumeration for FO Queries over Nowhere Dense Graphs
- Enumeration of monadic second-order queries on trees
- First-order queries on structures of bounded degree are computable with constant delay
- Fixpoint logics over hierarchical structures
- Grammar-based compression of unranked trees
- Grammar-Based Tree Compression
- Graph expressions and graph rewritings
- Graph structure and monadic second-order logic. A language-theoretic approach
- Hierarchical planarity testing algorithms
- Hierarchically specified unit disk graphs
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 751134 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- scientific article; zbMATH DE number 969067 (Why is no real title available?)
- LTL with arithmetic and its applications in reasoning about hierarchical systems
- Mappings and grammars on trees
- Model-checking hierarchical structures
- MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay
- On Acyclic Conjunctive Queries and Constant Delay Enumeration
- On the complexity of the smallest grammar problem over fixed alphabets
- Parameter reduction and automata evaluation for grammar-compressed trees
- Parametrized complexity theory.
- Pattern matching on grammar-compressed strings in linear time
- Size bounds for factorised representations of query results
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- The Smallest Grammar Problem
- The Smallest Grammar Problem Revisited
This page was built for publication: FO-query enumeration over SLP-compressed structures of bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310244)
