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=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On varieties of optimal algorithms for the computation of bilinear mappings I. The isotropy group of a bilinear mapping
H.F. de Groote
Theoretical Computer Science
7
(1), 1978, pp. 1-24
A representation of trees by languages II
B. Courcelle
Theoretical Computer Science
7
(1), 1978, pp. 25-55
A uniform approach to inductive posets and inductive closure
J.B. Wright
,
E.G. Wagner
,
J.W. Thatcher
Theoretical Computer Science
7
(1), 1978, pp. 57-77
Some applications of the McCreight-Meyer algorithm in abstract complexity theory
P. van Emde Boas
Theoretical Computer Science
7
(1), 1978, pp. 79-98
Data representation and computational complexity
R. Verbeek
,
K. Weihrauch
Theoretical Computer Science
7
(1), 1978, pp. 99-116
Intersection des images de certaines suites récurrentes linéaires
M. Mignotte
Theoretical Computer Science
7
(1), 1978, pp. 117-121
On varieties of optimal algorithms for the computation of bilinear mappings II. Optimal algorithms for
2 \times 2
-matrix multiplication
H.F. de Groote
Theoretical Computer Science
7
(2), 1978, pp. 127-148
On the minimal firing time of the firing-squad synchronization problem for polyautomata networks
K. Kobayashi
Theoretical Computer Science
7
(2), 1978, pp. 149-167
Elementary homomorphisms and a solution of the DOL sequence equivalence problem
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
7
(2), 1978, pp. 169-183
On languages specified by relative acceptance
R.V. Book
,
C. Wrathall
Theoretical Computer Science
7
(2), 1978, pp. 185-195
Varieties de langages et operations
J.-F. Perrot
Theoretical Computer Science
7
(2), 1978, pp. 197-210
Sur le monoide syntactique de
L^*
lorsque
L
est un langage fini
J.E. Pin
Theoretical Computer Science
7
(2), 1978, pp. 211-215
Finding the intersection of two convex polyhedra
D.E. Muller
,
F.P. Preparata
Theoretical Computer Science
7
(2), 1978, pp. 217-236
On varieties of optimal algorithms for the computation of bilinear mappings III. Optimal algorithms for the computation
xy
and
yx
, where
x, y \in M_2(K)
H.F. de Groote
Theoretical Computer Science
7
(3), 1978, pp. 239-249
Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
C.P. Schnorr
Theoretical Computer Science
7
(3), 1978, pp. 251-261
On good ETOL forms
S. Skyum
Theoretical Computer Science
7
(3), 1978, pp. 263-272
On
\log
-tape isomorphisms of complete sets
Juris Hartmanis
Theoretical Computer Science
7
(3), 1978, pp. 273-286
On two-way sequential transductions of full semi-AFL's
O.H. Ibarra
Theoretical Computer Science
7
(3), 1978, pp. 287-309
Remarks on blind and partially blind one-way multicounter machines
S.A. Greibach
Theoretical Computer Science
7
(3), 1978, pp. 311-324
An explicit construction of short monotone formulae for the monotone symmetric functions
M. Kleiman
,
N. Pippenger
Theoretical Computer Science
7
(3), 1978, pp. 325-332
A note on non-singular deterministic pushdown automata
E.P. Friedman
Theoretical Computer Science
7
(3), 1978, pp. 333-339