论文信息 - Cache-oblivious selection in sorted X

Cache-oblivious selection in sorted X

Let X[0..n-1] and Y[0..m-1] be two sorted arrays, and define the mxn matrix A by A[j][i]=X[i]+Y[j]. Frederickson and Johnson [G.N. Frederickson, D.B. Johnson, Generalized selection and ranking: Sorted matrices, SIAM J. Computing 13 (1984) 14-30] gave an efficient algorithm for selecting the kth smallest element from A. We show how to make this algorithm IO-efficient. Our cache-oblivious algorithm performs O((m+n)/B) IOs, where B is the block size of memory transfers.

Mark de Berg | Shripad Thite | M. D. Berg | Shripad Thite

[1] Manuel Blum,et al. Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[2] Klara Kedem,et al. On Some Geometric Selection and Optimization Problems via Sorted Matrices , 1995, WADS.

[3] Marc J. van Kreveld,et al. Labeling a Rectilinear Map More Efficiently , 1999, Inf. Process. Lett..

[4] Michael Segal,et al. A framework for 1-D compaction with forbidden region avoidance , 1992 .

[5] Donald B. Johnson,et al. Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..

[6] Micha Sharir,et al. Efficient algorithms for geometric optimization , 1998, CSUR.

[7] Matthew J. Katz,et al. Computing Fair and Bottleneck Matchings in Geormetric Graphs , 1996, ISAAC.

[8] Clifford Stein,et al. Introduction to Algorithms, 2nd edition. , 2001 .

[9] Mark de Berg,et al. Computing the Maximum Overlap of Two Convex Polygons under Translations , 1996, Theory of Computing Systems.

[10] Matteo Frigo,et al. Cache-oblivious algorithms , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[11] Donald B. Johnson,et al. Erratum: Generalized Selection and Ranking: Sorted Matrices , 1990, SIAM J. Comput..

[12] Micha Sharir,et al. Rectilinear and polygonal p-piercing and p-center problems , 1996, SCG '96.

[13] Alok Aggarwal,et al. The input/output complexity of sorting and related problems , 1988, CACM.

[14] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .