An NC Algorithm for Sorting Real Numbers in O(nlogn/√loglogn) Operations

6 pages•Published: March 13, 2019

Yijie Han, Mishra Sneha and Md Usman Gani Syed

Abstract

We apply the recent important results of serial sorting of real numbers in O(n√logn) time to the design of a parallel algorithm for sorting real numbers in O(log1+n) time and O(nlogn/√loglogn) operations. This is the first NC algorithm known to take o(nlogn) operations for sorting real numbers.

Keyphrases: complexity., parallel algorithms, sort real numbers, sorting

In: Gordon Lee and Ying Jin (editors). Proceedings of 34th International Conference on Computers and Their Applications, vol 58, pages 93-98.

Links:	https://easychair.org/publications/paper/77zm
	https://doi.org/10.29007/2s4g

BibTeX entry

@inproceedings{CATA2019:NC_Algorithm_Sorting_Real,
  author    = {Yijie Han and Mishra Sneha and Md Usman Gani Syed},
  title     = {An NC Algorithm for Sorting Real Numbers  in O(nlogn/√loglogn) Operations},
  booktitle = {Proceedings of 34th International Conference on Computers and Their Applications},
  editor    = {Gordon Lee and Ying Jin},
  series    = {EPiC Series in Computing},
  volume    = {58},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/77zm},
  doi       = {10.29007/2s4g},
  pages     = {93-98},
  year      = {2019}}

Download PDF Open PDF in browser