| A semantic theory of the Internet of Things |
5 |
| A calculus for collective-adaptive systems and its behavioural theory |
4 |
| Graded modalities in Strategy Logic |
4 |
| Practical verification of multi-agent systems against SLK specifications |
4 |
| Computation as social agency: What, how and who |
3 |
| Alignment-free sequence comparison using absent words |
3 |
| Logical characterization of branching metrics for nondeterministic probabilistic transition systems |
3 |
| Imperfect information in Reactive Modules games |
2 |
| Compositional and symbolic synthesis of reactive controllers for multi-agent systems |
2 |
| Descriptional complexity of limited automata |
2 |
| CTL* with graded path modalities |
2 |
| Understanding cutting planes for QBFs |
2 |
| Dynamic algorithms via the primal-dual method |
2 |
| Limited automata and unary languages |
2 |
| Design patterns in beeping algorithms: Examples, emulation, and analysis |
2 |
| Reasoning about graded strategy quantifiers |
2 |
| First-order mu-calculus over generic transition systems and applications to the situation calculus |
1 |
| Binary constraint satisfaction problems defined by excluded topological minors |
1 |
| Handling infinitely branching well-structured transition systems |
1 |
| Expressiveness of probabilistic modal logics: A gradual approach |
1 |
| Max-flow min-cut theorems on dispersion and entropy measures for communication networks |
1 |
| Complexity of the dynamics of reaction systems |
1 |
| Complexity classification of the six-vertex model |
1 |
| Characterising tree-like Frege proofs for QBF |
1 |
| Constraint Satisfaction Problems over semilattice block Mal'tsev algebras |
1 |
| Weighted automata with storage |
1 |
| On k-abelian palindromes |
1 |
| Verifying the consistency of remote untrusted services with conflict-free operations |
1 |
| Equivalences between learning of data and probability distributions, and their applications |
1 |
| Linear-time list recovery of high-rate expander codes |
1 |
| 2-vertex connectivity in directed graphs |
1 |
| Short proofs of the Kneser-Lovasz coloring principle |
1 |
| Effect algebras, presheaves, non-locality and contextuality |
1 |
| On-line weighted pattern matching |
1 |
| The Church-Rosser theorem and quantitative analysis of witnesses |
1 |
| Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane |
1 |
| Finding maximal 2-dimensional palindromes |
1 |
| On the compressibility of finite languages and formal proofs |
0 |
| Automata for regular expressions with shuffle |
0 |
| Syntactic complexity of suffix-free languages |
0 |
| On t-revealing codes in binary Hamming spaces |
0 |
| A tale of two diagnoses in probabilistic systems |
0 |
| Freeness properties of weighted and probabilistic automata over bounded languages |
0 |
| On XOR lemmas for the weight of polynomial threshold functions |
0 |
| Cutting-edge cryptography through the lens of secret sharing |
0 |
| Counting hypergraph matchings up to uniqueness threshold |
0 |
| Sublogics of a branching time logic of robustness |
0 |
| Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals |
0 |
| Improved time bounds for linearizable implementations of abstract data types |
0 |
| Reachability analysis of quantum Markov decision processes |
0 |
