Lower bounds for sorting networks

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.