Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

article · 2002

Sorting-based selection algorithms for hypercubic networks

Pascal Berthomé, A. Ferreira, Bruce M. Maggs, S. Pérennes, C. Gregory Plaxton

Cited by 18Abstract and details only

Abstract

This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based on the selection algorithm of Cole and Yap (1985), as well as on various sorting algorithms for hypercubic networks. The authors fastest algorithm runs in O(lg n lg*n) time, very nearly matching the trivial Omega (lg n) lower bound. Previously, the best upper bound known for selection was O(lg n lg lg n).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cite this paper

APA 7

Berthomé, P., Ferreira, A., Maggs, B. M., Pérennes, S., & Plaxton, C. G. (2002). Sorting-based selection algorithms for hypercubic networks. https://doi.org/10.1109/ipps.1993.262861

MLA 9

Berthomé, Pascal, et al. “Sorting-based selection algorithms for hypercubic networks.” 2002, pp. 89–95, https://doi.org/10.1109/ipps.1993.262861.

Chicago

Berthomé, Pascal, A. Ferreira, Bruce M. Maggs, S. Pérennes, and C. Gregory Plaxton. 2002. “Sorting-based selection algorithms for hypercubic networks.” https://doi.org/10.1109/ipps.1993.262861.

Harvard

Berthomé, P. et al. (2002) ‘Sorting-based selection algorithms for hypercubic networks’. Available at: https://doi.org/10.1109/ipps.1993.262861.

BibTeX
@article{berthome2002sorting,
  title = {{Sorting-based selection algorithms for hypercubic networks}},
  author = {Berthomé, Pascal and Ferreira, A. and Maggs, Bruce M. and Pérennes, S. and Plaxton, C. Gregory},
  pages = {89--95},
  year = {2002},
  doi = {10.1109/ipps.1993.262861}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers