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=1972
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding the lengths of all shortest paths in N-node nonnegative-distance complete networks using
\frac{1}{2}N^3
additions and
N^3
comparisons
Jin Y. Yen
Journal of the ACM
19
, 1972, pp. 423-424
Practical aspects of doubly chained trees for retrieval
L.E. Stanfel
Journal of the ACM
19
, 1972, pp. 425-436
Inversion of persymmetric matrices having Toeplitz inverses
Nancy M. Huang
,
Randall E. Cline
Journal of the ACM
19
, 1972, pp. 437-444
Nonpriority multiprogramming systems under heavy demand conditions - customer's viewpoint
I. Mitrani
Journal of the ACM
19
, 1972, pp. 445-452
Busy period analysis of a time-sharing system: transform inversion
Richard E. Nance
,
U. Narayan Bhat
,
Billy G. Claybrook
Journal of the ACM
19
, 1972, pp. 453-463
Processor sharing queuing models of mixed scheduling disciplines for time shared systems
L. Kleinrock
,
R.R. Muntz
Journal of the ACM
19
, 1972, pp. 464-482
A stochastic model for message assembly buffering with a comparison of bloc assignment strategies
Gary D. Schultz
Journal of the ACM
19
, 1972, pp. 483-495
An approach for finding
C
-linear complete inference systems
James R. Slagle
Journal of the ACM
19
, 1972, pp. 496-516
The expression of algorithms by charts
J. Bruno
,
K. Steiglitz
Journal of the ACM
19
, 1972, pp. 517-525
Subrecursive programming languages, part I: Efficiency and program structure
Robert L. Constable
,
Allan B. Borodin
Journal of the ACM
19
, 1972, pp. 526-568
A note on the efficiency of hashing functions
J.D. Ullman
Journal of the ACM
19
, 1972, pp. 569-575
Computer approaches to the representations of Lie algebras
Robert E. Beck
,
Bernard Kolman
Journal of the ACM
19
, 1972, pp. 577-589
An axiomatic approach to code optimization for expressions
James C. Beatty
Journal of the ACM
19
, 1972, pp. 613-640
Bounds on optimal merge performance, and a strategy for optimality
W.D. Frazer
,
B.T. Bennett
Journal of the ACM
19
, 1972, pp. 641-648
On the optimality of some set algorithms
Edward M. Reingold
Journal of the ACM
19
, 1972, pp. 649-659
Computational work and time on finite machines
J.E. Savage
Journal of the ACM
19
, 1972, pp. 660-674
On the covering and reduction problems for context-free grammars
James N. Gray
,
Michael A. Harrison
Journal of the ACM
19
, 1972, pp. 675-698
The generation of minimal trees with a Steiner topology
Shi-Kuo Chang
Journal of the ACM
19
, 1972, pp. 699-711
Accelerated algorithms for labeling and relabeling of trees, with applications to distribution problems
V. Srinivasan
,
G.L. Thompson
Journal of the ACM
19
, 1972, pp. 712-726
A note on feedback queues with bulk service
Carl M. Harris
,
Paul G. Marlin
Journal of the ACM
19
, 1972, pp. 727-733
A minimum variance sampling technique for simulation models
A.J. Bayes
Journal of the ACM
19
, 1972, pp. 734-741
Towards a formal theory of modeling and simulation: Structure preserving morphisms
Bernard P. Zeigler
Journal of the ACM
19
, 1972, pp. 742-764
Simple computation-universal cellular spaces
Alvy Ray Smith III
Journal of the ACM
18
, 1972, pp. 339-353
The runs up-and-down performance of Tausworthe pseudo-random number generators
J.P.R. Tootill
,
W.D. Robinson
,
A.G. Adams
Journal of the ACM
18
, 1972, pp. 381-399
Seiten
<
1
2