Ferdinando Cicalese, Tobias Jacobs, Eduardo Sany Laber, Marco Molinaro. On the complexity of searching in trees and partially ordered structures. Theoretical Computer Science, 412(50):6879-6896, 2011. [doi]
@article{CicaleseJLM11,
title = {On the complexity of searching in trees and partially ordered structures},
author = {Ferdinando Cicalese and Tobias Jacobs and Eduardo Sany Laber and Marco Molinaro},
year = {2011},
doi = {10.1016/j.tcs.2011.08.042},
url = {http://dx.doi.org/10.1016/j.tcs.2011.08.042},
researchr = {https://researchr.org/publication/CicaleseJLM11},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {412},
number = {50},
pages = {6879-6896},
}