@inproceedings{DBLP:conf/soda/BenderPSS01,
author = {Michael A. Bender and
Giridhar Pemmasani and
Steven Skiena and
Pavel Sumazin},
title = {Finding least common ancestors in directed acyclic graphs},
booktitle = {SODA},
year = {2001},
pages = {845-854},
ee = {http://dl.acm.org/citation.cfm?id=365411.365795},
crossref = {DBLP:conf/soda/2001},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/soda/2001,
editor = {S. Rao Kosaraju},
title = {Proceedings of the Twelfth Annual Symposium on Discrete
Algorithms, January 7-9, 2001, Washington, DC, USA},
booktitle = {SODA},
publisher = {ACM/SIAM},
year = {2001},
isbn = {0-89871-490-7},
ee = {http://dl.acm.org/citation.cfm?id=365411},
bibsource = {DBLP, http://dblp.uni-trier.de}
}