%0 Journal Article %1 paterson90 %A Paterson, M. S. %D 1990 %I Springer-Verlag %J Algorithmica %K aks algorithm expander galactic sorting sorting.network %N 1-4 %P 75-92 %R 10.1007/BF01840378 %T Improved Sorting Networks with $O(N)$ Depth %V 5 %X The sorting network described by Ajtai et al. was the first to achieve a depth of $O(n)$. The networks introduced here are simplifications and improvements based strongly on their work. While the constants obtained for the depth bound still prevent the construction being of practical value, the structure of the presentation offers a convenient basis for further development.

@article{paterson90, abstract = {The sorting network described by Ajtai et al. was the first to achieve a depth of $O(\log n)$. The networks introduced here are simplifications and improvements based strongly on their work. While the constants obtained for the depth bound still prevent the construction being of practical value, the structure of the presentation offers a convenient basis for further development.}, added-at = {2014-04-19T23:57:05.000+0200}, author = {Paterson, M. S.}, biburl = {https://www.bibsonomy.org/bibtex/2ff52e608703ccbd2b3bbafc66e006912/ytyoun}, doi = {10.1007/BF01840378}, interhash = {871c5943f0b5dd0c1e45ea4f7a0f2734}, intrahash = {ff52e608703ccbd2b3bbafc66e006912}, issn = {0178-4617}, journal = {Algorithmica}, keywords = {aks algorithm expander galactic sorting sorting.network}, language = {English}, number = {1-4}, pages = {75-92}, publisher = {Springer-Verlag}, timestamp = {2016-11-01T08:39:53.000+0100}, title = {Improved Sorting Networks with $O(\log N)$ Depth}, volume = 5, year = 1990 }