{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:43:12Z","timestamp":1768531392658,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":4437,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0004-3702(01)00094-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:13:42Z","timestamp":1027577622000},"page":"199-218","source":"Crossref","is-referenced-by-count":61,"title":["Time complexity of iterative-deepening-A\u2217"],"prefix":"10.1016","volume":"129","author":[{"given":"Richard E.","family":"Korf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Reid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0004-3702(01)00094-7_BIB001","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1111\/0824-7935.00065","article-title":"Pattern databases","volume":"14","author":"Culberson","year":"1998","journal-title":"Comput. Intelligence"},{"key":"10.1016\/S0004-3702(01)00094-7_BIB002","series-title":"Proc. AAAI-98, Madison, WI","first-page":"299","article-title":"The branching factor of regular search spaces","author":"Edelkamp","year":"1998"},{"key":"10.1016\/S0004-3702(01)00094-7_BIB003","series-title":"Performance measurement and analysis of certain search algorithms, Ph.D. Thesis","author":"Gaschnig","year":"1979"},{"issue":"2","key":"10.1016\/S0004-3702(01)00094-7_BIB004","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 Transactions on Systems Science and Cybernetics"},{"issue":"1","key":"10.1016\/S0004-3702(01)00094-7_BIB005","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(01)00094-7_BIB006","series-title":"Proc. AAAI-97, Providence, RI","first-page":"700","article-title":"Finding optimal solutions to Rubik's Cube using pattern databases","author":"Korf","year":"1997"},{"key":"10.1016\/S0004-3702(01)00094-7_BIB007","series-title":"Proc. AAAI-98, Madison, WI","first-page":"305","article-title":"Complexity analysis of admissible heuristic search","author":"Korf","year":"1998"},{"key":"10.1016\/S0004-3702(01)00094-7_BIB008","article-title":"Disjoint pattern database heuristics","author":"Korf","year":"2001","journal-title":"Artificial Intelligence (Special Issue: Chips Challenging Champions: Advances in Computational Intelligence for Game-Playing)"},{"key":"10.1016\/S0004-3702(01)00094-7_BIB009","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/S0004-3702(01)00094-7_BIB010","series-title":"Machine Intelligence, Vol. 8","first-page":"55","article-title":"Practical and theoretical considerations in heuristic search algorithms","author":"Pohl","year":"1977"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201000947?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370201000947?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T02:27:17Z","timestamp":1556850437000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370201000947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0004370201000947"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(01)00094-7","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}