This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.L. Bentley, A.C. Yao, "An almost optimal algorithm for unbounded searching", Information Processing Letters 5, 3, Aug. 1976, 82–87.
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.
E. Korach, D. Rotem, N. Santoro, "Distributed algorithms for finding centers and medians in networks", ACM Trans. on Programming Languages and Systems 6, 3, July 1984, 380–401.
J. van Leeuwen, N. Santoro, J. Urrutia, S. Zaks, "Guessing games and distributed computations in synchronous networks", Proc. 14th Int. Conf. on Automata, Languages and Programming, Karlsruhe, July 1987, 347–356.
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, "Shout-echo selection in distributed files", Networks 16, 1986, 77–86.
D. Rotem, N. Santoro, J.B. Sidney, "Distributed sorting", IEEE Transactions on Computers C-34, 4, April 1985, 372–376.
N. Santoro, M. Scheutzow, J.B. Sidney, "On the 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", Proc. 4th Symp. on Theoretical Aspects of Computer Science, Passau, Feb. 1987, 456–467.
N. Santoro, E. Suen, "Reduction techniques for selection in distributed files", IEEE Transactions on Computers, to appear.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Negro, A., Santoro, N., Urrutia, J. (1988). On the packet complexity of distributed selection. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019798
Download citation
DOI: https://doi.org/10.1007/BFb0019798
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19366-1
Online ISBN: 978-3-540-39239-2
eBook Packages: Springer Book Archive