This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H. Abelson, "Lower bounds on information transfer in distributed systems", J. ACM 27, 2, April 1980, 384–392.
F. Chin, H.F. Ting, "A near-optimal algorithm for finding the median distributively", Proc. 5th IEEE Conf. on Distributed Computing Systems, Denver, May 1985.
G.N. Frederickson, "Tradeoffs for selection in distributed networks", Proc. 2nd ACM Symp. on Principles of Distributed Computing, Montreal, Aug. 1983, 154–160.
G.N. Frederickson and D.B. Johnson, "The complexity of selection and ranking in X+Y and matrices with sorted columns", J. Computer and System Science 24, 2, April 1982, 197–208.
E. Korach, D. Rotem, N. Santoro, "Distributed algorithms for ranking the nodes of a network", Proc. 13th SE Conf. on Combinatorics, Graph Theory and Computing, Boca Raton, Feb. 1982, 235–246.
J.M. Marberg, E. Gafni, "An optimal shout-echo algorithm for selection in distributed sets", Proc. 23rd Allerton Conf. on Comm., Control and Computing, Monticello, Oct. 1985.
T.A. Matsushita, "Distributed algorithms for selection", Master Thesis, Department of Computer Science, University of Illinois, Urbana, July 1983.
M. Rodeh, "Finding the median distributively", J. Computer and System Science 24, 2, April 1982, 162–167.
D. Rotem, N. Santoro, J.B. Sidney, "Distributed sorting", IEEE Transactions on Computers C-34, 4, April 1985, 372–376.
D. Rotem, N. Santoro, J.B. Sidney, "Shout-echo selection in distributed files", Networks 16, 1986, 77–86.
N. Santoro, M. Scheutzow, J.B. Sidney, "New bounds on the communication complexity of distributed selection", J. Parallel and Distributed Computing, to appear.
N. Santoro, J.B. Sidney, "Order statistics on distributed sets", Proc. 20th Allerton Conf. on Communication, Control and Computing, Monticello, Oct. 1982, 251–256.
N. Santoro, J.B. Sidney, S.J. Sidney, "On the expected complexity of distributed selection", Tech. Rep. SCS-TR-69, School of Computer Science, Carleton University, Ottawa, Feb. 1985.
N. Santoro, E. Suen, "Reduction techniques for selection in distributed files", Proc. Int. Conf. on Parallel Processing, St. Charles, 1986, 1003–1009.
L. Shrira, N. Francez, M. Rodeh, "Distributed k-selection: from a sequential to a distributed algorithm", Proc. 2nd ACM Symp. on Principles of Distributed Computing, Montreal, Aug. 1983, 143–153.
A.C.C. Yao, "Some complexity questions related to distributive computing", Proc. 11th ACM Symp. on Theory of Computing, Atlanta, 1979, 209–213.
S. Zaks, "Optimal distributed algorithms for sorting and ranking", IEEE Transactions on Computers C-34, 4, April 1985, 376–379.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santoro, N., Sidney, J.B., Sidney, S.J. (1987). On the expected complexity of distributed selection. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039627
Download citation
DOI: https://doi.org/10.1007/BFb0039627
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17219-2
Online ISBN: 978-3-540-47419-7
eBook Packages: Springer Book Archive