Jeff Edmonds, Supratik Chakraborty. Bounding Variance and Expectation of Longest Path Lengths in DAGs. In Moses Charikar, editor, Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010. pages 766-781, SIAM, 2010. [doi]
@inproceedings{EdmondsC10, title = {Bounding Variance and Expectation of Longest Path Lengths in DAGs}, author = {Jeff Edmonds and Supratik Chakraborty}, year = {2010}, url = {http://www.siam.org/proceedings/soda/2010/SODA10_063_edmondsj.pdf}, researchr = {https://researchr.org/publication/EdmondsC10}, cites = {0}, citedby = {0}, pages = {766-781}, booktitle = {Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010}, editor = {Moses Charikar}, publisher = {SIAM}, }