Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Chandra Nair, Balaji Prabhakar, Mayank Sharma. Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings. pages 168-178, IEEE Computer Society, 2003. [doi]

This author has not been identified. Look up 'Chandra Nair' in GoogleThis author has not been identified. Look up 'Balaji Prabhakar' in GoogleThis author has not been identified. Look up 'Mayank Sharma' in Google

runs on WebDSL