
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
N. Santoro, E. Suen, "Reduction Techniques for Selection in Distributed Files," IEEE Transactions on Computers, vol. 38, no. 6, pp. 891896, June, 1989.  
BibTex  x  
@article{ 10.1109/12.24301, author = {N. Santoro and E. Suen}, title = {Reduction Techniques for Selection in Distributed Files}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {6}, issn = {00189340}, year = {1989}, pages = {891896}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.24301}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Reduction Techniques for Selection in Distributed Files IS  6 SN  00189340 SP891 EP896 EPD  891896 A1  N. Santoro, A1  E. Suen, PY  1989 KW  distributed files; communication network; reduction technique; distributed algorithm; distributed reduction techniques; shoutecho networks; pointtopoint networks; communication complexity; multiplicative constant; distributed processing; file organisation; telecommunication networks. VL  38 JA  IEEE Transactions on Computers ER   
[1] F. Chin and H. F. Ting, "A nearoptimal algorithm for finding the median distributively," inProc. 5th IEEE Conf. Distribut. Comput. Syst., Denver, CO, May 1985.
[2] G. N. Frederickson, "Tradeoffs for selection in distributed networks," inProc. 2nd ACM PODC, Aug. 1983, pp. 154160.
[3] G. N. Frederickson and D. B. Johnson, "The complexity of selection and ranking inX+Yand matrices with sorted columns,"J. Comput. Syst. Sci., vol. 24, pp. 197208, Apr. 1982.
[4] D. B. Johnson and T. Mizoguchi, "Selecting theKth element inX+YandX1+X2+...+Xm," SIAM J. Comput., vol. 7, pp. 556570, 1978.
[5] J. M. Marberg and E. Gafni, "An optimal shoutecho algorithm for selection in distributed sets,"Proc. 23rd Allerton Conf. Commun., Contr., Comput., Monticello, Oct. 1985.
[6] T. A. Matsuhita, "Distributed algorithms for selection," Master Thesis, Dep. Comput. Sci., Univ. of Illinois, Urbana, IL, July 1983.
[7] M. Rodeh, "Finding the median distributively,"J. Comput. Syst. Sci., vol. 24, pp. 162167, Apr. 1982.
[8] D. Rotem, N. Santoro, and J. B. Sidney, "A shoutecho algorithm for finding the median of a distributed set," inProc. 14th SE Conf. Combinatorics, Graph Theory Comput., Boca Raton, FL, Feb. 1983, pp. 311318.
[9] D. Rotem, N. Santoro, and J. B. Sidney, "Distributed sorting,"IEEE Trans. Comput., vol. C34, pp. 362376, Apr. 1985.
[10] D. Rotem, N. Santoro, and J. B. Sidney, "Shoutecho selection in distributed files,"Networks, vol. 16, pp. 7786, 1986.
[11] N. Santoro, M. Scheutzow, and J. B. Sidney, "On the expected communication complexity of distributed selection,"J. Parallel Distribut. Comput., to be published.
[12] N. Santoro and J. B. Sidney, "Order statistics on distributed sets," inProc. 20th Allerton Conf. Commun., Contr., Comput., Monticello, Oct. 1982, pp. 251256.
[13] N. Santoro, J. B. Sidney, and S. J. Sidney, "On the expected complexity of distributed selection," inProc. 4th Symp. Theoret. Aspects Comput. Sci., Passau, Feb. 1987, pp. 456467.
[14] L. Shirira, N. Francez, and M. Rodeh, "Distributedkselection: From a sequential to a distributed algorithm," inProc. 2nd ACM Symp. Principles of Distribut. Comput., Montreal, P.Q., Canada, Aug. 1983, pp. 143153.