
- 1 AsH, R.B. Information Theory. Interscience, New York, 1965.Google Scholar
- 2 BECKENBACH, E. F., AND BELLMAN, R. Inequalities. SpringerWerlag, Berlin, 1961.Google Scholar
- 3 BENNETT, B. T., AND FRAZER, W. D. Approximating optimal direct-access merge performance. Proc. IFIP Cong. 1971, North-Holland Pub. Co., Amsterdam (in press).Google Scholar
- 4 BURGE, W.H. Sorting, trees, and measures of order. Information and Control I (1958), 181-197.Google Scholar
- 5 GALLAGHER, R. G. Information Theory and Reliable Communication. Wiley, New York, 1968. Google Scholar
- 6 HVFFMAN, D. A. A method for the construction of minimum redundancy codes. Proc. IRE (Sept. 1952). 1098-1101.Google Scholar
- 7 KNUTH, D .E . Length of strings for a merge sort. Comm. ACM 6, 11 (Nov. 1963), 685--688. Google Scholar
Index Terms
Bounds on Optimal Merge Performance, and a Strategy for Optimality
Recommendations
Bounds to optimal burn-in and optimal work size: Research Articles
Burn-in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn-in time and optimal work size maximizing the long-run average amount of ...
Optimal disk merge patterns
Our purpose is to study the optimal way to merge n initially sorted runs, stored on a disk like device, into a unique sorted file. This problem is equivalent to finding a tree with n leaves which minimizes a certain cost function (see Knuth [1]).
We ...
Criteria of optimality in the infinite-time optimal control problem
The present paper gives a systematic presentation of different definitions of optimality in the infinite-time optimal control problem. Some of these definitions are new, while others have been used throughout the literature, sometimes with different ...






Comments