default search action
Search dblp for Publications
export results for "toc:db/journals/iandc/iandc241.bht:"
@article{DBLP:journals/iandc/AmirEL15, author = {Amihood Amir and Estrella Eisenberg and Avivit Levy}, title = {Approximate periodicity}, journal = {Inf. Comput.}, volume = {241}, pages = {215--226}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2015.02.004}, doi = {10.1016/J.IC.2015.02.004}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/AmirEL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/AsarinBD15, author = {Eugene Asarin and Nicolas Basset and Aldric Degorre}, title = {Entropy of regular timed languages}, journal = {Inf. Comput.}, volume = {241}, pages = {142--176}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2015.03.003}, doi = {10.1016/J.IC.2015.03.003}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/AsarinBD15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Baillot15, author = {Patrick Baillot}, title = {On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy}, journal = {Inf. Comput.}, volume = {241}, pages = {3--31}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.10.005}, doi = {10.1016/J.IC.2014.10.005}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Baillot15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/BoudesMF15, author = {Pierre Boudes and Damiano Mazza and Lorenzo Tortora de Falco}, title = {An abstract approach to stratification in linear logic}, journal = {Inf. Comput.}, volume = {241}, pages = {32--61}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.10.006}, doi = {10.1016/J.IC.2014.10.006}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/BoudesMF15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Broy15, author = {Manfred Broy}, title = {Computability and realizability for interactive computations}, journal = {Inf. Comput.}, volume = {241}, pages = {277--301}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.12.019}, doi = {10.1016/J.IC.2014.12.019}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Broy15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Brunel15, author = {Alo{\"{\i}}s Brunel}, title = {Quantitative classical realizability}, journal = {Inf. Comput.}, volume = {241}, pages = {62--95}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.10.007}, doi = {10.1016/J.IC.2014.10.007}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Brunel15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/CartonH15, author = {Olivier Carton and Pablo Ariel Heiber}, title = {Normality and two-way automata}, journal = {Inf. Comput.}, volume = {241}, pages = {264--276}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2015.02.001}, doi = {10.1016/J.IC.2015.02.001}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/CartonH15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ChenL15, author = {Haiming Chen and Ping Lu}, title = {Checking determinism of regular expressions with counting}, journal = {Inf. Comput.}, volume = {241}, pages = {302--320}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.12.001}, doi = {10.1016/J.IC.2014.12.001}, timestamp = {Mon, 30 Oct 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/ChenL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/LagoT15, author = {Ugo Dal Lago and Paolo Parisen Toldin}, title = {A higher-order characterization of probabilistic polynomial time}, journal = {Inf. Comput.}, volume = {241}, pages = {114--141}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.10.009}, doi = {10.1016/J.IC.2014.10.009}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/LagoT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Marion15, author = {Jean{-}Yves Marion}, title = {Developments in implicit computational complexity}, journal = {Inf. Comput.}, volume = {241}, pages = {1--2}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.10.004}, doi = {10.1016/J.IC.2014.10.004}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Marion15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/MostrousY15, author = {Dimitris Mostrous and Nobuko Yoshida}, title = {Session typing and asynchronous subtyping for the higher-order {\(\pi\)}-calculus}, journal = {Inf. Comput.}, volume = {241}, pages = {227--263}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2015.02.002}, doi = {10.1016/J.IC.2015.02.002}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/MostrousY15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/MotallebiA15, author = {Hassan Motallebi and Mohammad Abdollahi Azgomi}, title = {Parametric multisingular hybrid Petri nets: Formal definitions and analysis techniques}, journal = {Inf. Comput.}, volume = {241}, pages = {321--348}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.11.001}, doi = {10.1016/J.IC.2014.11.001}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/MotallebiA15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/NowakZ15, author = {David Nowak and Yu Zhang}, title = {Formal security proofs with minimal fuss: Implicit computational complexity at work}, journal = {Inf. Comput.}, volume = {241}, pages = {96--113}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2014.10.008}, doi = {10.1016/J.IC.2014.10.008}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/NowakZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/VelnerC0HRR15, author = {Yaron Velner and Krishnendu Chatterjee and Laurent Doyen and Thomas A. Henzinger and Alexander Moshe Rabinovich and Jean{-}Fran{\c{c}}ois Raskin}, title = {The complexity of multi-mean-payoff and multi-energy games}, journal = {Inf. Comput.}, volume = {241}, pages = {177--196}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2015.03.001}, doi = {10.1016/J.IC.2015.03.001}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/VelnerC0HRR15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/ZhengQG15, author = {Shenggen Zheng and Daowen Qiu and Jozef Gruska}, title = {Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata}, journal = {Inf. Comput.}, volume = {241}, pages = {197--214}, year = {2015}, url = {https://doi.org/10.1016/j.ic.2015.02.003}, doi = {10.1016/J.IC.2015.02.003}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iandc/ZhengQG15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.