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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the algebra of order
D.J. Lehmann
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 1-23
A finite step-size procedure for the f-w method
L.P. Mavrides
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 24-29
On DIL schemes simulated by d0l schemes
S. Seki
,
Y. Kobuchi
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 30-45
Finding patterns common to a set of strings
D. Angluin
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 46-62
An efficient PQ-graph algorithm for solving the graph-realization problem
S. Fujishige
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 63-86
A-transducers and the monotonicity of IL schemes
T. Head
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 87-91
The equivalence of RE program schemes and data flow schemes
J.M. Jaffe
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 92-109
Context-free grammar forms with strict interpretations
H.A. Maurer
,
A. Salomaa
,
D. Wood
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 110-135
Structure preserving reductions among convex optimization problems
G. Ausiello
,
A. d'Atri
,
M. Protasi
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 136-153
Computable queries for relational data bases
A.K. Chandra
,
D. Harel
Journal of Computer and System Sciences
21
(2), 1980, October, pp. 156-178
The complexity of problems in systems of communicating sequential processes
R.E. Ladner
Journal of Computer and System Sciences
21
(2), 1980, October, pp. 179-194
Lower bounds on the size of sweeping automata
M. Sipser
Journal of Computer and System Sciences
21
(2), 1980, October, pp. 195-202
An
O(EV\log^2 V)
algorithm for the maximal flow problem
Z. Galil
,
A. Naamad
Journal of Computer and System Sciences
21
, 1980, October, pp. 203-217
Tree-size bounded alternation
W.L. Ruzzo
Journal of Computer and System Sciences
21
(2), 1980, October, pp. 218-235
Implicit data structures for fast search and update
J.I. Munro
,
H. Suwanda
Journal of Computer and System Sciences
21
(2), 1980, October, pp. 236-250
Straight-line program length as a parameter for complexity analysis
N.A. Lynch
Journal of Computer and System Sciences
21
(3), 1980, December, pp. 251-280
A duality theory for decomposable systems in a category
G. Naude
Journal of Computer and System Sciences
21
(3), 1980, December, pp. 281-291
Multiple equality sets and Post machines
F.-J. Brandenburg
Journal of Computer and System Sciences
21
(3), 1980, December, pp. 292-316
Complexity results for classes of quantificational formulas
H.R. Lewis
Journal of Computer and System Sciences
21
(3), 1980, December, pp. 317-353
Open-addressing hashing with unequal-probability keys
G.H. Gonnet
Journal of Computer and System Sciences
21
(3), 1980, December, pp. 354-367
Adequacy of decompositions of relational databases
D. Maier
,
A.O. Mendelzon
,
F. Sadri
,
J.D. Ullman
Journal of Computer and System Sciences
21
(3), 1980, December, pp. 368-379