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 YEAR=1974
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Provably efficient scheduling for languages with fine-grained parallelism
Guy E. Blelloch
,
Phillip B. Gibbons
,
Yossi Matias
Journal of the ACM
46
(2), 1999, pp. 281-321
On a statistical model of Strand and Westwater for the numerical solution of a Fredholm integral equation of the first kind
D.G. Herr
Journal of the ACM
21
, 1974, pp. 1-5
Some a posteriori error bounds in floating-point computations
N.-K. Tsao
Journal of the ACM
21
, 1974, pp. 6-17
Processing times for segmented jobs with I/O compute overlap
L.W. Cotten
,
A.M. Abd-Alla
Journal of the ACM
21
, 1974, pp. 18-30
Some distribution-free aspects of paging algorithm performance
P.A. Franaszek
,
T.J. Wagner
Journal of the ACM
21
, 1974, pp. 31-39
Finding optimal demand paging algorithms
G. Ingargiola
,
J.F. Korsh
Journal of the ACM
21
, 1974, pp. 40-53
Some aspects of hierarchical memory systems
D. Mitra
Journal of the ACM
21
, 1974, pp. 54-65
Scheduling for minimum total loss using service time distributions
K.C. Sevcik
Journal of the ACM
21
, 1974, pp. 66-75
Some topics in code optimization
C. Earnest
Journal of the ACM
21
, 1974, pp. 76-102
Simulating stable stochastic systems I: General multiserver queues
M.A. Crane
,
D.I. Iglehart
Journal of the ACM
21
, 1974, pp. 103-113
Simulating stable stochastic systems II: Markov chains
M.A. Crane
,
D.I. Iglehart
Journal of the ACM
21
, 1974, pp. 114-123
An implementation of the model elimination proof procedure
S. Fleisig
,
D. Loveland
,
A.K. Smiley III
,
D.L. Yarmush
Journal of the ACM
21
, 1974, pp. 124-139
Characterization and theoretical comparison of branch-and-bound algorithms for permutation problems
W.M. Kohler
,
K. Steiglitz
Journal of the ACM
21
, 1974, pp. 140-156
A theorem in the theory of compromise merge methods
P.S. Kritzinger
,
J.W. Graham
Journal of the ACM
21
, 1974, pp. 157-160
On the number of multiplications for the evaluation of a polynomial and some of its derivatives
M. Shaw
,
J.F. Traub
Journal of the ACM
21
, 1974, pp. 161-167
The string-to-string correction problem
R.A. Wagner
,
M.J. Fisher
Journal of the ACM
21
, 1974, pp. 168-174
Some binary derivation systems
D. Michie
,
E.E. Sibert
Journal of the ACM
21
, 1974, pp. 175-190
A new class of automated theorem-proving algorithms
R.A. Overbeek
Journal of the ACM
21
, 1974, pp. 191-200
Further results on the problem of finding minimal length programs for decision tables
D. Pager
Journal of the ACM
21
, 1974, pp. 207-212
Grammar schemata
A. Gabrielian
,
S. Ginsburg
Journal of the ACM
21
, 1974, pp. 213-226
A modified list technique allowing binary search
G. Berman
,
A.W. Colijn
Journal of the ACM
21
, 1974, pp. 227-232
A document storage method based on polarized distance
R.T. Chien
,
E.A. Mark
Journal of the ACM
21
, 1974, pp. 233-245
Efficient storage and retrieval by content and address of static files
P. Elias
Journal of the ACM
21
, 1974, pp. 246-260
Calculating the eigenvectors of diagonally dominant matrices
M.M. Blevins
,
G.W. Stewart
Journal of the ACM
21
, 1974, pp. 261-271
The solution of a Toeplitz set of linear equations
S. Zohar
Journal of the ACM
21
, 1974, pp. 272-276
Seiten 1
2
3
>