![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/iandc/iandc267.bht:"
@article{DBLP:journals/iandc/BorosEGM19, author = {Endre Boros and Khaled M. Elbassioni and Vladimir Gurvich and Kazuhisa Makino}, title = {A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions}, journal = {Inf. Comput.}, volume = {267}, pages = {74--95}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.03.005}, doi = {10.1016/J.IC.2019.03.005}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/BorosEGM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ChenF19, author = {Yijia Chen and J{\"{o}}rg Flum}, title = {Some lower bounds in parameterized AC\({}^{\mbox{0}}\)}, journal = {Inf. Comput.}, volume = {267}, pages = {116--134}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.03.008}, doi = {10.1016/J.IC.2019.03.008}, timestamp = {Fri, 24 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/ChenF19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ClercFKP19, author = {Florence Clerc and Nathana{\"{e}}l Fijalkow and Bartek Klin and Prakash Panangaden}, title = {Expressiveness of probabilistic modal logics: {A} gradual approach}, journal = {Inf. Comput.}, volume = {267}, pages = {145--163}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.04.002}, doi = {10.1016/J.IC.2019.04.002}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ClercFKP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/DennunzioFMP19, author = {Alberto Dennunzio and Enrico Formenti and Luca Manzoni and Antonio E. Porreca}, title = {Complexity of the dynamics of reaction systems}, journal = {Inf. Comput.}, volume = {267}, pages = {96--109}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.03.006}, doi = {10.1016/J.IC.2019.03.006}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/DennunzioFMP19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Engelfriet19, author = {Joost Engelfriet}, title = {Corrigendum to "Iterated stack automata and complexity classes" [Inf. Comput. 95 {(1)} {(1991)} 21-75]}, journal = {Inf. Comput.}, volume = {267}, pages = {164--167}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.05.003}, doi = {10.1016/J.IC.2019.05.003}, timestamp = {Fri, 24 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/Engelfriet19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Honkala19, author = {Juha Honkala}, title = {A characterization of free pairs of upper triangular free monoid morphisms}, journal = {Inf. Comput.}, volume = {267}, pages = {110--115}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.03.007}, doi = {10.1016/J.IC.2019.03.007}, timestamp = {Fri, 24 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/Honkala19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/IbarraM19, author = {Oscar H. Ibarra and Ian McQuillan}, title = {On store languages and applications}, journal = {Inf. Comput.}, volume = {267}, pages = {28--48}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.03.003}, doi = {10.1016/J.IC.2019.03.003}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/IbarraM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/RiisG19, author = {S{\o}ren Riis and Maximilien Gadouleau}, title = {Max-flow min-cut theorems on dispersion and entropy measures for communication networks}, journal = {Inf. Comput.}, volume = {267}, pages = {49--73}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.03.004}, doi = {10.1016/J.IC.2019.03.004}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/RiisG19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/RizziT19, author = {Romeo Rizzi and Alexandru I. Tomescu}, title = {Faster FPTASes for counting and random generation of Knapsack solutions}, journal = {Inf. Comput.}, volume = {267}, pages = {135--144}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.04.001}, doi = {10.1016/J.IC.2019.04.001}, timestamp = {Fri, 31 Jan 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/RizziT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/TatsutaCA19, author = {Makoto Tatsuta and Wei{-}Ngan Chin and Mahmudul Faisal Al Ameen}, title = {Completeness and expressiveness of pointer program verification by separation logic}, journal = {Inf. Comput.}, volume = {267}, pages = {1--27}, year = {2019}, url = {https://doi.org/10.1016/j.ic.2019.03.002}, doi = {10.1016/J.IC.2019.03.002}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/TatsutaCA19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de./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.