default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 585
Volume 585, June 2015
- Ugo Dal Lago
, Guillaume Bonfante:
Developments in Implicit Complexity (DICE 2012). 1-2
- Martin Avanzini, Naohi Eguchi, Georg Moser:
A new order-theoretic characterisation of the polytime computable functions. 3-24 - Guillaume Bonfante, Florian L. Deloup, Antoine Henrot:
Real or natural number interpretation and their effect on complexity. 25-40 - Hugo Férée, Emmanuel Hainry, Mathieu Hoyrup, Romain Péchoux:
Characterizing polynomial time complexity of stream programs using interpretations. 41-54 - Aloïs Brunel, Marco Gaboardi:
Realizability models for a linear dependent PCF. 55-70 - Yuxin Deng, Yu Zhang:
Program equivalence in linear contexts. 71-90 - Elvira Albert, Jesús Correas Fernández, Germán Puebla, Guillermo Román-Díez:
A multi-domain incremental analysis engine and its application to incremental resource analysis. 91-114 - Sebastian Eberhard:
Applicative theories for logarithmic complexity classes. 115-135
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 2026-07-28 23:34 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
