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=86
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Semantic models for concurrent logic languages
F.S. de Boer
,
J.J.M.M. Rutten
,
J.N. Kok
,
C. Palamidessi
Theoretical Computer Science
86
, 1991, pp. 3-33
An analysis of loop checking mechanisms for logic programs
Roland N. Bol
,
Krzysztof R. Apt
,
Jan Willem Klop
Theoretical Computer Science
86
, 1991, pp. 35-79
Acyclic logic programs and the completeness of SLDNF-resolution
Lawrence Cavedon
Theoretical Computer Science
86
, 1991, pp. 81-92
Semantics of Horn and disjunctive logic programs
Jorge Lobo
,
Arcot Rajasekar
,
Jack Minker
Theoretical Computer Science
86
, 1991, pp. 93-106
Unfold/fold transformation of stratified programs
Hirohisa Seki
Theoretical Computer Science
86
, 1991, pp. 107-139
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. Part II: The algebra
G[u]/<u^n>
Amir Averbuch
,
Zvi Galil
,
Shmuel Winograd
Theoretical Computer Science
86
, 1991, pp. 143-203
Merging in maps and in pavings
Jean-Claude Spehner
Theoretical Computer Science
86
, 1991, pp. 205-232
Recognizable closures and submonoids of free partially commutative monoids
Kosaburo Hashiguchi
Theoretical Computer Science
86
, 1991, pp. 233-241
Planar orientations with low out-degree and compaction of adjacency matrices
Marek Chrobak
,
David Eppstein
Theoretical Computer Science
86
, 1991, pp. 243-266
Separating the eraser Turing machine classes
L_e
,
NL_e
,
co-NL_e
and
P_e
Matthias Krause
,
Christoph Meinel
,
Stephan Waack
Theoretical Computer Science
86
, 1991, pp. 267-275
Langages algébriques de mots biinfinis
F. Gire
,
M. Nivat
Theoretical Computer Science
86
, 1991, pp. 277-323
The complexity of computing the number of strings of given length in context-free languages
Alberto Bertoni
,
Massimiliano Goldwurm
,
Nicoletta Sabadini
Theoretical Computer Science
86
, 1991, pp. 325-342
On the existence of speed-independent circuits
C.-J. Seger
Theoretical Computer Science
86
, 1991, pp. 343-364
Decoders with initial state invariance for multivalued encodings
Renato M. Capocelli
,
Luisa Gargano
,
Ugo Vaccaro
Theoretical Computer Science
86
, 1991, pp. 365-375
Learnability with respect to fixed distributions
Gyora M. Benedek
,
Alon Itai
Theoretical Computer Science
86
, 1991, pp. 377-389