Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Henry Lin, Frans Schalekamp. Brief announcement: on the complexity of the minimum latency scheduling problem on the euclidean plane. In Guy E. Blelloch, Maurice Herlihy, editors, 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012. pages 80-81, ACM, 2012. [doi]

This author has not been identified. Look up 'Henry Lin' in GoogleThis author has not been identified. Look up 'Frans Schalekamp' in Google

runs on WebDSL