ROSE, Kevin; BURNS, Ethan; RUML, Wheeler. Best-First Search for Bounded-Depth Trees. Proceedings of the International Symposium on Combinatorial Search, [S. l.], v. 2, n. 1, p. 134–141, 2021. DOI: 10.1609/socs.v2i1.18206. Disponível em: https://ojs.aaai.org/index.php/SOCS/article/view/18206. Acesso em: 9 may. 2026.