default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDActa Informatica, Volume 55
Volume 55, Number 1, February 2018
- Édouard Bonnet, Vangelis Th. Paschos:
Sparsification and subexponential approximation. 1-15 - Henrik Björklund, Wim Martens, Thomas Schwentick:
Conjunctive query containment over trees using schema information. 17-56 - Lene M. Favrholdt
, Jesper W. Mikkelsen:
Online edge coloring of paths and trees with a fixed number of colors. 57-80 - Juha Honkala:
A new bound for the D0L language equivalence problem. 81-88
Volume 55, Number 2, March 2018
- Javier Esparza, Enrico Tronci:
Preface for the special issue GandALF 2015. 89-90 - Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen:
Average-energy games. 91-127 - Martin Zimmermann:
Parameterized linear temporal logics meet costs: still not costlier than LTL. 129-152 - Rayna Dimitrova, Rupak Majumdar:
Reachability analysis of reversal-bounded automata on series-parallel graphs. 153-189
Volume 55, Number 3, May 2018
- Hazem Torfah, Martin Zimmermann:
The complexity of counting models of linear-time temporal logic. 191-212 - Hadassa Daltrophe, Shlomi Dolev, Zvi Lotker:
Big data interpolation using functional representation. 213-225 - Roberto Barbuti, Roberta Gori, Francesca Levi, Paolo Milazzo:
Generalized contexts for reaction systems: definition and study of dynamic causalities. 227-267
Volume 55, Number 4, June 2018
- Ferruccio Damiani, Luca Padovani, Ina Schaefer, Christoph Seidl:
A core calculus for dynamic delta-oriented programming. 269-307 - David A. Basin, Felix Klaedtke, Eugen Zalinescu:
Algorithms for monitoring real-time properties. 309-338 - Raymond Devillers:
Factorisation of transition systems. 339-362
Volume 55, Number 5, August 2018
- Elie Fares, Jean-Paul Bodeveix, Mamoun Filali:
Event algebra for transition systems composition application to timed automata. 363-400 - Sjoerd Cranen, Jeroen J. A. Keiren, Tim A. C. Willemse:
Parity game reductions. 401-444 - Chunhua Cao, Lu Qing, Di Yang:
A first step in characterizing three-element codes. 445-457
Volume 55, Number 6, September 2018
- Frank S. de Boer, Nikolaj S. Bjørner:
Preface for the special issue "FM15". 459-460 - Lijun Zhang, Pengfei Yang, Lei Song, Holger Hermanns, Christian Eisentraut, David N. Jansen, Jens Chr. Godskesen:
Probabilistic bisimulation for realistic schedulers. 461-488 - Søren Debois, Thomas T. Hildebrandt, Tijs Slaats:
Replication, refinement & reachability: complexity in dynamic condition-response graphs. 489-520 - Gianluca Amato, Simone Di Nardo Di Maio, Maria Chiara Meo, Francesca Scozzari:
Descending chains and narrowing on template abstract domains. 521-545
Volume 55, Number 7, November 2018
- Angelo Borsotti, Luca Breveglieri, Stefano Crespi-Reghizzi, Angelo Morzenti:
Fast deterministic parsers for transition networks. 547-574 - Eike Best, Raymond Devillers, Uli Schlachter:
Bounded choice-free Petri net synthesis: algorithmic issues. 575-611 - Hongbo Zhang:
An analysis of the M $$^X$$ X /M/1 queue with multiple working vacations by GI/M/1 type Markov process. 613-624
Volume 55, Number 8, December 2018
- Bernd Finkbeiner, Geguang Pu, Lijun Zhang:
Preface for the special issue for ATVA 2015. 625-626 - Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Looking at mean payoff through foggy windows. 627-647 - Chao Wang, Yi Lv, Peng Wu:
TSO-to-TSO linearizability is undecidable. 649-668 - Dietmar Berwanger, Anup Basil Mathew, Marie van den Bogaard:
Hierarchical information and the synthesis of distributed strategies. 669-701 - Rachel Faran, Orna Kupferman:
Spanning the spectrum from safety to liveness. 703-732
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 2026-08-03 00:29 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
