
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Dina Kravets, C. Greg Plaxton, "All Nearest Smaller Values on the Hypercube," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 5, pp. 456462, May, 1996.  
BibTex  x  
@article{ 10.1109/71.503770, author = {Dina Kravets and C. Greg Plaxton}, title = {All Nearest Smaller Values on the Hypercube}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {5}, issn = {10459219}, year = {1996}, pages = {456462}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.503770}, 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  All Nearest Smaller Values on the Hypercube IS  5 SN  10459219 SP456 EP462 EPD  456462 A1  Dina Kravets, A1  C. Greg Plaxton, PY  1996 KW  All nearest smaller values KW  normal hypercube algorithm KW  monotone polygon triangulation KW  Cartesian tree. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Given a sequence of
[1] A. Aggarwal, D. Kravets, J.K. Park, and S. Sen, "Parallel Searching in Generalized Monge Arrays with Applications," Proc. Second Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 259268, 1990.
[2] M.J. Atallah and D.Z. Chen, "Optimal Parallel Hypercube Algorithms for Polygon Problems," Proc. Fifth IEEE Symp. Parallel and Distributed Processing, pp. 208215, 1993.
[3] O. Berkman, B. Schieber, and U. Vishkin, "Optimal Doubly Logarithmic Parallel Algorithms Based on Finding Nearest Smaller Values," J. Algorithms, vol. 14, no. 3, pp. 344370, 1993.
[4] A. Borodin and J.E. Hopcroft,"Routing, merging and sorting on parallel models of comparison," J. Computer and System Science, vol. 30, pp. 130145, 1985.
[5] D.Z. Chen, "Efficient Geometric Algorithms in the EREWPRAM," Proc. 28th Ann. Allerton Conf. Comm., Control, and Computing, pp. 818827, 1990.
[6] J.F. JáJá and K.W. Ryu, "Optimal Algorithms on the Pipelined Hypercube and Related Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, pp. 582591, 1993.
[7] C.P. Kruskal, "Searching, Merging, and Sorting," IEEE Trans. Computers, vol. 32, no. 10, pp. 942946, 1983.
[8] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[9] E.W. Mayr and R. Werchner, "Optimal Routing of Parentheses on the Hypercube," Proc. Fourth Ann. ACM Symp. Parallel Algorithms and Architectures, pp. 109117, 1992.
[10] L.G. Valiant, "Parallelism in Comparison Problems," SIAM J. Computing, vol. 4, pp. 348355, 1975.
[11] J. Vuillemin, "A Unified Look at Data Structures," Comm. ACM, vol. 23, pp. 229239, 1980.