TY - GEN
T1 - Slowing down sorting networks to obtain faster sorting algorithms
AU - Cole, Richard
N1 - Funding Information:
This work was supported in pan by NSF gram DCR-84-01633.
Publisher Copyright:
© 1984 IEEE.
PY - 1984
Y1 - 1984
N2 - Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. We give a general method that trims a factor of O(logn) time (or more) for many applications of this technique.
AB - Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. We give a general method that trims a factor of O(logn) time (or more) for many applications of this technique.
UR - http://www.scopus.com/inward/record.url?scp=85115228482&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85115228482&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85115228482
T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
SP - 255
EP - 260
BT - 25th Annual Symposium on Foundations of Computer Science, FOCS 1984
PB - IEEE Computer Society
T2 - 25th Annual Symposium on Foundations of Computer Science, FOCS 1984
Y2 - 24 October 1984 through 26 October 1984
ER -