Entity usage

Showing below up to 50 results in range #1 to #50.

1. On Thin Air Reads Towards an Event Structures Model of Relaxed Memory: Label: en
2. Quantitative Automata under Probabilistic Semantics: Label: en
3. A New Perspective on FO Model Checking of Dense Graph Classes: Label: en
4. Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic: Label: en
5. Minimization of Symbolic Tree Automata: Label: en
6. Invisible Pushdown Languages: Label: en
7. A Generalised Twinning Property for Minimisation of Cost Register Automata: Label: en
8. Semantically Acyclic Conjunctive Queries under Functional Dependencies: Label: en
9. Complexity Theory of (Functions on) Compact Metric Spaces: Label: en
10. Church Meets Cook and Levin: Label: en
11. A Step Up in Expressiveness of Decidable Fixpoint Logics: Label: en
12. Order-Invariance of Two-Variable Logic is Decidable: Label: en
13. Solvability of Matrix-Exponential Equations: Label: en
14. How unprovable is Rabin's decidability theorem?: Label: en
15. Divide and Congruence II: Label: en
16. Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems: Label: en
17. Proving Differential Privacy via Probabilistic Couplings: Label: en
18. Factor Varieties and Symbolic Computation: Label: en
19. Quantifier Free Definability on Infinite Algebras: Label: en
20. Effective Brenier Theorem: Label: en
21. Rewriting modulo symmetric monoidal structure: Label: en
22. Quantitative Algebraic Reasoning: Label: en
23. Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes: Label: en
24. Healthiness from Duality: Label: en
25. Reasoning about Recursive Probabilistic Programs: Label: en
26. Winning Cores in Parity Games: Label: en
27. The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns: Label: en
28. Graphs of relational structures: Label: en
29. Weak consistency notions for all the CSPs of bounded width: Label: en
30. Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction: Label: en
31. The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems: Label: en
32. A constructive function-theoretic approach to topological compactness: Label: en
33. Constructions with Non-Recursive Higher Inductive Types: Label: en
34. Trace semantics for polymorphic references: Label: en
35. Hybrid realizability for intuitionistic and classical choice: Label: en
36. A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory: Label: en
37. A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine: Label: en
38. Semi-galois Categories I: Label: en
39. Interacting Frobenius Algebras are Hopf: Label: en
40. Semantics for probabilistic programming: Label: en
41. On Recurrent Reachability for Continuous Linear Dynamical Systems: Label: en
42. Differential Refinement Logic: Label: en
43. A categorical approach to open and interconnected dynamical systems: Label: en
44. Comparing Chemical Reaction Networks: Label: en
45. Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete: Label: en
46. The Complexity of Coverability in ν-Petri Nets: Label: en
47. First-order logic with reachability for infinite-state systems: Label: en
48. Infinitary Lambda Calculi from a Linear Perspective: Label: en
49. Conflict nets: Label: en
50. Interaction Graphs: Label: en