The following pages link to Paweł Parys (Q894454):
Displaying 44 items.
- Weak containment for partial words is coNP-complete (Q894455) (← links)
- Reasoning about integrity constraints for tree-structured data (Q1650919) (← links)
- Shelah-Stupp's and Muchnik's iterations revisited (Q2117107) (← links)
- Extensions of the Caucal hierarchy? (Q2278292) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- Some results on complexity of <i>μ</i>-calculus evaluation in the black-box model (Q2842242) (← links)
- (Q2904749) (← links)
- Strictness of the Collapsible Pushdown Hierarchy (Q2912755) (← links)
- (Q2957484) (← links)
- On the Significance of the Collapse Operation (Q2986828) (← links)
- (Q3113723) (← links)
- Recursion Schemes and the WMSO+U Logic (Q3304152) (← links)
- A Type System Describing Unboundedness (Q3386622) (← links)
- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests (Q3587404) (← links)
- On a Fragment of AMSO and Tiling Systems (Q4601871) (← links)
- (Q4601873) (← links)
- Minimization of Tree Patterns (Q4625647) (← links)
- Two-way cost automata and cost logics over infinite trees (Q4635599) (← links)
- The Diagonal Problem for Higher-Order Recursion Schemes is Decidable (Q4635865) (← links)
- Variants of Collapsible Pushdown Systems (Q4649568) (← links)
- First-Order Logic on CPDA Graphs (Q4981168) (← links)
- (Q4986516) (← links)
- (Q4993359) (← links)
- (Q5028462) (← links)
- (Q5076057) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- (Q5109508) (← links)
- (Q5119391) (← links)
- The Complexity of the Diagonal Problem for Recursion Schemes (Q5136337) (← links)
- Bisimulation Finiteness of Pushdown Systems Is Elementary (Q5145660) (← links)
- How Many Numbers Can a Lambda-Term Contain? (Q5170720) (← links)
- Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games (Q5236329) (← links)
- (Q5275365) (← links)
- Reasoning About Integrity Constraints for Tree-Structured Data (Q5276200) (← links)
- (Q5278397) (← links)
- A characterization of lambda-terms transforming numerals (Q5371970) (← links)
- XPath evaluation in linear time (Q5395662) (← links)
- Systems of Equations Satisfied in All Commutative Finite Semigroups (Q5458364) (← links)
- (Q5874219) (← links)
- Weak Alternating Timed Automata (Q5891771) (← links)
- Weak Alternating Timed Automata (Q5902153) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
- Weak bisimulation finiteness of pushdown systems with deterministic \(\varepsilon\)-transitions is 2-\textsc{ExpTime}-complete (Q6538635) (← links)
- Unboundedness for recursion schemes: a simpler type system (Q6560912) (← links)
