{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:03:08Z","timestamp":1725566588006},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540231660"},{"type":"electronic","value":"9783540302216"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30221-6_18","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T20:47:50Z","timestamp":1285102070000},"page":"226-240","source":"Crossref","is-referenced-by-count":10,"title":["External A*"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahid","family":"Jabbar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schr\u00f6dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/3-540-18088-5_40","volume-title":"Automata, Languages and Programming","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Vitter, J.S.: Complexity of sorting and related problems. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol.\u00a0267, pp. 467\u2013478. Springer, Heidelberg (1987)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/3-540-57155-8_238","volume-title":"Algorithms and Data Structures","author":"L. Arge","year":"1993","unstructured":"Arge, L., Knudsen, M., Larsen, K.: Sorting multisets and vectors in-place. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol.\u00a0709, pp. 83\u201394. Springer, Heidelberg (1993)"},{"key":"18_CR3","unstructured":"Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamasia, R., Vengroff, D.E., Vitter, J.S.: External memory graph algorithms. In: Symposium on Discrete Algorithms (SODA), pp. 139\u2013149 (1995)"},{"issue":"11","key":"18_CR4","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/363269.363610","volume":"12","author":"R.B. Dial","year":"1969","unstructured":"Dial, R.B.: Shortest-path forest with topological ordering. Communication of the ACM\u00a012(11), 632\u2013633 (1969)","journal-title":"Communication of the ACM"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for heuristic determination of minimum path cost. IEEE Trans. on on Systems Science and Cybernetics\u00a04, 100\u2013107 (1968)","journal-title":"IEEE Trans. on on Systems Science and Cybernetics"},{"key":"18_CR6","unstructured":"Korf, R.: Best-first frontier search with delayed duplicate detection. In: National Conference on Artificial Intelligence, AAAI (2004) (to appear)"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence\u00a027(1), 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"key":"18_CR8","unstructured":"Korf, R.E.: Divide-and-conquer bidirectional frontier search: First results. In: International Joint Conferences on Artificial Intelligence (IJCAI), pp. 1184\u20131191 (1999)"},{"key":"18_CR9","unstructured":"Korf, R.E.: Delayed duplicate detection. In: IJCAI-Workshop on Model Checking and Artificial Intelligence, MoChart (2003)"},{"key":"18_CR10","first-page":"13","volume-title":"Chips Challenging Champions: Games, Computers and Artificial Intelligence","author":"R.E. Korf","year":"2002","unstructured":"Korf, R.E., Felner, A.: Disjoint Pattern Database Heuristics. In: Chips Challenging Champions: Games, Computers and Artificial Intelligence, pp. 13\u201326. Elsevier, Amsterdam (2002)"},{"key":"18_CR11","unstructured":"Korf, R.E., Zhang, W.: Divide-and-conquer frontier search applied to optimal sequence allignment. In: National Conference on Artificial Intelligence (AAAI), pp. 910\u2013916 (2000)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Meyer, U.: External-memory breadth-first search with sublinear I\/O. In: European Symposium on Algorithms, ESA (2002)","DOI":"10.1007\/3-540-45749-6_63"},{"key":"18_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36574-5","volume-title":"Memory Hierarchies","author":"U. Meyer","year":"2003","unstructured":"Meyer, U., Sanders, P., Sibeyn, J.: Memory Hierarchies. Springer, Heidelberg (2003)"},{"key":"18_CR14","unstructured":"Munagala, K., Ranade, A.: I\/O-complexity of graph algorithms. In: Symposium on Discrete Algorithms (SODA), pp. 87\u201388 (2001)"},{"key":"18_CR15","volume-title":"Heuristics","author":"J. Pearl","year":"1985","unstructured":"Pearl, J.: Heuristics. Addison-Wesley, Reading (1985)"},{"key":"18_CR16","unstructured":"Zhou, R., Hansen, E.: Breadth-first heuristic search. In: International Conference on Automated Planning and Scheduling (ICAPS), pp. 92\u2013100 (2004)"},{"key":"18_CR17","unstructured":"Zhou, R., Hansen, E.: Structured duplicate detection in external-memory graph search. In: National Conference on Artificial Intelligence, AAAI (2004) (to appear)"}],"container-title":["Lecture Notes in Computer Science","KI 2004: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30221-6_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:33Z","timestamp":1605761433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30221-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540231660","9783540302216"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30221-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}