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. ACM AND Volume=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An axiomatic approach to code optimization for expressions
J.C. Beatty
Journal of the ACM
20
, 1973, pp. 188
Upper bounds for the total path length of binary trees
I. Nievergelt
,
C.K. Wong
Journal of the ACM
20
, 1973, pp. 1-6
A
-stable composite multistep methods
H.M. Sloate
,
T.A. Bickart
Journal of the ACM
20
, 1973, pp. 7-26
An efficient parallel algorithm for the solution of a tridiagonal linear system of equations
Harold S. Stone
Journal of the ACM
20
(1), 1973, January, pp. 27-38
A combinatorial problem related to interleaved memory systems
G.J. Burnett
,
E.G., Jr. Coffman
Journal of the ACM
20
, 1973, pp. 39-45
Scheduling algorithms for multiprogramming in a hard-real-time environment
C.L. Liu
,
James W. Layland
Journal of the ACM
20
(1), 1973, January, pp. 46-61
Mathematical models for automatic line detection
A.K. Griffith
Journal of the ACM
20
, 1973, pp. 62-80
Acrs and curves in digital pictures
A. Rosenfeld
Journal of the ACM
20
, 1973, pp. 81-87
Efficient exercising of switching elements in nets of identical gates
D.L. Richards
Journal of the ACM
20
, 1973, pp. 88-111
The solvability of the decision problem for classes of proper formulas and related results
R.A. Di Paola
Journal of the ACM
20
, 1973, pp. 112-126
Z-resolution: Theorem-proving with compiled axioms
J.K. Dixon
Journal of the ACM
20
, 1973, pp. 127-147
A class of merging algorithms
F.K. Hwang
,
D.N. Deutsch
Journal of the ACM
20
(1), 1973, January, pp. 148-159
Tree-manipulating systems and Church-Rosser theorems
Barry K. Rosen
Journal of the ACM
20
(1), 1973, January, pp. 160-187
Set covering by an all integer algorithm: Computational experience
H.M. Salkin
,
R.D. Koncal
Journal of the ACM
20
, 1973, pp. 189-193
Benefit-cost analysis of coding techniques for the primal transportation algorithm
V. Srinivasan
,
G.L. Thompson
Journal of the ACM
20
, 1973, pp. 194-213
Canonical precedence schemes
J.N. Gray
,
M.A. Harrison
Journal of the ACM
20
, 1973, pp. 214-234
A formalization of transition diagram systems
D.B. Lomet
Journal of the ACM
20
, 1973, pp. 235-257
Recent studies in automatic text analysis and document retrieval
G. Salton
Journal of the ACM
20
, 1973, pp. 258-278
Best least squares solutions to finite difference equations using the generalized inverse and tensor product methods
J.F. Dalphin
,
V. Lovass-Nagy
Journal of the ACM
20
, 1973, pp. 279-289
Optimal covering algorithms in methods of search for solving polynomial equations
A. Friedli
Journal of the ACM
20
, 1973, pp. 290-300
A midpoint phenomenon
A.J. Goldstein
,
P.L. Richman
Journal of the ACM
20
, 1973, pp. 301-304
Note on a lower bound of the linear complexity of the fast Fourier transform
J. Morgenstern
Journal of the ACM
20
, 1973, pp. 305-306
Optimization of static loading and sizing of multilevel memory systems
S.R. Arora
,
A. Gallo
Journal of the ACM
20
, 1973, pp. 307-319
Efficient exercising of switching elements in combinational nets
D.L. Richards
Journal of the ACM
20
, 1973, pp. 320-332
A complete mechanization of second-order type theory
T. Pietrzykowski
Journal of the ACM
20
, 1973, pp. 333-364
Seiten 1
2
3
>