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=136
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Variations on the bagdomain theme
P.T. Johnstone
Theoretical Computer Science
136
(1), 1994, pp. 3-20
Stable power domains
Reinhold Heckmann
Theoretical Computer Science
136
(1), 1994, pp. 21-56
Algebraic domains of natural transformations
Adrian Fiech
,
Michael Huth
Theoretical Computer Science
136
(1), 1994, pp. 57-78
Lagois connections - a counterpart to Galois connections
Austin Melton
,
Bernd S.W. Schröder
,
George E. Strecker
Theoretical Computer Science
136
(1), 1994, pp. 79-107
Partial map classifiers and partial cartesian closed categories
Philip S. Mulry
Theoretical Computer Science
136
(1), 1994, pp. 109-123
Categorical abstract machines for higher-order typed
\lambda
-calculi
Eike Ritter
Theoretical Computer Science
136
(1), 1994, pp. 125-162
Parametricity as isomorphism
Edmund Robinson
Theoretical Computer Science
136
(1), 1994, pp. 163-181
A unified approach to type theory through a refined
\lambda
-calculus
Fairouz Kamareddine
,
Rob Nederpelt
Theoretical Computer Science
136
(1), 1994, pp. 183-216
Computational adequacy of the FIX-logic
Roy L. Crole
Theoretical Computer Science
136
(1), 1994, pp. 217-242
Adequacy for a lazy functional language with recursive and polymorphic types
Bettina Blaaberg
,
Christian Clausen
Theoretical Computer Science
136
(1), 1994, pp. 243-275
A semantics for
\lambda
prolog
D.A. Wolfram
Theoretical Computer Science
136
(1), 1994, pp. 277-289
Recognition of graphs by automata
Eric Remila
Theoretical Computer Science
136
(2), 1994, pp. 291-332
Fundamental study: Recognition of graphs by automata
Eric Remila
Theoretical Computer Science
136
(2), 1994, pp. 291-332
On the modularity of termination of term rewriting systems
Enno Ohlebusch
Theoretical Computer Science
136
(2), 1994, pp. 333-360
Some combinatorial properties of Sturmian words
Aldo de Luca
,
Filippo Mignosi
Theoretical Computer Science
136
(2), 1994, pp. 361-385
A quadtree algorithm for template matching on a pyramid computer
H. Senoussi
,
A. Saoudi
Theoretical Computer Science
136
(2), 1994, pp. 387-417
On almost bad Boolean bases
Vladimir Stetsenko
Theoretical Computer Science
136
(2), 1994, pp. 419-469
Congruences, infix and cohesive prefix codes
M. Ito
,
G. Thierrin
Theoretical Computer Science
136
(2), 1994, pp. 471-485
Almost every set in exponential time is
P
-bi-immune
Elvira Mayordomo
Theoretical Computer Science
136
(2), 1994, pp. 487-506
Two results on linear embeddings of complete binary trees
Marek Chrobak
,
Wojciech Rytter
Theoretical Computer Science
136
(2), 1994, pp. 507-526
No polynomial bound for the period of the parallel chip firing game on graphs
M.A. Kiwi
,
R. Ndoundam
,
M. Tchuente
,
E. Goles
Theoretical Computer Science
136
(2), 1994, pp. 527-532