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

Cicalese F, Laber ES, Molinaro M (2009)
CoRR abs/0904.3503.

Journal Article | Published | English

No fulltext has been uploaded

Author
; ;
Publishing Year
ISSN
PUB-ID

Cite this

Cicalese F, Laber ES, Molinaro M. On the Complexity of Searching in Trees: Average-case Minimization. CoRR. 2009;abs/0904.3503.
Cicalese, F., Laber, E. S., & Molinaro, M. (2009). On the Complexity of Searching in Trees: Average-case Minimization. CoRR, abs/0904.3503.
Cicalese, F., Laber, E. S., and Molinaro, M. (2009). On the Complexity of Searching in Trees: Average-case Minimization. CoRR abs/0904.3503.
Cicalese, F., Laber, E.S., & Molinaro, M., 2009. On the Complexity of Searching in Trees: Average-case Minimization. CoRR, abs/0904.3503.
F. Cicalese, E.S. Laber, and M. Molinaro, “On the Complexity of Searching in Trees: Average-case Minimization”, CoRR, vol. abs/0904.3503, 2009.
Cicalese, F., Laber, E.S., Molinaro, M.: On the Complexity of Searching in Trees: Average-case Minimization. CoRR. abs/0904.3503, (2009).
Cicalese, Ferdinando, Laber, Eduardo Sany, and Molinaro, Marco. “On the Complexity of Searching in Trees: Average-case Minimization”. CoRR abs/0904.3503 (2009).
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar