{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:00:20Z","timestamp":1775818820244,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0004-3702(93)90045-d","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"41-78","source":"Crossref","is-referenced-by-count":148,"title":["Linear-space best-first search"],"prefix":"10.1016","volume":"62","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(93)90045-D_BIB1","first-page":"265","author":"Bratko","year":"1986"},{"issue":"2","key":"10.1016\/0004-3702(93)90045-D_BIB2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","article-title":"Heuristic search in restricted memory","volume":"41","author":"Chakrabarti","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(93)90045-D_BIB3","first-page":"19","article-title":"The advantages of using depth and breadth components in heuristic search","volume":"3","author":"Davis","year":"1989"},{"issue":"3","key":"10.1016\/0004-3702(93)90045-D_BIB4","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","article-title":"Generalized best-first search strategies and the optimality of A\u2217","volume":"32","author":"Dechter","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(93)90045-D_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0004-3702(93)90045-D_BIB6","first-page":"235","article-title":"Experiments with the Graph Traverser program","volume":"294","author":"Doran","year":"1966"},{"key":"10.1016\/0004-3702(93)90045-D_BIB7","series-title":"Ph.D. Thesis","article-title":"Performance measurement and analysis of certain search algorithms","author":"Gaschnig","year":"1979"},{"issue":"2","key":"10.1016\/0004-3702(93)90045-D_BIB8","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1968","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"10.1016\/0004-3702(93)90045-D_BIB9","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"1","key":"10.1016\/0004-3702(93)90045-D_BIB10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative-deepening: an optimal admissible tree search","volume":"27","author":"Korf","year":"1985","journal-title":"Artif. Intell."},{"issue":"2\u20133","key":"10.1016\/0004-3702(93)90045-D_BIB11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","article-title":"Real-time heuristic search","volume":"42","author":"Korf","year":"1990","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(93)90045-D_BIB12","series-title":"Proceedings AAAI Spring Symposium on Planning in Uncertain, Unpredictable, or Changing Environments","first-page":"72","article-title":"Real-time search for dynamic planning","author":"Korf","year":"1990"},{"key":"10.1016\/0004-3702(93)90045-D_BIB13","series-title":"UCLA Computer Science Annual","first-page":"5","article-title":"Best-first search in limited memory","author":"Korf","year":"1991"},{"key":"10.1016\/0004-3702(93)90045-D_BIB14","series-title":"Proceedings Sixth International Symposium on Computer and Information Sciences","first-page":"581","article-title":"Linear-space best-first search: extended abstract","author":"Korf","year":"1991"},{"key":"10.1016\/0004-3702(93)90045-D_BIB15","series-title":"Proceedings AAAI-92","first-page":"533","article-title":"Linear-space best-first search: summary of results","author":"Korf","year":"1992"},{"key":"10.1016\/0004-3702(93)90045-D_BIB16","article-title":"An efficient iterative threshold heuristic tree search algorithm","author":"Mahanti","year":"1992"},{"key":"10.1016\/0004-3702(93)90045-D_BIB17","series-title":"Proceedings Symposium on Artificial Intelligence and Mathematics","article-title":"An upper bound on the complexity of iterative-deepening-A\u2217","author":"Patrick","year":"1989"},{"key":"10.1016\/0004-3702(93)90045-D_BIB18","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(93)90045-D_BIB19","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0004-3702(70)90007-X","article-title":"Heuristic search viewed as path finding in a graph","volume":"1","author":"Pohl","year":"1970","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(93)90045-D_BIB20","series-title":"Proceedings AAAI-91","first-page":"434","article-title":"Depth-first vs. best-first search","author":"Rao","year":"1991"},{"key":"10.1016\/0004-3702(93)90045-D_BIB21","series-title":"Proceedings AAAI-86","first-page":"168","article-title":"Finding a shortest solution for the N \u00d7 N extension of the 15-Puzzle is intractable","author":"Ratner","year":"1986"},{"key":"10.1016\/0004-3702(93)90045-D_BIB22","series-title":"Proceedings IJCAI-89","first-page":"609","article-title":"Learning subgoal sequences for planning","author":"Ruby","year":"1989"},{"key":"10.1016\/0004-3702(93)90045-D_BIB23","series-title":"Proceedings ECAI-92","article-title":"Efficient memory-bounded search methods","author":"Russell","year":"1992"},{"issue":"2","key":"10.1016\/0004-3702(93)90045-D_BIB24","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(91)90100-X","article-title":"Reducing reexpansions in iterative-deepening search by controlling cutoff bounds","volume":"50","author":"Sarkar","year":"1991","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(93)90045-D_BIB25","series-title":"Proceedings IJCAI-89","first-page":"297","article-title":"Fast recursive formulations for best-first search that allow controlled use of memory","author":"Sen","year":"1989"},{"key":"10.1016\/0004-3702(93)90045-D_BIB26","series-title":"Proceedings IJCAI-85","first-page":"1073","article-title":"An analysis of consecutively bounded depth-first search with applications in automated deduction","author":"Stickel","year":"1985"},{"key":"10.1016\/0004-3702(93)90045-D_BIB27","series-title":"Proceedings AAAI-93","article-title":"Pruning duplicate nodes in depth-first search","author":"Taylor","year":"1993"},{"key":"10.1016\/0004-3702(93)90045-D_BIB28","article-title":"MIDA\u2217, an IDA\u2217 search with dynamic control","author":"Wah","year":"1991"},{"key":"10.1016\/0004-3702(93)90045-D_BIB29","series-title":"Proceedings AAAI-93","article-title":"Depth-first vs. best-first search: new results","author":"Zhang","year":"1993"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029390045D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029390045D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:54:04Z","timestamp":1553648044000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029390045D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["000437029390045D"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(93)90045-d","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}