On the Complexity of Searching in Trees: Average-case Minimization

Cicalese F, Jacobs T, Laber ES, Molinaro M (2009) .

Download
No fulltext has been uploaded. References only!
Preprint | Published | English

No fulltext has been uploaded

Author
; ; ;
Publishing Year
PUB-ID

Cite this

Cicalese F, Jacobs T, Laber ES, Molinaro M. On the Complexity of Searching in Trees: Average-case Minimization. 2009.
Cicalese, F., Jacobs, T., Laber, E. S., & Molinaro, M. (2009). On the Complexity of Searching in Trees: Average-case Minimization
Cicalese, F., Jacobs, T., Laber, E. S., and Molinaro, M. (2009). On the Complexity of Searching in Trees: Average-case Minimization.
Cicalese, F., et al., 2009. On the Complexity of Searching in Trees: Average-case Minimization.
F. Cicalese, et al., “On the Complexity of Searching in Trees: Average-case Minimization”, 2009.
Cicalese, F., Jacobs, T., Laber, E.S., Molinaro, M.: On the Complexity of Searching in Trees: Average-case Minimization. (2009).
Cicalese, Ferdinando, Jacobs, Tobias, Laber, Eduardo Sany, and Molinaro, Marco. “On the Complexity of Searching in Trees: Average-case Minimization”. (2009).
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Sources

arXiv 0904.3503

Search this title in

Google Scholar