1. Depth-first iterative-deepening: An optimal admissible tree search;Korf;Artificial Intelligence,1985
2. Time complexity of iterative-deepening-A*;Korf;Artificial Intelligence,2001
3. H.T. Dinh, A. Russell, Y. Su, On the value of good advice: The complexity of A* search with accurate heuristics, in: Proceedings of the 22nd Conference on Artificial Intelligence (AAAI 2007), 2007, pp. 1140–1145.
4. J. Gaschnig, Performance measurement and analysis of certain search algorithms, Ph.D. thesis, Carnegie-Mellon University, 1979.
5. Heuristics: Intelligent Search Strategies for Computer Problem Solving;Pearl,1984