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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing lower bounds on tensor rank over finite fields
S.J. Laskowski
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 1-14
The maximum value problem and NP real numbers
K.-I. Ko
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 15-35
On LLP(k) parsers
J. Pittl
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 36-68
On some decision problems for RAM programs
O.H. Ibarra
,
S. Moran
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 69-81
Superconcentrators of depth 2
Nicholas Pippenger
Journal of Computer and System Sciences
24
, 1982, pp. 82-90
A hierarchy of real-time deterministic languages and their equivalence
A. Yehudai
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 91-100
Accessibility of values as a determinant of relative complexity in algebras
N.A. Lynch
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 101-113
Tree constructions of free continuous algebras
J. Adamek
,
E. Nelson
,
J. Reiterman
Journal of Computer and System Sciences
24
(1), 1982, February, pp. 114-146
The equivalence problem for LL- and LR-regular grammars
A. Nijholt
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 149-161
Finding the median distributively
M. Rodeh
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 162-166
Tree correspondence problems
J. Albert
,
K. Culik II
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 167-179
Quadratic automata
J. Goldman
,
S. Homer
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 180-196
The complexity of selection and ranking in x+y and matrices with sorted columns
G.N. Frederickson
,
D.B. Johnson
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 197-208
The computational complexity of a set of quadratic functions
J. Jájá
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 209-223
A note on sparse oracles for NP
T.J. Long
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 224-232
Limitedness theorem on finite automata with distance functions
K. Hashiguchi
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 233-244
Processes of transforming structures
A. Maggiolo-Schettini
,
J. Winkowski
Journal of Computer and System Sciences
24
(3), 1982, June, pp. 245-282
Simple multi-visit attribute grammars
J. Engelfriet
,
G. Filé
Journal of Computer and System Sciences
24
(3), 1982, June, pp. 283-314
A prime decomposition theorem for grammatical families
S. Ginsburg
,
J. Goldstine
,
E.H. Spanier
Journal of Computer and System Sciences
24
(3), 1982, June, pp. 315-361
Space complexity in on-line computation
H. Machida
,
T. Kasai
Journal of Computer and System Sciences
24
(3), 1982, June, pp. 362-372
Representation of one-one degrees by decision problems for system functions
M.B. Thuraisingham
Journal of Computer and System Sciences
24
(3), 1982, June, pp. 373-377