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
[2]
Hilfe
Suche: Journal=J. ACM AND Volume=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A theory of program size formally identical to information theory
G.J. Chaitin
Journal of the ACM
22
, 1975, pp. 329-340
On reducibility to complex or sparse sets
N. Lynch
Journal of the ACM
22
, 1975, pp. 341-345
A new linear-time ``on-line'' algorithm for finding the smallest initial palindrome of a string
G. Manacher
Journal of the ACM
22
, 1975, pp. 346-351
Advances on the Hamiltonian completion problem
S.E. Goodman
,
S.T. Hedetniemi
,
P.J. Slater
Journal of the ACM
22
, 1975, pp. 352-360
Representing graphs by Knuth trees
J.L. Pfaltz
Journal of the ACM
22
, 1975, pp. 361-366
The complexity of some simple retrieval problems
P. Elias
,
R.A. Flower
Journal of the ACM
22
, 1975, pp. 367-379
Primes with a prime subscript
R.E. Dressler
,
T. Parker
Journal of the ACM
22
, 1975, pp. 380-381
The generation of optimal code for stack machines
J.L. Bruno
,
T. Lassagne
Journal of the ACM
22
, 1975, pp. 382-396
Queueing analysis of the scan policy for moving-head disks
W.C. Oney
Journal of the ACM
22
, 1975, pp. 397-412
A computational study of the effects of problem dimensions on solution times for transportation problems
G.T. Ross
,
D. Klingman
,
A. Napier
Journal of the ACM
22
, 1975, pp. 413-424
The concept of term exclusiveness and its effect on the theory of Boolean functions
A. Svoboda
Journal of the ACM
22
, 1975, pp. 425-440
The effect of a capacity constraint on the minimal cost of a partition
M.C. Easton
,
C.K. Wong
Journal of the ACM
22
, 1975, pp. 441-449
A sorting algorithm for polynomial multiplication
E. Horowitz
Journal of the ACM
22
, 1975, pp. 450-462
Fast approximation algorithms for the knapsack and sum of subset problems
Oscar H. Ibarra
,
Chul E. Kim
Journal of the ACM
22
(4), 1975, pp. 463-468
On finding the maxima of a set of vectors
H.T. Kung
,
F. Luccio
,
F. Preparata
Journal of the ACM
22
(4), 1975, October, pp. 469-476
On the parallel evaluation of certain arithmetic expressions
S. Winograd
Journal of the ACM
22
(4), 1975, October, pp. 477-492
An observation on relative parsing time
E. Bertsch
Journal of the ACM
22
, 1975, pp. 493-498
A note on tape-bounded complexity classes and linear context-free languages
I.H. Sudborough
Journal of the ACM
22
, 1975, pp. 499-500
A sufficient bound for codes correcting bursts with weight constraint
B.K. Dass
Journal of the ACM
22
, 1975, pp. 501-503
A class of implicit Runge-Kutta methods for the numerical integration of stiff ordinary differential equations
J.R. Cash
Journal of the ACM
22
, 1975, pp. 504-511
Computer search for numerical instability
W. Miller
Journal of the ACM
22
, 1975, pp. 512-521
Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems
K.L. Krause
,
V.Y. Shen
,
H.D. Schwetman
Journal of the ACM
22
, 1975, pp. 522-550
The fanout structure of switching functions
J.P. Hayes
Journal of the ACM
22
, 1975, pp. 551-571
A proof procedure using connection graphs
R. Kowalski
Journal of the ACM
22
, 1975, pp. 572-595
On the interconnection of asynchronous control structures
J. Robert Jump
,
P.S. Thiagarajan
Journal of the ACM
22
(4), 1975, October, pp. 596-612
Seiten
<
1
2