Correction: Parallel Merge Sort
Richard J. Cole · SIAM Journal on Computing · 1993
Previous article Correction: Parallel Merge SortRichard ColeRichard Colehttps://doi.org/10.1137/0222081PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Correction: Parallel Merge Sort." SIAM Journal on Computing, 22(6), p. 1349[1] Richard Cole, Parallel merge sort, SIAM J. Comput., 17 (1988), 770–785 10.1137/0217049 89m:68015 0651.68077 LinkISIGoogle Scholar[2] S. Saxena, , P. C. P. Bhatt and , V. C. Prasad, Time optimal parallel prefix algorithm, Unpublished manuscript Google Scholar Previous article FiguresRelatedReferencesCited byDetails Near Optimal Parallel Algorithms for Dynamic DFS in Undirected GraphsACM Transactions on Parallel Computing, Vol. 6, No. 3 Cross Ref Parallel Reachability in Almost Linear Work and Square Root Depth Cross Ref Skyline Queries with Noisy Comparisons20 May 2015 Cross Ref Database Management System on Flosolver Mk326 March 2015 | IETE Technical Review, Vol. 15, No. 6 Cross Ref Volume 22, Issue 6| 1993SIAM Journal on Computing History Submitted:02 April 1993Accepted:12 April 1993Published online:31 July 2006 InformationCopyright © 1993 © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0222081Article page range:pp. 1349-1349ISSN (print):0097-5397ISSN (online):1095-7111Publisher:Society for Industrial and Applied Mathematics