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=J. Comput.~Syst.~Sci. AND Volume=17
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Addressable approximations to nonaddressable data graphs
Y. Inagaki
,
T. Sakabe
,
T. Fukumura
Journal of Computer and System Sciences
17
(1), 1978, August, pp. 1-34
The enforcement of security policiesor computation
A.K. Jones
,
R.J. Lipton
Journal of Computer and System Sciences
17
(1), 1978, August, pp. 35-55
On splitting recursive sets
S. Breidbart
Journal of Computer and System Sciences
17
(1), 1978, August, pp. 56-64
A representation of strongly connected automata and its applications
M. Ito
Journal of Computer and System Sciences
17
(1), 1978, August, pp. 65-80
Finite automata, definable sets, and regular expressions over
\omega^n
-tapes
Y. Choueka
Journal of Computer and System Sciences
17
(1), 1978, August, pp. 81-97
Endomorphisms of linear automata
C.J. Maxson
,
K.C. Smith
Journal of Computer and System Sciences
17
(1), 1978, August, pp. 98-107
The circuit depth of symmetric Boolean functions
W.F. McColl
Journal of Computer and System Sciences
17
(1), 1978, August, pp. 108-115
Duality theory for discrete-time linear systems
S.J. Hegner
Journal of Computer and System Sciences
17
(1), 1978, August, pp. 116-143
On rearrangeable and non-blocking switching networks
N. Pippenger
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 145-162
On the decidability of homomorphism equivalence for languages
K. Culik II
,
A. Salomaa
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 163-175
(a-)synchronous (non-)deterministic cell spaces simulating each other
U. Golze
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 176-193
Realization of finite automata with linear parts
B. Reusch
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 194-206
A note on 'indecomposable parallel maps' by S. Amoroso, and I.j. Epstein
S. Aggarwal
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 207-208
T^{\omega}
as a universal domain
G. Plotkin
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 209-236
A note on asynchronous cellular automata
L. Priese
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 237-252
The complexity of total order structures
D. Moore
,
J. Case
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 253-269
Candidate keys for relations
C.L. Lucchesi
,
S.L. Osborn
Journal of Computer and System Sciences
17
(2), 1978, October, pp. 270-279
Stack languages and
\log n
space
K.N. King
,
C. Wrathall
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 281-299
The firing squad synchronization problem for a class of polyautomata networks
K. Kobayashi
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 300-318
Pumping lemmas for term languages
T.S.E. Maibaum
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 319-330
On the structure of derivations in deterministic ET0L systems
A. Ehrenfeucht
,
G. Rozenberg
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 331-347
A theory of type polymorphism in programming
R. Milner
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 348-375
A definition of measures over language space
T. Takaoka
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 376-387
A class of algorithms which require nonlinear time to maintain disjoint sets
R.E. Tarjan
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 388-405
On some classes of interpretations
B. Courcelle
,
I. Guessarian
Journal of Computer and System Sciences
17
(3), 1978, December, pp. 406-431
Seiten 1
2
>