Towards asymptotic optimality in probabilistic packet marking

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]

Authors

Micah Adler

This author has not been identified. Look up 'Micah Adler' in Google

Jeff Edmonds

This author has not been identified. Look up 'Jeff Edmonds' in Google

Jirí Matousek

This author has not been identified. Look up 'Jirí Matousek' in Google