Chung Kei Wong
- J. Nievergelt and C. K. Wong. Upper bounds for the total path
length of binary trees. Journal of the ACM, 20(1):1-6,
January 1973.
References,
Citations,
etc.
- P. C. Yue and C. K. Wong. On
the optimality of the probability ranking scheme in storage
applications. Journal of the ACM, 20(4):624-633,
October 1973.
References,
etc.
- C. K. Wong and Don Coppersmith. A combinatorial problem related to
multimodule memory organizations. Journal of the ACM,
21(3):392-402, July 1974.
References,
Citations,
etc.
- M. C. Easton and C. K. Wong. The effect of a capacity constraint
on the minimal cost of a partition. Journal of the ACM,
22(4):441-449, October 1975.
- C. K. Wong and Ashok K. Chandra. Bounds for the string editing
problem. Journal of the ACM, 23(1):13-16, January 1976.
Citations.
- D. S. Hirschberg and C. K. Wong. A polynomial-time algorithm for
the knapsack problem with two variables. Journal of the
ACM, 23(1):147-154, January 1976.
Citations.
- A. C. McKellar and C. K. Wong. Dynamic placement of records in
linear storage. Journal of the ACM, 25(3):421-434, July
1978.
Shortcuts: