Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 259
Volume 259, Part 1, April 2018
- Vasileios Koutavas, Maciej Gazda, Matthew Hennessy:
Distinguishing between communicating transactions. 1-30 - Leah Epstein, Asaf Levin
, Danny Segev, Oren Weimann:
Improved bounds for randomized preemptive online matching. 31-40 - Fu Song:
Analyzing pushdown systems with stack manipulation. 41-71 - Ruggero Lanotte, Massimo Merro:
A semantic theory of the Internet of Things. 72-101 - Jin-Yi Cai, Heng Guo, Tyson Williams:
Holographic algorithms beyond matchgates. 102-129 - Jin-Yi Cai, Zhiguo Fu, Mingji Xia:
Complexity classification of the six-vertex model. 130-141 - George Chatzieleftheriou, Panagiotis Katsaros:
Abstract model repair for probabilistic systems. 142-160
Volume 259, Part 2, April 2018
- Jeffrey O. Shallit, Alexander Okhotin:
Preface. 161 - Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis:
Automata for regular expressions with shuffle. 162-173 - Janusz A. Brzozowski, Marek Szykula:
Syntactic complexity of suffix-free languages. 174-190 - Sebastian Eberhard, Stefan Hetzl:
On the compressibility of finite languages and formal proofs. 191-213 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
On the complexity and decidability of some problems involving shuffle. 214-224 - Markus Holzer, Sebastian Jakobi:
On the computational complexity of problems related to distinguishability sets. 225-236 - Lila Kari, Stavros Konstantinidis, Steffen Kopecki:
Transducer descriptions of DNA code properties and undecidability of antimorphic problems. 237-258 - Martin Kutrib, Giovanni Pighizzini, Matthias Wendlandt:
Descriptional complexity of limited automata. 259-276 - Friedrich Otto, Kent Kwee:
On the descriptional complexity of stateless deterministic ordered restarting automata. 277-302
Volume 259, Part 3, April 2018
- Fabio Grandi, Martin Lange, Alessio Lomuscio:
22nd International Symposium on Temporal Representation and Reasoning (TIME 2015). 303-304 - C. Aiswarya, Benedikt Bollig, Paul Gastin:
An automata-theoretic approach to the verification of distributed algorithms. 305-327 - Diego Calvanese, Giuseppe De Giacomo, Marco Montali, Fabio Patrizi:
First-order μ-calculus over generic transition systems and applications to the situation calculus. 328-347 - Carlo Comin, Romeo Rizzi:
Checking dynamic consistency of conditional hyper temporal networks via mean payoff games: Hardness and (pseudo) singly-exponential time algorithm. 348-374 - Salih Durhan, Guido Sciavicco:
Allen-like theory of time for tree-like structures. 375-389 - Vadim Malvone, Fabio Mogavero, Aniello Murano, Loredana Sorrentino:
Reasoning about graded strategy quantifiers. 390-411 - Alberto Molinari, Angelo Montanari, Adriano Peron:
Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives. 412-443 - Carlo Zaniolo, Shi Gao, Maurizio Atzori, Muhao Chen, Jiaqi Gu:
User-friendly temporal queries on historical knowledge bases. 444-459
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
