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=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computation sequence sets
James Peterson
Journal of Computer and System Sciences
13
, 1976, pp. 1-24
Storage requirements for deterministic polynomial time recognizable languages
Stephen Cook
Journal of Computer and System Sciences
13
, 1976, pp. 25-37
A result on the equivalence problem for deterministic pushdown automata
Kenichi Taniguchi
,
Tadao Kasami
Journal of Computer and System Sciences
13
, 1976, pp. 38-50
On the sequential nature of functions
Patrick Fischer
,
Edward Robertson
,
Lawrence Saxton
Journal of Computer and System Sciences
13
, 1976, pp. 51-68
A nonlinear lower bound on linear search tree programs for solving Knapsack problems
David Dobkin
Journal of Computer and System Sciences
13
, 1976, pp. 69-73
A characterization of automata and a direct product decomposition
Yoshifumi Masunaga
,
Shoichi Noguchi
Journal of Computer and System Sciences
13
, 1976, pp. 74-89
Context-free grammars with graph-controlled tables
G. Rozenberg
,
A. Salomaa
Journal of Computer and System Sciences
13
, 1976, pp. 90-99
Complexity-class-encoding sets
Nancy Lynch
Journal of Computer and System Sciences
13
, 1976, pp. 100-118
The halting problem for linear Turing assemblers
Robert M. Baer
,
Jan van Leeuwen
Journal of Computer and System Sciences
13
, 1976, pp. 119-135
Indecomposable parallel maps in tessellation structures
Serafino Amoroso
,
Irving J. Epstein
Journal of Computer and System Sciences
13
, 1976, pp. 136-142
On the structure of Abelian automata
Yukio Shibata
Journal of Computer and System Sciences
13
, 1976, pp. 143-152
A useful device for showing the solvability of some decision problems
Oscar Ibarra
,
Chul Kim
Journal of Computer and System Sciences
13
, 1976, pp. 153-160
Hazard analysis of asynchronous circuits in Muller-Bartky's sense
A. Nozaki
Journal of Computer and System Sciences
13
, 1976, pp. 161-171
Automaton introspection
Richard Laing
Journal of Computer and System Sciences
13
, 1976, pp. 172-183
Finding the median
A. Schönhage
,
M. Paterson
,
N. Pippenger
Journal of Computer and System Sciences
13
, 1976, pp. 184-199
Varieties of ordered algebras
Stephen L. Bloom
Journal of Computer and System Sciences
13
, 1976, pp. 200-212
Some convergence results on the method of gradients for
Ax=\lambda Bx
S.F. McCormick
Journal of Computer and System Sciences
13
, 1976, pp. 213-222
Un théorème de duplication pour les forêts algébriques
André Arnold
,
Max Dauchet
Journal of Computer and System Sciences
13
, 1976, pp. 223-244
Intercalation lemmas for tree transducer languages
C.R. Perrault
Journal of Computer and System Sciences
13
(3), 1976, December, pp. 246-277
Graph-theoretic properties in computational complexity
Leslie G. Valiant
Journal of Computer and System Sciences
13
(3), 1976, December, pp. 278-285
Node listings for reducible flow graphs
A.V. Aho
,
J.D. Ullman
Journal of Computer and System Sciences
13
(3), 1976, December, pp. 286-299
Riemann's hypothesis and tests for primality
G.L. Miller
Journal of Computer and System Sciences
13
(3), 1976, December, pp. 300-317
Complexity metatheorems for context-free grammar problems
H.B. Hunt III
,
T.G. Szymanski
Journal of Computer and System Sciences
13
(3), 1976, December, pp. 318-334
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Kellogg Booth
,
George Lueker
Journal of Computer and System Sciences
13
, 1976, December, pp. 335-379