Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. Greg Plaxton, Torsten Suel, Endre Szemerédi. Lower bounds for sorting networks. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 437-446, ACM, 1995. [doi]
@inproceedings{KahaleLMPSS95,
title = {Lower bounds for sorting networks},
author = {Nabil Kahale and Frank Thomson Leighton and Yuan Ma and C. Greg Plaxton and Torsten Suel and Endre Szemerédi},
year = {1995},
doi = {10.1145/225058.225178},
url = {http://doi.acm.org/10.1145/225058.225178},
tags = {C++},
researchr = {https://researchr.org/publication/KahaleLMPSS95},
cites = {0},
citedby = {0},
pages = {437-446},
booktitle = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA},
publisher = {ACM},
}