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 wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Cicalese, Ferdinando;
Jacobs, Tobias;
Laber, Eduardo Sany;
Molinaro, Marco
Einrichtung
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, Ferdinando, Jacobs, Tobias, Laber, Eduardo Sany, and Molinaro, Marco. 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).
arXiv: 
Google Scholar