![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/iandc/iandc240.bht:"
@article{DBLP:journals/iandc/ChatterjeeS15, author = {Krishnendu Chatterjee and Jir{\'{\i}} Sgall}, title = {Special Issue for the 38th International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2013, Klosterneuburg, Austria}, journal = {Inf. Comput.}, volume = {240}, pages = {1}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.012}, doi = {10.1016/J.IC.2014.09.012}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ChatterjeeS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CohenFHK15, author = {Sarel Cohen and Amos Fiat and Moshik Hershcovitch and Haim Kaplan}, title = {Minimal indices for predecessor search}, journal = {Inf. Comput.}, volume = {240}, pages = {12--30}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.005}, doi = {10.1016/J.IC.2014.09.005}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CohenFHK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/FournierPV15, author = {Herv{\'{e}} Fournier and Sylvain Perifel and R{\'{e}}mi de Joannis de Verclos}, title = {On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant}, journal = {Inf. Comput.}, volume = {240}, pages = {31--41}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.006}, doi = {10.1016/J.IC.2014.09.006}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/FournierPV15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Gurvits15, author = {Leonid Gurvits}, title = {Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: Combinatorial and algorithmic applications}, journal = {Inf. Comput.}, volume = {240}, pages = {42--55}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.007}, doi = {10.1016/J.IC.2014.09.007}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Gurvits15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/HansenP15, author = {Kristoffer Arnsfelt Hansen and Vladimir V. Podolskii}, title = {Polynomial threshold functions and Boolean threshold circuits}, journal = {Inf. Comput.}, volume = {240}, pages = {56--73}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.008}, doi = {10.1016/J.IC.2014.09.008}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/HansenP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/IMSIBTNS15, author = {Tomohiro I and Wataru Matsubara and Kouji Shimohira and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda and Kazuyuki Narisawa and Ayumi Shinohara}, title = {Detecting regularities on grammar-compressed strings}, journal = {Inf. Comput.}, volume = {240}, pages = {74--89}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.009}, doi = {10.1016/J.IC.2014.09.009}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/IMSIBTNS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/KupfermanM15, author = {Orna Kupferman and Jonathan Mosheiff}, title = {Prime languages}, journal = {Inf. Comput.}, volume = {240}, pages = {90--107}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.010}, doi = {10.1016/J.IC.2014.09.010}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/KupfermanM15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Tavenas15, author = {S{\'{e}}bastien Tavenas}, title = {Improved bounds for reduction to depth 4 and depth 3}, journal = {Inf. Comput.}, volume = {240}, pages = {2--11}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.004}, doi = {10.1016/J.IC.2014.09.004}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Tavenas15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ZeumeS15, author = {Thomas Zeume and Thomas Schwentick}, title = {On the quantifier-free dynamic complexity of Reachability}, journal = {Inf. Comput.}, volume = {240}, pages = {108--129}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.09.011}, doi = {10.1016/J.IC.2014.09.011}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ZeumeS15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.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.