Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=585
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A new order-theoretic characterisation of the polytime computable functions
Martin Avanzini
,
Naohi Eguchi
,
Georg Moser
Theoretical Computer Science
585
, 2015, pp. 3-24
Real or natural number interpretation and their effect on complexity
Guillaume Bonfante
,
Florian Deloup
,
Antoine Henrot
Theoretical Computer Science
585
, 2015, pp. 25-40
Characterizing polynomial time complexity of stream programs using interpretations
Hugo Férée
,
Emmanuel Hainry
,
Mathieu Hoyrup
,
Romain Péchoux
Theoretical Computer Science
585
, 2015, pp. 41-54
Realizability models for a linear dependent PCF
Aloïs Brunel
,
Marco Gaboardi
Theoretical Computer Science
585
, 2015, pp. 55-70
Program equivalence in linear contexts
Yuxin Deng
,
Yu Zhang
Theoretical Computer Science
585
, 2015, pp. 71-90
A multi-domain incremental analysis engine and its application to incremental resource analysis
Elvira Albert
,
Jesús Correas
,
Germán Puebla
,
Guillermo Román-Díez
Theoretical Computer Science
585
, 2015, pp. 91-114
Applicative theories for logarithmic complexity classes
Sebastian Eberhard
Theoretical Computer Science
585
, 2015, pp. 115-135