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=1980
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the generation of binary trees
A. Proskurowski
Journal of the ACM
27
(1), 1980, pp. 1-2
A note on enumerating binary trees
M. Solomon
,
R.A. Finkel
Journal of the ACM
27
(1), 1980, pp. 3-5
An optimal routing algorithm for mesh-connected parallel computers
D. Nassimi
,
S. Sahni
Journal of the ACM
27
(1), 1980, pp. 6-29
Message waiting time in a package switching system
K. Pawlikowski
Journal of the ACM
27
(1), 1980, pp. 30-41
Polling in a loop system
G.B. Swartz
Journal of the ACM
27
(1), 1980, pp. 42-59
Synchronization problems solvable by generalized PV systems
P.B. Henderson
,
Y. Zalcstein
Journal of the ACM
27
(1), 1980, pp. 60-71
Consistency in hierarchical database systems
A. Silberschatz
,
Z. Kedem
Journal of the ACM
27
(1), 1980, pp. 72-80
External hashing schemes for collections of data structures
R.J. Lipton
,
A.L. Rosenberg
,
A.C. Yao
Journal of the ACM
27
(1), 1980, pp. 81-95
Stack machines and classes of nontested macro languages
J. Engelfriet
,
E.M. Schmidt
,
J. van Leeuwen
Journal of the ACM
27
(1), 1980, pp. 96-117
A polynomial algorithm for the two-variable integer programming problem
R. Kannan
Journal of the ACM
27
(1), 1980, pp. 118-122
Space-time tradeoffs in structured programming: An improved combinatorial embedding theorem
R.A. DeMillo
,
S.C. Eisenstat
,
R.J. Lipton
Journal of the ACM
27
(1), 1980, pp. 123-127
A scheme for the automatic inference of variable types
M.A. Kaplan
,
J.D. Ullman
Journal of the ACM
27
(1), 1980, pp. 128-145
Efficient computation of expressions with common subexpressions
B. Prabhala
,
R. Sethi
Journal of the ACM
27
(1), 1980, pp. 146-163
Continuation-based program transformation strategies
M. Wand
Journal of the ACM
27
(1), 1980, pp. 164-180
The number of fanout-free functions with various gates
E.A. Bender
Journal of the ACM
27
(1), 1980, pp. 181-190
Verification decidability of Presburger array programs
N. Suzuki
,
D. Jefferson
Journal of the ACM
27
(1), 1980, pp. 191-205
New algorithms for bin packing
A.C.-C. Yao
Journal of the ACM
27
(2), 1980, pp. 207-227
Reaching agreements in the presence of faults
M. Pease
,
R. Shostak
,
L. Lamport
Journal of the ACM
27
(2), 1980, pp. 228-234
Equality and domain closure for first-order databases
R. Reiter
Journal of the ACM
27
(2), 1980, pp. 235-249
An algorithm for inferring multivalued dependencies with an application to propositional logic
Y. Sagiv
Journal of the ACM
27
(2), 1980, pp. 250-262
Testing deadlock-freedom of computer systems
T. Kameda
Journal of the ACM
27
(2), 1980, pp. 270-280
The cycle time distribution of exponential cyclic queues
W.-M. Chow
Journal of the ACM
27
(2), 1980, pp. 281-286
A new algorithm for preemptive scheduling of trees
T.F. Gonzalez
,
D.B. Johnson
Journal of the ACM
27
(2), 1980, pp. 287-312
Mean value analysis of closed multichain queuing networks
M. Reiser
,
S.S. Lavenberg
Journal of the ACM
27
(2), 1980, pp. 313-322
Queuing network models with state-dependent routing
D. Towsley
Journal of the ACM
27
(2), 1980, pp. 323-337
Seiten 1
2
3
>