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=1986
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On
\alpha_0
-products and
\alpha_2
-products
Z. ésik
,
F. Gecseg
Theoretical Computer Science
48
(1), 1986, pp. 1-8
On the notion of infinite pseudorandom sequences
K.-I. Ko
Theoretical Computer Science
48
(1), 1986, pp. 9-33
The occurrence of the factors of a given word in a text
J.-C. Spehner
Theoretical Computer Science
48
(1), 1986, pp. 35-52
Properties of complexity measures for PRAMs and WRAMs
S. Bublitz
,
U. Schurfeld
,
I. Wegener
,
B. Voigt
Theoretical Computer Science
48
(1), 1986, pp. 53-73
A unified theory of interconnection network structure
C.P. Kruskal
,
M. Snir
Theoretical Computer Science
48
(1), 1986, pp. 75-94
Every countable poset is embeddable in the poset of unsolvable terms
R. Statman
Theoretical Computer Science
48
(1), 1986, pp. 95-100
Regularity of sets of initial strings of periodic D0L-systems
T. Head
,
B. Lando
Theoretical Computer Science
48
(1), 1986, pp. 101-108
Communication complexity hierarchy
J. Hromkovic̑
Theoretical Computer Science
48
(1), 1986, pp. 109-115
From regular expressions to deterministic automata
G. Berry
,
R. Sethi
Theoretical Computer Science
48
(1), 1986, pp. 117-126
The complexity of the word problem for Abelian l-groups
V. Weispfenning
Theoretical Computer Science
48
(1), 1986, pp. 127-132
Sequential simulation of parallel iterations and applications
M. Tchuente
Theoretical Computer Science
48
(2-3), 1986, pp. 135-144
Approximating sets with equivalence relations
W. Marek
,
H. Rasiowa
Theoretical Computer Science
48
(2-3), 1986, pp. 145-152
Hierarchies of one-way multihead automata languages
M. Chrobak
Theoretical Computer Science
48
(2-3), 1986, pp. 153-181
Mixed product and asynchronous automata
C. Duboc
Theoretical Computer Science
48
(2-3), 1986, pp. 183-199
On the active and full use of memory in right-boundary grammars and push-down automata
A. Ehrenfeucht
,
H.J. Hoogeboom
,
G. Rozenberg
Theoretical Computer Science
48
(2-3), 1986, pp. 201-228
Partial models and logic programming
M. Fitting
Theoretical Computer Science
48
(2-3), 1986, pp. 229-255
First-order approximation of algorithmic theories
W. Danko
Theoretical Computer Science
48
(2-3), 1986, pp. 257-272
Amortized efficiency of a path retrieval data structure
G.F. Italiano
Theoretical Computer Science
48
(2-3), 1986, pp. 273-281
On a public-key cryptosystem based on iterated morphisms and substitutions
A. Salomaa
,
S. Yu
Theoretical Computer Science
48
(2-3), 1986, pp. 283-296
Projection of object histories
S. Ginsburg
,
C. Tang
Theoretical Computer Science
48
(2-3), 1986, pp. 297-328
On the decidability of some problems about rational subsets of free partially commutative monoids
A. Gibbons
,
W. Rytter
Theoretical Computer Science
48
(2-3), 1986, pp. 329-337
Complete classes of automata for the
\alpha_0
-product
Z. ésik
,
P. Domosi
Theoretical Computer Science
47
(1), 1986, pp. 1-14
Real-time, pseudo real-time, and linear-time ITA
K. Culik II
,
Sheng Yu
Theoretical Computer Science
47
(1), 1986, pp. 15-26
The problems of cyclic equality and conjugacy for finite complete rewriting systems
P. Narendran
,
F. Otto
Theoretical Computer Science
47
(1), 1986, pp. 27-38
Rational equivalence relations
J.H. Johnson
Theoretical Computer Science
47
(1), 1986, pp. 39-60
Seiten 1
2
3
4
5
>