A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Constantinos Daskalakis, Anindya De, Ilias Diakonikolas, Ankur Moitra, Rocco A. Servedio. A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage. In Chandra Chekuri, editor, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5-7, 2014. pages 628-644, SIAM, 2014. [doi]

This author has not been identified. Look up 'Constantinos Daskalakis' in GoogleThis author has not been identified. Look up 'Anindya De' in GoogleThis author has not been identified. Look up 'Ilias Diakonikolas' in GoogleThis author has not been identified. Look up 'Ankur Moitra' in GoogleThis author has not been identified. Look up 'Rocco A. Servedio' in Google

runs on WebDSL