Thumbnail
Access Restriction
Subscribed

Author Reif, John H. ♦ Valiant, Leslie G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1987
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract A randomized algorithm that sorts on an $\textit{N}$ node network with constant valence in $\textit{O}(log$ $\textit{N})$ time is given. More particularly, the algorithm sorts $\textit{N}$ items on an $\textit{N}-node$ cube-connected cycles graph, and, for some constant $\textit{k},$ for all large enough $\textit{α},$ it terminates within $\textit{kα}$ log $\textit{N}$ time with probability at least 1 - $\textit{N}-\textit{α}.$
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1987-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 34
Issue Number 1
Page Count 17
Starting Page 60
Ending Page 76


Open content in new tab

   Open content in new tab
Source: ACM Digital Library