On the Existence of Reactive Strategies Resilient to Delay

Subjects: “…Computer Science & Information Science…”
Get full text

Proof complexity of positive branching programs

Subjects: “…Computer Science & Information Science…”
Get full text

On The Axioms Of $mathcal{M},mathcal{N}$-Adhesive Categories

Subjects: “…Computer Science & Information Science…”
Get full text

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries

Subjects: “…Computer Science & Information Science…”
Get full text

Congruence Closure Modulo Groups

Subjects: “…Computer Science & Information Science…”
Get full text

Playing Stochastically in Weighted Timed Games to Emulate Memory

Subjects: “…Computer Science & Information Science…”
Get full text

A Simple Algorithm for Consistent Query Answering under Primary Keys

Subjects: “…Computer Science & Information Science…”
Get full text

Constant-delay enumeration for SLP-compressed documents

Subjects: “…Computer Science & Information Science…”
Get full text

The Formal Theory of Monads, Univalently

Subjects: “…Computer Science & Information Science…”
Get full text

Categorifying computable reducibilities

Subjects: “…Computer Science & Information Science…”
Get full text

Bisimilarity in fresh-register automata

Subjects: “…Computer Science & Information Science…”
Get full text

Algebraic Presentations of Type Dependency

Subjects: “…Computer Science & Information Science…”
Get full text

Rewriting for Symmetric Monoidal Categories with Commutative (Co)Monoid Structure

Subjects: “…Computer Science & Information Science…”
Get full text

Random Deterministic Automata With One Added Transition

Subjects: “…Computer Science & Information Science…”
Get full text

Multi-Structural Games and Number of Quantifiers

Subjects: “…Computer Science & Information Science…”
Get full text

Diversity of Answers to Conjunctive Queries

Subjects: “…Computer Science & Information Science…”
Get full text

Decidability of One-Clock Weighted Timed Games with Arbitrary Weights

Subjects: “…Computer Science & Information Science…”
Get full text

Quantitative Equality in Substructural Logic via Lipschitz Doctrines

Subjects: “…Computer Science & Information Science…”
Get full text

Noninterference Analysis of Reversible Systems: An Approach Based on Branching Bisimilarity

Subjects: “…Computer Science & Information Science…”
Get full text

Complete and tractable machine-independent characterizations of second-order polytime

Subjects: “…Computer Science & Information Science…”
Get full text