
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Danny Z. Chen, "Efficient Parallel Binary Search on Sorted Arrays, with Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 4, pp. 440445, April, 1995.  
BibTex  x  
@article{ 10.1109/71.372799, author = {Danny Z. Chen}, title = {Efficient Parallel Binary Search on Sorted Arrays, with Applications}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {6}, number = {4}, issn = {10459219}, year = {1995}, pages = {440445}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.372799}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Efficient Parallel Binary Search on Sorted Arrays, with Applications IS  4 SN  10459219 SP440 EP445 EPD  440445 A1  Danny Z. Chen, PY  1995 VL  6 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S. G. Akl and H. Meijer,“Parallel binary search,”IEEE Trans. Parallel Distrib. Syst., vol. 1, pp. 247–250, 1990.
[2] M.J. Atallah,R. Cole,, and M.T. Goodrich,“Cascading divideandconquer: A technique for designing parallelalgorithms,” SIAM J. Computing, vol. 18, no. 3, pp. 499532, 1989.
[3] P. Bertolazzi, S. Salza, and C. Guerra,“A parallel algorithm for the visibility problem from a point,”J. Parallel Distrib. Computing, vol. 9, pp. 11–14, 1990.
[4] G. Bilardi and A. Nicolau,“Adaptive bitonic sorting: An optimal parallel algorithm for sharedmemory machines,”SIAM J. Comput., vol. 18, pp. 216–228, 1989.
[5] R.P. Brent, "The Parallel Evaluation of General Arithmetic Expressions," J. ACM, vol. 21, pp. 201206, 1974.
[6] D. Z. Chen,“Efficient parallel binary search on sorted arrays,”Tech. Rep. 1009, Dept. Comput. Sci., Purdue University, W. Lafayette, IN, Aug. 1990.
[7] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770785, 1988.
[8] T. Hagerup and C. Rub,"Optimal merging and sorting on the EREW PRAM," Information Processing Letters, vol. 33, pp. 181185, 1989.
[9] C. P. Kruskal, L. Rudolph, and M. Snir,“The power of parallel prefix,”IEEE Trans. Comput., vol. C34, pp. 965–968, 1985.
[10] R.E. Ladner and M.J. Fischer, "Parallel Prefix Computation," J. ACM, vol. 27, no. 4, pp. 831838, Oct. 1980.
[11] S. D. Lang and N. Deo,“Recursive batched binary searching of sequential files,”Comput. J., to be published.
[12] H. Meijer and S. Akl,“Parallel binary search with delayed read conflicts,”Int. J. High Speed Computing, vol. 2, no. 1, pp. 17–21, 1990.
[13] W. Paul, U. Vishkin, and H. Wagener,“Parallel dictionaries on 23 trees,”Tech. Rep. 70, Courant Inst., New YorkUniv., 1983.