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=57
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Equational specification of partial higher-order algebras
Manfred Broy
Theoretical Computer Science
57
, 1988, pp. 3-45
Two-dimensional iterative arrays: Characterizations and applications
Oscar H. Ibarra
,
Michael A. Palis
Theoretical Computer Science
57
, 1988, pp. 47-86
The complexity properties of probabilistic automata with isolated cut point
Farid M. Ablyv
Theoretical Computer Science
57
, 1988, pp. 87-95
The advantages of a new approach to defining the communication complexity for VLSI
Juraj Hromkovic̑
Theoretical Computer Science
57
, 1988, pp. 97-111
Entropy of contact circuits and lower bounds on their complexity
Stasys P. Jukna
Theoretical Computer Science
57
, 1988, pp. 113-129
A greedy approximation algorithm for constructing shortest common superstrings
Jorma Tarhio
,
Esko Ukkonen
Theoretical Computer Science
57
, 1988, pp. 131-145
Matrix systems and principal cones of algebraic power series
W. Kuich
Theoretical Computer Science
57
, 1988, pp. 147-152
Generating ordered trees
Wladyslaw Skarbek
Theoretical Computer Science
57
, 1988, pp. 153-159
The semantics and proof theory of linear logic
Armon Avron
Theoretical Computer Science
57
, 1988, pp. 161-184
Rational index of context-free languages in
\exp{\Theta(\sqrt[p]{n})}
and
n^{\Theta(\ln n)^{\frac{1}{p}}}
Laurent Pierre
,
Jean-Marc Farinone
Theoretical Computer Science
57
, 1988, pp. 185-204
An algebraic structure for derivations in rewriting systems
Yury Velinov
Theoretical Computer Science
57
, 1988, pp. 205-224
Relating the power of cellular arrays to their closure properties
Oscar H. Ibarra
,
Tao Jiang
Theoretical Computer Science
57
, 1988, pp. 225-238
Théorème de transfert pour les polynômes partiellement commutatifs
G. Duchamp
,
J.Y. Thibon
Theoretical Computer Science
57
, 1988, pp. 239-249
Applications of compactness in the Smyth powerdomain of streams
J.-J.Ch. Meyer
,
E.P. de Vink
Theoretical Computer Science
57
, 1988, pp. 251-282
Codes circulaires, automates locaux et entropie
Marie Pierre Beal
Theoretical Computer Science
57
, 1988, pp. 283-302
Notes on congruence relations and factor pumping conditions for rational languages
Kosaburo Hashiguchi
Theoretical Computer Science
57
, 1988, pp. 303-316
Incompleteness of first-order temporal logic with UNTIL
Andrzej Szalas
,
Leszek Holenderski
Theoretical Computer Science
57
, 1988, pp. 317-325
An inherently iterative computation of Ackermann's function
Jerrold W. Grossman
,
R. Suzanne Zeitman
Theoretical Computer Science
57
, 1988, pp. 327-330