Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Electronic Colloquium on Computational Complexity (ECCC), 13(111), 2006. [doi]
@article{CzumajKL06,
title = {Faster algorithms for finding lowest common ancestors in directed acyclic graphs},
author = {Artur Czumaj and Miroslaw Kowaluk and Andrzej Lingas},
year = {2006},
url = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-111/index.html},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/CzumajKL06},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {13},
number = {111},
}