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=1979
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Control system model for critically timed sources
R. Parchmann
Journal of the ACM
26
, 1979, pp. 1-5
Characterizing the storage process and its effect on the update of main memory by write through
A.J. Smith
Journal of the ACM
26
, 1979, pp. 6-27
Bounds on storage for consecutive retrieval
U. Gupta
Journal of the ACM
26
, 1979, pp. 28-36
On axiomatizing multivalued dependencies in relational databases
A.O. Mendelzon
Journal of the ACM
26
, 1979, pp. 37-44
Security in databases; a combinatorial study
S.P. Reiss
Journal of the ACM
26
, 1979, pp. 45-57
A fast selection algorithm and the problem of optimum distribution of effort
Z. Galil
,
N. Megiddo
Journal of the ACM
26
, 1979, pp. 58-64
Speedup in parallel algorithms for adaptive quadrature
J.M. Lemme
,
J.R. Rice
Journal of the ACM
26
, 1979, pp. 65-71
Odd-even reduction for banded linear equations
G.H. Rodrigue
,
N.K. Madsen
,
J.I. Karush
Journal of the ACM
26
, 1979, pp. 72-81
Estimating the mean of a correlated binary sequence with an application to discrete event simulation
G.S. Fishman
,
L.R. Moore
Journal of the ACM
26
, 1979, pp. 82-94
Optimality of the fast Fourier transform
C.H. Papadimitriou
Journal of the ACM
26
, 1979, pp. 95-102
Time bounded random access machines with parallel processing
W.J. Savitch
,
M.J. Stimson
Journal of the ACM
26
, 1979, pp. 103-118
A complete and consistent Hoare axiomatics for a simple programming language
J.C. Cherniavsky
,
S.N. Kamin
Journal of the ACM
26
, 1979, pp. 119-128
Programming language constructs for which it is impossible to obtain good Hoare axiom systems
E.M., Jr. Clarke
Journal of the ACM
26
, 1979, pp. 129-147
Minimal and optimal computations of recursive programs
G. Beery
,
J.-J. Lévy
Journal of the ACM
26
, 1979, pp. 148-176
An O
(n\log n)
algorithm for rectilinear minimal spanning trees
F.K. Hwang
Journal of the ACM
26
, 1979, pp. 177-182
A linear time algorithm for deciding interval graph isomorphism
G.S. Lueker
,
K.S. Booth
Journal of the ACM
26
, 1979, pp. 183-195
Optimality properties of multiple-key hashing functions
A. Bolour
Journal of the ACM
26
, 1979, pp. 196-210
A fast merging algorithm
M.R. Brown
,
R.E. Tarjan
Journal of the ACM
26
, 1979, pp. 211-226
A counting approach to lower bounds for selection problems
F. Fussenegger
,
H.N. Gabow
Journal of the ACM
26
, 1979, pp. 227-238
Integrals with a kernel in the solution of nonlinear equations in
N
dimensions
B. Kacewicz
Journal of the ACM
26
, 1979, pp. 239-249
Convergence and complexity of Newton iteration for operator equations
J.F. Traub
,
H. Woźniakowski
Journal of the ACM
26
, 1979, pp. 250-258
On the optimum checkpoint interval
E. Gelenbe
Journal of the ACM
26
, 1979, pp. 259-270
Regenerative simulation with internal controls
D.I. Iglehart
,
P.A.W. Lewis
Journal of the ACM
26
, 1979, pp. 271-282
Data structures and correctness of programs
T. Kowaltowski
Journal of the ACM
26
, 1979, pp. 283-301
Concurrent processes and their syntax
G. Milne
,
R. Milner
Journal of the ACM
26
, 1979, pp. 302-321
Seiten 1
2
3
>