Micah Adler, Jeff Edmonds, Jirí Matousek. Towards asymptotic optimality in probabilistic packet marking. In Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. pages 450-459, ACM, 2005. [doi]
@inproceedings{AdlerEM05,
title = {Towards asymptotic optimality in probabilistic packet marking},
author = {Micah Adler and Jeff Edmonds and Jirí Matousek},
year = {2005},
doi = {10.1145/1060590.1060657},
url = {http://doi.acm.org/10.1145/1060590.1060657},
researchr = {https://researchr.org/publication/AdlerEM05},
cites = {0},
citedby = {0},
pages = {450-459},
booktitle = {Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005},
editor = {Harold N. Gabow and Ronald Fagin},
publisher = {ACM},
isbn = {1-58113-960-8},
}