%0 Journal Article %1 cole87 %A Cole, Richard %C New York, NY, USA %D 1987 %I ACM %J J. ACM %K algorithm parallel sorting sorting.network %N 1 %P 200--208 %R 10.1145/7531.7537 %T Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms %V 34 %X Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. This paper provides a general method that trims a factor of O(log n) time (or more) for many applications of this technique.

@article{cole87, abstract = {Megiddo introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. This paper provides a general method that trims a factor of O(log n) time (or more) for many applications of this technique.}, acmid = {7537}, added-at = {2016-11-08T04:54:30.000+0100}, address = {New York, NY, USA}, author = {Cole, Richard}, biburl = {https://www.bibsonomy.org/bibtex/2e88ddae5607bfc13bb604480991d1a0d/ytyoun}, doi = {10.1145/7531.7537}, interhash = {8c675d70ccebc5bc5e87af1ab2185e8a}, intrahash = {e88ddae5607bfc13bb604480991d1a0d}, issn = {0004-5411}, issue_date = {Jan. 1987}, journal = {J. ACM}, keywords = {algorithm parallel sorting sorting.network}, month = jan, number = 1, numpages = {9}, pages = {200--208}, publisher = {ACM}, timestamp = {2016-11-08T08:51:17.000+0100}, title = {Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms}, volume = 34, year = 1987 }