default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 241
Volume 241, April 2015
- Jean-Yves Marion:
Developments in implicit computational complexity. 1-2 - Patrick Baillot:
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy. 3-31 - Pierre Boudes
, Damiano Mazza, Lorenzo Tortora de Falco:
An abstract approach to stratification in linear logic. 32-61 - Aloïs Brunel:
Quantitative classical realizability. 62-95 - David Nowak, Yu Zhang:
Formal security proofs with minimal fuss: Implicit computational complexity at work. 96-113 - Ugo Dal Lago, Paolo Parisen Toldin:
A higher-order characterization of probabilistic polynomial time. 114-141
- Eugene Asarin, Nicolas Basset, Aldric Degorre:
Entropy of regular timed languages. 142-176 - Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin:
The complexity of multi-mean-payoff and multi-energy games. 177-196 - Shenggen Zheng, Daowen Qiu, Jozef Gruska:
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. 197-214 - Amihood Amir, Estrella Eisenberg, Avivit Levy:
Approximate periodicity. 215-226 - Dimitris Mostrous, Nobuko Yoshida:
Session typing and asynchronous subtyping for the higher-order π-calculus. 227-263 - Olivier Carton, Pablo Ariel Heiber:
Normality and two-way automata. 264-276 - Manfred Broy:
Computability and realizability for interactive computations. 277-301 - Haiming Chen, Ping Lu:
Checking determinism of regular expressions with counting. 302-320 - Hassan Motallebi, Mohammad Abdollahi Azgomi:
Parametric multisingular hybrid Petri nets: Formal definitions and analysis techniques. 321-348
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 2025-02-05 20:38 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
