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=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some results on relativized deterministic and nondeterministic time hierarchies
S. Moran
Journal of Computer and System Sciences
22
(1), 1981, February, pp. 1-8
Regularity and firing sequences of computation graphs
T. Nakamura
Journal of Computer and System Sciences
22
(1), 1981, February, pp. 9-28
Growth patterns of ordered cellular automata
S.J. Willson
Journal of Computer and System Sciences
22
(1), 1981, February, pp. 29-41
The decidability of the DOL-DTOL equivalence problem
K. Ruohonen
Journal of Computer and System Sciences
22
(1), 1981, February, pp. 42-52
A note on structure and looking back applied to the relative complexity of computable functions
P. Chew
,
M. Machtey
Journal of Computer and System Sciences
22
(1), 1981, February, pp. 53-59
On minimal augmentation of a graph to obtain an interval graph
T. Ohtsuki
,
H. Mori
,
T. Kashiwabara
,
T. Fujisawa
Journal of Computer and System Sciences
22
(1), 1981, February, pp. 60-97
An improved simulation result for ink-bounded Turing machines
R. Melville
Journal of Computer and System Sciences
22
(1), 1981, February, pp. 98-105
The independence of control structures in abstract programming systems
G.A. Riccardi
Journal of Computer and System Sciences
22
(2), 1981, April, pp. 107-143
Decision problems for node label controlled graph grammars
D. Janssens
,
G. Rozenberg
Journal of Computer and System Sciences
22
(2), 1981, April, pp. 144-177
SR(s,k) parsers: a class of shift-reduce bounded-context parsers
D.A. Workman
Journal of Computer and System Sciences
22
(2), 1981, April, pp. 178-197
Interdependent translation schemes
M.P. Georgeff
Journal of Computer and System Sciences
22
(2), 1981, April, pp. 198-219
The complexity of decision problems for finite-turn multicounter machines
E.M. Gurari
,
O.H. Ibarra
Journal of Computer and System Sciences
22
(2), 1981, April, pp. 220-229
Area-time tradeoffs for matrix multiplication and related problems in VLSI models
J.E. Savage
Journal of Computer and System Sciences
22
(2), 1981, April, pp. 230-242
Extending lookahead for LR parsers
T.P. Baker
Journal of Computer and System Sciences
22
(2), 1981, April, pp. 243-259
New hash functions and their use in authentication and set equality
M.N. Wegman
,
J.L. Carter
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 265-279
A time-luck tradeoff in relativized cryptography
G. Brassard
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 280-311
On time versus space. II. (Turing machines)
W. Paul
,
R. Reischuk
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 312-327
Semantics of probabilistic programs
D. Kozen
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 328-350
A time-space tradeoff for sorting on non-oblivious machines
A. Borodin
,
M.J. Fischer
,
D.G. Kirkpatrick
,
N.A. Lynch
,
M. Tompa
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 351-364
On uniform circuit complexity
W.L. Ruzzo
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 365-383
Number of quantifiers is better than number of tape cells
N. Immerman
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 384-406
Explicit constructions of linear-sized superconcentrators
Ofer Gabber
,
Zvi Galil
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 407-420
Division in idealized unit cost RAMS
J. Simon
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 421-441
Remarks on recursion versus diagonalization and exponentially difficult problems
M. Machtey
,
P. Young
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 442-453
Computational complexity of algebraic functions
N. Pippenger
Journal of Computer and System Sciences
22
(3), 1981, June, pp. 454-470