| 期刊論文| 1. | Munro, J. I.、Paterson, M. S.(1980)。Selection and sorting with limited storage。Theoretical Computer Science，12，315-323。   | | 2. | Frederickson, G. N.(1982)。The complexity of selection and ranking in X + Y and matrices with sorted columns。Journal of Computer and System Science，24，197-208。 | | 3. | Cooper, J.、Akl, S. G.(1986)。Efficient selection on a binary tree。Information Processing Letters，23，123-126。 | | 4. | Ryu, K. W.、Jaja, J.(1990)。Efficient algorithms for list ranking and for solving graph problems on the hypercube。IEEE Transactions on Parallel and Distributed Systems，1(1)，83-90。 | 會議論文| 1. | Johnsson, S. L.(1984)。Combining parallel and sequential sorting on a boolean n-cube。ICCP。 | | 2. | Frederickson, G. N.(1983)。Tradeoff for selection in distributed networks。2nd ACM Symposium，154-160。 | |