SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

N. Megiddo (J. ACM, vol. 30, no. 4, pp. 852-865, Oct. 1983) introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. A general method is given that trims a factor of O(log n) time (or more) for many applications of this technique.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages255-260
Number of pages6
ISBN (Print)081860591X
StatePublished - 1984

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS.'. Together they form a unique fingerprint.

Cite this