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=394
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
Bruno Courcelle
,
Christian Delhommé
Theoretical Computer Science
394
(1-2), 2008, pp. 1-38
Cryptographic logical relations
Yu Zhang
Theoretical Computer Science
394
(1-2), 2008, pp. 39-63
Decidability and syntactic control of interference
J. Laird
Theoretical Computer Science
394
(1-2), 2008, pp. 64-83
Itemset frequency satisfiability: Complexity and axiomatization
Toon Calders
Theoretical Computer Science
394
(1-2), 2008, pp. 84-111
Sound and complete computational interpretation of symbolic hashes in the standard model
Flavio D. Garcia
,
Peter van Rossum
Theoretical Computer Science
394
(1-2), 2008, pp. 112-133
Petri nets are less expressive than state-extended PA
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Theoretical Computer Science
394
(1-2), 2008, pp. 134-140
Constructibility and decidability versus domain independence and absoluteness
Arnon Avron
Theoretical Computer Science
394
(3), 2008, pp. 144-158
Physical constraints on hypercomputation
Paul Cockshott
,
Lewis Mackenzie
,
Greg Michaelson
Theoretical Computer Science
394
(3), 2008, pp. 159-174
Dynamics of a generic Brownian motion: Recursive aspects
Willem L. Fouché
Theoretical Computer Science
394
(3), 2008, pp. 175-186
Optimal computation with non-unitary quantum walks
Viv Kendon
,
Olivier Maloyer
Theoretical Computer Science
394
(3), 2008, pp. 187-196
Minimality considerations for ordinal computers modeling constructibility
Peter Koepke
,
Ryan Siders
Theoretical Computer Science
394
(3), 2008, pp. 197-207
Interval-valued computations and their connection with PSPACE
Benedek Nagy
,
Sándor Vályi
Theoretical Computer Science
394
(3), 2008, pp. 208-222
Bounding lemmata for non-deterministic halting times of transfinite Turing machines
Philip D. Welch
Theoretical Computer Science
394
(3), 2008, pp. 223-228