The following pages link to Nicole Schweikardt (Q389233):
Displaying 49 items.
- Expressiveness and static analysis of extended conjunctive regular path queries (Q389234) (← links)
- On the expressive power of monadic least fixed point logic (Q817849) (← links)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- Reversal complexity revisited (Q935164) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- Tight lower bounds for query processing on streaming and external memory data (Q2373746) (← links)
- The monadic quantifier alternation hierarchy over grids and graphs (Q2506497) (← links)
- (Q2762524) (← links)
- $$+\omega $$ + ω -Picture Languages Recognizable by Büchi-Tiling Systems (Q2798711) (← links)
- (Q2904787) (← links)
- On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates (Q2915019) (← links)
- (Q2958533) (← links)
- On the locality of arb-invariant first-order formulas with modulo counting quantifiers (Q2974792) (← links)
- (Q3086932) (← links)
- (Q3174897) (← links)
- A note on the expressive power of linear orders (Q3224697) (← links)
- (Q3305351) (← links)
- Lower bounds for processing data with few random accesses to external memory (Q3452210) (← links)
- Preservation and decomposition theorems for bounded degree structures (Q3460422) (← links)
- Logic and Data Exchange: Which Solutions Are “Good” Solutions? (Q3584870) (← links)
- (Q4218948) (← links)
- (Q4251045) (← links)
- Finite-State Map-Reduce Computation and Relational Algebra Queries (Q4581461) (← links)
- Preservation and decomposition theorems for bounded degree structures (Q4635634) (← links)
- On Hanf-equivalence and the number of embeddings of small induced subgraphs (Q4635645) (← links)
- Hanf normal form for first-order logic with unary counting quantifiers (Q4635883) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- (Q4785505) (← links)
- A Short Tutorial on Order-Invariant First-Order Logic (Q4928477) (← links)
- (Q5002820) (← links)
- Answering FO+MOD Queries under Updates on Bounded Degree Databases (Q5012590) (← links)
- (Q5092420) (← links)
- (Q5144680) (← links)
- An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (Q5271041) (← links)
- Arithmetic, first-order logic, and counting quantifiers (Q5277734) (← links)
- Computer Science Logic (Q5292639) (← links)
- The succinctness of first-order logic on linear orders (Q5310637) (← links)
- Lower Bounds for Multi-Pass Processing of Multiple Data Streams (Q5389965) (← links)
- Boundedness of Monadic FO over Acyclic Structures (Q5428840) (← links)
- Model Theory Makes Formulas Large (Q5428869) (← links)
- Automata, Languages and Programming (Q5466543) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492877) (← links)
- Fundamentals of Computation Theory (Q5492911) (← links)
- Automata, Languages and Programming (Q5716854) (← links)
- (Q5738943) (← links)
- Enumeration for FO Queries over Nowhere Dense Graphs (Q5889796) (← links)
- Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints (Q6491032) (← links)
- Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints (Q6492724) (← links)
