![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Information and Computation, Volume 267
Volume 267, August 2019
- Makoto Tatsuta, Wei-Ngan Chin, Mahmudul Faisal Al Ameen
:
Completeness and expressiveness of pointer program verification by separation logic. 1-27 - Oscar H. Ibarra, Ian McQuillan
:
On store languages and applications. 28-48 - Søren Riis
, Maximilien Gadouleau:
Max-flow min-cut theorems on dispersion and entropy measures for communication networks. 49-73 - Endre Boros, Khaled M. Elbassioni
, Vladimir Gurvich, Kazuhisa Makino:
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. 74-95 - Alberto Dennunzio, Enrico Formenti
, Luca Manzoni
, Antonio E. Porreca:
Complexity of the dynamics of reaction systems. 96-109 - Juha Honkala:
A characterization of free pairs of upper triangular free monoid morphisms. 110-115 - Yijia Chen, Jörg Flum:
Some lower bounds in parameterized AC0. 116-134 - Romeo Rizzi, Alexandru I. Tomescu
:
Faster FPTASes for counting and random generation of Knapsack solutions. 135-144 - Florence Clerc, Nathanaël Fijalkow
, Bartek Klin
, Prakash Panangaden:
Expressiveness of probabilistic modal logics: A gradual approach. 145-163 - Joost Engelfriet:
Corrigendum to "Iterated stack automata and complexity classes" [Inf. Comput. 95 (1) (1991) 21-75]. 164-167
![](https://dblp.org/img/cog.dark.24x24.png)
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.