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

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]

@inproceedings{NairPS03,
  title = {Proofs of the Parisi and Coppersmith-Sorkin Conjectures for the Finite Random Assignment Problem},
  author = {Chandra Nair and Balaji Prabhakar and Mayank Sharma},
  year = {2003},
  url = {http://csdl.computer.org/comp/proceedings/focs/2003/2040/00/20400168abs.htm},
  researchr = {https://researchr.org/publication/NairPS03},
  cites = {0},
  citedby = {0},
  pages = {168-178},
  booktitle = {44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-2040-5},
}