Full Text Available
Access Full Text at Repository
Search Results - "Computer and Information Science"
-
A decidable characterization of locally testable tree languages
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
Online Article RSS Article -
The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Computational Models of Certain Hyperspaces of Quasi-metric Spaces
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Power of Randomization in Automata on Infinite Strings
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Formalization of Abstract State Transition Systems for SAT
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Nested Hoare Triples and Frame Rules for Higher-order Store
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Kripke Semantics for Martin-Löf's Extensional Type Theory
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Attacker Control and Impact for Confidentiality and Integrity
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Algorithmic Randomness and Capacity of Closed Sets
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Coherent and finiteness spaces
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Randomisation and Derandomisation in Descriptive Complexity Theory
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Composition with Target Constraints
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
On the mathematical synthesis of equational logics
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Logical Concurrency Control from Sequential Proofs
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Real Analytic Machines and Degrees
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Conway games, algebraically and coalgebraically
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Permission-Based Separation Logic for Message-Passing Concurrency
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text
-
Answering Non-Monotonic Queries in Relational Data Exchange
Published in Logical Methods in Computer Science (2011)Subjects: “…Computer Science & Information Science…”
Get full text