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 YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Proving the correctness of recursion-based automatic program transformations
David Sands
Theoretical Computer Science
167
(1-2), 1996, pp. 193-233
\pi
-calculus, internal mobility, and agent-passing calculi
Davide Sangiorgi
Theoretical Computer Science
167
(1-2), 1996, pp. 235-274
Interval logics and their decision procedures - Part I: An interval logic
Y.S. Ramakrishna
,
P.M. Melliar-Smith
,
L.E. Moser
,
L.K. Dillon
,
G. Kutty
Theoretical Computer Science
166
(1-2), 1996, pp. 1-47
An algebraic formulation of the aggregative closure query
Uchang Park
Theoretical Computer Science
166
(1-2), 1996, pp. 49-62
Monadic partition logics and finite automata
Enshao Shen
,
Qijia Tian
Theoretical Computer Science
166
(1-2), 1996, pp. 63-81
Comparing models of the intensional typed
\lambda
-calculus
R. Hoofman
Theoretical Computer Science
166
(1-2), 1996, pp. 83-99
Transformations of CLP modules
Sandro Etalle
,
Maurizio Gabbrielli
Theoretical Computer Science
166
(1-2), 1996, pp. 101-146
Meta-resolution: An algorithmic formalisation
Jean-Denis Fouks
,
Jean-Claude Spehner
Theoretical Computer Science
166
(1-2), 1996, pp. 147-172
Logical analysis of demonic nondeterministic programs
Stéphane Demri
,
Ewa Orƚowska
Theoretical Computer Science
166
(1-2), 1996, pp. 173-202
The largest cartesian closed category of stable domains
Guo-Qiang Zhang
Theoretical Computer Science
166
(1-2), 1996, pp. 203-219
A non-ground realization of the stable and well-founded semantics
Georg Gottlob
,
Sherry Marcus
,
Anil Nerode
,
Gernot Salzer
,
V.S. Subrahmanian
Theoretical Computer Science
166
(1-2), 1996, pp. 221-262
Topoligical methods for algebraic specification
Karl Meinke
Theoretical Computer Science
166
(1-2), 1996, pp. 263-290
The undecidability of simultaneous rigid
E
-unification
Anatoli Degtyarev
,
Andrei Voronkov
Theoretical Computer Science
166
(1-2), 1996, pp. 291-300
Behavioural theories and the proof of behavioural properties
Michel Bidoit
,
Rolf Hennicker
Theoretical Computer Science
165
(1), 1996, pp. 3-55
Proving implications by algebraic approximation
Michael Codish
,
Grigory Mashevitzky
Theoretical Computer Science
165
(1), 1996, pp. 57-74
A seqyential reduction strategy
Sergio Antoy
,
Aart Middeldorp
Theoretical Computer Science
165
(1), 1996, pp. 75-95
On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
Bernhard Gramlich
Theoretical Computer Science
165
(1), 1996, pp. 97-131
A compositional semantic basis for the analysis of equational Horn programs
María Alpuente
,
Moreno Falaschi
,
Germán Vidal
Theoretical Computer Science
165
(1), 1996, pp. 133-169
Three-valued completion for abductive logic programs
Frank Teusink
Theoretical Computer Science
165
(1), 1996, pp. 171-200
Forum: A multiple-conclusion specification logic
Dale Miller
Theoretical Computer Science
165
(1), 1996, pp. 201-232
Consistent subsequences and supersequences
Campbell Fraser
Theoretical Computer Science
165
(2), 1996, pp. 233-246
Exact complexity bounds for ordinal addition
Françoise Maurin
Theoretical Computer Science
165
(2), 1996, pp. 247-273
Automorphism groups of context-free graphs
Laurent Pélecq
Theoretical Computer Science
165
(2), 1996, pp. 275-293
Fréquences des facteurs des suites sturmiennes
Valérie Berthé
Theoretical Computer Science
165
(2), 1996, pp. 295-309
Selection from read-only memory and sorting with minimum data movement
J. Ian Munro
,
Venkatesh Raman
Theoretical Computer Science
165
(2), 1996, pp. 311-323
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
>