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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tests for the LR-, LL-, and LC-regular conditions
S. Heilbrunner
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 1-13
A low and a high hierarchy within
NP
U. Schöning
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 14-28
Port automata and the algebra of concurrent processes
M. Steenstrup
,
M.A. Arbib
,
E.G. Manes
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 29-50
A method for stepwise refinement and abstraction of Petri nets
I. Suzuki
,
T. Murata
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 51-76
On the complexity of chess
J.A. Storer
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 77-100
Representation theorems on regular languages
K. Hashiguchi
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 101-115
Remarks on multihead pushdown automata and multihead stack automata
S. Miyano
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 116-124
Linear cellular automata over z/sub m/
M. Ito
,
N. Osato
,
M. Nasu
Journal of Computer and System Sciences
27
(1), 1983, August, pp. 125-140
Recursion and iteration in continuous theories: the 'm-construction'
S.L. Bloom
,
J.W. Thatcher
,
E.G. Wagner
,
J.B. Wright
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 148-164
Algebraic characterization of reducible flowcharts
H. Schmeck
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 165-199
Extensions of iterative congruences on free iterative algebras
F. Parisi-Presicce
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 200-220
An axiomatization of d-scheme strong equivalence
D.R. Troeger
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 221-224
All solutions of a system of recursion equations in infinite trees and other contraction theories
S.L. Bloom
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 225-255
Transaction protection by beacons
M.O. Rabin
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 256-267
Correctness of recursive parallel nondeterministic flow programs
J.A. Goguen
,
J. Meseguer
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 268-290
Algebras of iteration theories
Z. ésik
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 291-303
Implementation of data types by algebraic methods
E.K. Blum
,
F. Parisi-Presicce
Journal of Computer and System Sciences
27
(2), 1983, October, pp. 304-330
Acyclic join dependency and data base projections
R. Hull
Journal of Computer and System Sciences
27
(3), 1983, December, pp. 331-349
A technique for decomposing algorithms which use a single shared variable
N.A. Lynch
,
M.J. Fischer
Journal of Computer and System Sciences
27
(3), 1983, December, pp. 350-377
A normal form for arithmetical representation of NP-sets
B.R. Hodgson
,
C.F. Kent
Journal of Computer and System Sciences
27
(3), 1983, December, pp. 378-388
The insensitivity theorem for nonreducing reflexive types
E. Astesiano
,
G. Costa
Journal of Computer and System Sciences
27
(3), 1983, December, pp. 389-399
Deterministic and nondeterministic flowchart interpretations
R.J. Lorentz
,
D.B. Benson
Journal of Computer and System Sciences
27
(3), 1983, December, pp. 400-433
Finite-state
\omega
-languages
L. Staiger
Journal of Computer and System Sciences
27
(3), 1983, December, pp. 434-448