Journal of the ACM Bibliography
C.
K. Wong and Don
Coppersmith. A combinatorial problem related to multimodule memory
organizations. Journal of the ACM, 21(3):392-402, July
1974.
[BibTeX entry]
Additional Key Words and Phrases:
combinatorial minimization, multimode memory organizations, nearly
optimum solutions, lower bounds, register-to-register transfers
Selected papers that cite this one
Selected references
- M. R. Garey, R. L. Graham, and J. D. Ullman. Worst-case analysis of
memory allocation algorithms. In Conference Record, Fourth
Annual ACM Symposium on Theory of Computing, pages 143-150,
Denver, Colorado, 1-3 May 1972.
- David S. Johnson. Approximation algorithms for
combinatorial problems. In Conference Record of Fifth Annual
ACM Symposium on Theory of Computing, pages 38-49, Austin, Texas,
30 April-2 May 1973.
- C. L. Liu. Optimal
scheduling on multi-processor computing systems. In 13th
Annual Symposium on Switching and Automata Theory, pages 155-160,
The University of Maryland, 25-27 October 1972. IEEE.
Shortcuts: