Book announcements 343

parison Sort of Complexity n log2 n, on Average; Storage Analysis of Quicksort; Average Time

Required by Quicksort. Related Problem: Insertion of a Key in an Ordered Array. Optimum Com-

parison Sorting: Lower Bound on the Maximum Number of Comparisons; Lower Bound on the

Average Number of Comparisons. Related Problem: Finding the kth Largest of n: Bounds on the

Maximum Number of Comparisons; Upper Bound on the Average Number of Comparisons. Exer-

cises. Chapter 8: Large Scale Data Processing: External Sorting Using Magnetic Tapes. The 2-way

Merge: Comparisons in the 2-Way Merge. Merge Sorting: Maximum Number of Comparisons

Required by the Balanced 2.Way Merge. The Use of Merge in External Sorting: Main Characteristics

Which Effect the Performance of an External Sorting Algorithm. The Number of Complete Passes

Required by the Balanced P-Way Merge. Polyphase Merge and Perfect Fibonacci Distributions: The

Number of Complete Passes Required. The Cascade Merge: The Number of Complete Passes

Required. The Oscillating Sort: The Number of Complete Passes Required. Generation of the Initial

Subfiles. Merge Trees and Optimum Merge Sorting. Exercises. Chapter 9: Searching. Introduction.

Classification of Search Algorithms. Ordered Tables: Algorithm for Sequential Search; Algorithm

for Binary Search; Algorithm for Fibonaccian Search. Search Trees: Binary Tree Search Methods

and Data Structures; Search Methods for Unequal Distribution Tables; Optimum Cost Trees;

Algorithm for Computing and Construction of Minimum-Cost Binary Tree. A Tree Search Followed

by Insertion or Deletion of the Key: A Tree Search and Insertion Algorithm; A Tree Search and Dele-

tion Algorithm. Methods for Rebalancing the Search Trees: The Balances Trees Method of Adelson-

Velski and Landis (The AVL Trees). Hashing. Computing the Initial Hashing Function: Distribution-

Dependent Hashing Functions; Cluster-Separating Hashing Functions; Distribution-Independent

Hashing Functions; A Multiplicative Hashing Function. Collision Resolution by Open Addressing:

The Pile-Up and Secondary Clustering Phenomena; Open Addressing Algorithms. Efficiency

Analysis of the Open Addressing Algorithms: Analysis of Linear Probing; Analysis of the Uniform

Hashing Model and Optimality Considerations. Exercises. Appendix A. Some Basis Results on the

Error Analysis of the Floating-Point Matrix Multiplications and the Solution of Sets of Linear Equa-

tions. Appendix B. Some Basic Preliminaries on Laws of Probability and Statistical Analysis. Biblio-

graphy and References. Index.

Digital Image Processing Systems, Leonard BOLC and Zenon KULPA, Editors, Lecture Notes in

Computer Science, Vol. 109. (Springer-Verlag, Berlin - Heidelberg - New York, 1981) 353 pp.

Preface. Z. Kulpa: Universal digital image processing systems in Europe - a comparative survey.

E. Bengfsson, 0. Eriksson, T. Jarkrans, B. Nordin, B. Slenkvist: CELLO-an interactive system for

image analysis. T. Vdmos, M. Bdthor, L. M&o, A. Siegler: A knowledge-based interactive robot-

vision system. J.P. Foith, C. Eisenbarth, E. Enderle, H. Geisselmann, H. Ringshawser, G. Zimmer-

mann: Real-time processing of binary images for industrial applications. Z. Kulpa, J. Dernafowicz,

H. T. Nowicki, A. Bielik: CPO-2/K-202: A universal digital image analysis system. G.H. Granlund:

The GOP parallel image processor. D.L. Milgram, A. Rosenfeld: Object detection in infrared

images.

L.P.J. GROENEWEGEN, Characterization of Optimal Strategies in Dynamic Games, Mathematical

Centre Tracts 90 (Mathematisch Centrum, Amsterdam, 1981) 110 pp.

Chapter I: Introduction. Chapter 2: The D/G/G/I process with a general utility. The D/G/G/l

process, Characterization of v-optimal strategies. Chapter 3: The D/G/G/I process with a recursive

utility. t-Recursive utilities, Characterization of v-optimality if the utility is recursive, Remarks and

examples. Chapter 4: The C/G/G/I process. The description of the C/G/G/I process, General

utility, Recursive utility. Chapter 5: The D(and C)/G/G/Z process with a zero-sum utility. The

D/G/G/n process, The D/G/G/2 process with a recursive zero-sum utility, The C/G/G/2 process

with a zero-sum utility. Chapter 6: The D/G/G/n process and the C/G/G/n process. Characteriza-

tions of optimality in the C(and D)/G/G/n process. Notations. Index. References.