Daniel Cullina, Negar Kiyavash. Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching. In Sara Alouf, Alain Jean-Marie, Nidhi Hegde, Alexandre Proutière, editors, Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, Antibes Juan-Les-Pins, France, June 14-18, 2016. pages 63-72, ACM, 2016. [doi]
@inproceedings{CullinaK16,
title = {Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching},
author = {Daniel Cullina and Negar Kiyavash},
year = {2016},
doi = {10.1145/2896377.2901460},
url = {http://doi.acm.org/10.1145/2896377.2901460},
researchr = {https://researchr.org/publication/CullinaK16},
cites = {0},
citedby = {0},
pages = {63-72},
booktitle = {Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, Antibes Juan-Les-Pins, France, June 14-18, 2016},
editor = {Sara Alouf and Alain Jean-Marie and Nidhi Hegde and Alexandre Proutière},
publisher = {ACM},
isbn = {978-1-4503-4266-7},
}