Lower bounds for sorting networks - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Nabil Kahale' in GoogleThis author has not been identified. Look up 'Frank Thomson Leighton' in GoogleThis author has not been identified. Look up 'Yuan Ma' in GoogleThis author has not been identified. Look up 'C. Greg Plaxton' in GoogleThis author has not been identified. Look up 'Torsten Suel' in GoogleThis author has not been identified. Look up 'Endre Szemerédi' in Google

runs on WebDSL