Skip to main content
SpringerLink
Log in
Book cover

Workshop on Algorithms and Data Structures

WADS 1993: Algorithms and Data Structures pp 464–470Cite as

A time-randomness tradeoff for selection in parallel

  • Conference paper
  • First Online:

  • 147 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 709))

Abstract

In this paper we study the problem finding the median on a parallel comparison tree (PCT). Results due to Valiant [11], Meggido

Research was supported in part by the Natural Sciences and Engineering Research Council of Canada, research grant OGP0137991.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. J. Karloff and P. Raghavan, Randomized Algorithms and Pseudorandom Numbers, Proc. of 20th ACM Symp. on Theory of Computing, 1988, pp. 310–321.

    Google Scholar 

  2. D. Krizanc, D. Peleg and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, Proc. of 20th ACM Symp. on Theory of Computing, 1988, pp. 93–102.

    Google Scholar 

  3. N. Meggido, Parallel Algorithms for Finding the Maximum and the Median Almost Surely in Constant-time, Carnegie-Mellon University, Oct. 1982.

    Google Scholar 

  4. K. Mulmuley, Randomized Geometric Algorithms and Pseudo-Random Generators, Proc. of 33rd Symp. on Foundations of Computer Science, 1992, pp. 90–100.

    Google Scholar 

  5. D. Peleg and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, SIAM J. of Computing 20, (1989), pp. 396–409.

    Google Scholar 

  6. N. Pippenger, Sorting and Selecting in Rounds, SIAM J. of Computing 16, (1987), pp. 1032–1038.

    Google Scholar 

  7. M. O. Rabin, Probabilistic Algorithms, in Algorithms and Complexity, Recent Results and New Directions, (J. F. Traub, Ed.), Academic Press, New York, (1976), pp. 21–40.

    Google Scholar 

  8. A. G. Ranade, Constrained Randomization for Parallel Communication, Yale Univeristy Technical Report TR-511, 1987.

    Google Scholar 

  9. R. Reischuk, Probabilistic Parallel Algorithms for Sorting and Selection, SIAM J. of Computing 14, (1985), pp. 396–409.

    Google Scholar 

  10. J. Schmidt, A. Seigel and A. Srinivasan, Chernoff-Hoeffding Bounds for Applications with Limited Independence, Proc. of 4th Symp. on Discrete Algorithms, 1993, pp. 331–340.

    Google Scholar 

  11. L. G. Valiant, Parallelism in Comparison Problems, SIAM J. of Computing 4, (1975), pp. 348–355.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, K1S 5B6, Ottawa, Ontario

    Danny Krizanc

Authors
  1. Danny Krizanc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro Sue Whitesides

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krizanc, D. (1993). A time-randomness tradeoff for selection in parallel. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_271

Download citation

  • DOI: https://doi.org/10.1007/3-540-57155-8_271

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57155-1

  • Online ISBN: 978-3-540-47918-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation