The following pages link to Thomas Schwentick (Q208764):
Displaying 50 items.
- Conjunctive query containment over trees (Q532363) (← links)
- Complexity of hybrid logics over transitive frames (Q631089) (← links)
- On notions of regularity for data languages (Q846359) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Volker Weber (Q1047803) (← links)
- (Q1281502) (redirect page) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- On the power of tree-walking automata. (Q1401944) (← links)
- Query automata over finite trees (Q1607226) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- The power of the middle bit of a \(\#\)P function (Q1894453) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
- Automata and finite model theory (Q2244824) (← links)
- Winning strategies for streaming rewriting games (Q2291413) (← links)
- Reasoning about XML constraints based on XML-to-relational mappings (Q2322698) (← links)
- Dynamic conjunctive queries (Q2361342) (← links)
- Games for active XML revisited (Q2402614) (← links)
- Active context-free games (Q2432536) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- On the quantifier-free dynamic complexity of reachability (Q2514150) (← links)
- The many faces of a translation (Q2581761) (← links)
- Dynamic complexity theory revisited (Q2643134) (← links)
- (Q2754175) (← links)
- (Q2754205) (← links)
- Expressiveness of Hybrid Temporal Logic on Data Words (Q2825412) (← links)
- Validity of Tree Pattern Queries with Respect to Schema Information (Q2849907) (← links)
- On the Quantifier-Free Dynamic Complexity of Reachability (Q2849966) (← links)
- Feasible Automata for Two-Variable Logic with Successor on Data Words (Q2890205) (← links)
- Temporal Logics on Words with Multiple Data Values. (Q2908879) (← links)
- Two-variable logic on data words (Q2946646) (← links)
- The dynamic complexity of formal languages (Q2946668) (← links)
- (Q3086931) (← links)
- (Q3086934) (← links)
- Dynamic Complexity under Definable Changes (Q3174912) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- A note on the expressive power of linear orders (Q3224697) (← links)
- Reachability is in DynFO (Q3449473) (← links)
- Two-variable logic on data trees and XML reasoning (Q3452211) (← links)
- Generalized hypertree decompositions: NP-hardness and tractable variants (Q3452226) (← links)
- Definable relations and first-order query languages over strings (Q3452507) (← links)
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
- Complexity of Decision Problems for XML Schemas and Chain Regular Expressions (Q3586189) (← links)
- Bounded-Variable Fragments of Hybrid Logics (Q3590965) (← links)
- Optimizing Conjunctive Queries over Trees Using Schema Information (Q3599121) (← links)
- Expressive Power of Pebble Automata (Q3613757) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- (Q3836531) (← links)
- (Q4218118) (← links)
- (Q4218949) (← links)
