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

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

Preprint | Veröffentlicht| Englisch
 
Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Autor/in
Cicalese, Ferdinando; Jacobs, Tobias; Laber, Eduardo Sany; Molinaro, Marco
Erscheinungsjahr
2009
Page URI
https://pub.uni-bielefeld.de/record/2426653

Zitieren

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).

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Quellen

arXiv: 0904.3503

Suchen in

Google Scholar