SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS.

Richard Cole

SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS.

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Annual Symposium on Foundations of Computer Science (Proceedings)
Publisher	IEEE
Pages	255-260
Number of pages	6
ISBN (Print)	081860591X
State	Published - 1984

Publication series

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

ASJC Scopus subject areas

Hardware and Architecture

Cite this

@inproceedings{fae1e0656fb94456803a753bc35c452f,

title = "SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS.",

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.",

author = "Richard Cole",

year = "1984",

language = "English (US)",

isbn = "081860591X",

series = "Annual Symposium on Foundations of Computer Science (Proceedings)",

publisher = "IEEE",

pages = "255--260",

booktitle = "Annual Symposium on Foundations of Computer Science (Proceedings)",

}

TY - GEN

T1 - SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS.

AU - Cole, Richard

PY - 1984

Y1 - 1984

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0021559182&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021559182&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0021559182

SN - 081860591X

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 255

EP - 260

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -

SLOWING DOWN SORTING NETWORKS TO OBTAIN FASTER SORTING ALGORITHMS.

Abstract

Publication series

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this