{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:28Z","timestamp":1725487108772},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540426127"},{"type":"electronic","value":"9783540454229"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45422-5_12","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:01:34Z","timestamp":1183561294000},"page":"154-168","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Prediction of Regular Search Tree Growth by Spectral Analysis"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"key":"12_CR1","unstructured":"J. C. Culberson. Sokoban is PSPACE-complete. In Fun for Algorithms (FUN), pages 65\u201376. Carleton Scientific, 1998."},{"key":"12_CR2","unstructured":"S. Edelkamp and R. E. Korf. The branching factor of regular search spaces. In National Conference on Artificial Intelligence (AAAI), 1998. 299\u2013304."},{"key":"12_CR3","unstructured":"S. Edelkamp, A. L. Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI-Spring Symposium on Model-based Validation of Intelligence, pages 75\u201383, 2001."},{"key":"12_CR4","unstructured":"S. Edelkamp and U. Meyer. Theory and practice of time-space trade-offs in memory limited search. This volume."},{"key":"12_CR5","first-page":"100","volume":"4","author":"P. E. Hart","year":"1968","unstructured":"P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for heuristicdetermination of minimum path cost. IEEE Transaction on SSC, 4:100\u2013107, 1968.","journal-title":"IEEE Transaction on SSC"},{"key":"12_CR6","unstructured":"M. Holzer and S. Schwoon. Assembling molecules in Atomix is hard. Technical Report 0101, Institut f\u00fcr Informatik, Technische Universit\u00e4t M\u00fcnchen, 2001."},{"key":"12_CR7","unstructured":"F. H\u00fcffner, S. Edelkamp, H. Fernau, and R. Niedermeier. Finding optimal solutions to Atomix. This volume."},{"key":"12_CR8","unstructured":"A. Junghanns. Pushing the Limits: New Developments in Single-Agent Search. PhD thesis, University of Alberta, 1999."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97\u2013109, 1985.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"12_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R. E. Korf","year":"1993","unstructured":"R. E. Korf. Linear-space best-first search. Artificial Intelligence, 62(1):41\u201378, 1993.","journal-title":"Artificial Intelligence"},{"key":"12_CR11","unstructured":"R. E. Korf. Finding optimal solutions to Rubik\u2019s Cube using pattern databases. In National Conference on Artificial Intelligence (AAAI), pages 700\u2013705, 1997."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"R. E. Korf and A. Felner. Disjoint pattern database heuristics. Artificial Intelligence, 2001. To appear.","DOI":"10.1016\/S0004-3702(01)00092-3"},{"key":"12_CR13","unstructured":"R. E. Korf and M. Reid. Complexity analysis of admissible heuristicsearch. In National Conference on Artificial Intelligence (AAAI), 1998. 305\u2013310."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"R. E. Korf, M. Reid, and S. Edelkamp. Time complexity of Iterative-Deepening-A. Artificial Intelligence, 2001. To appear.","DOI":"10.1016\/S0004-3702(01)00094-7"},{"key":"12_CR15","unstructured":"R. E. Korf and L. A. Taylor. Finding optimal solutions to the twenty-four puzzle. In National Conference on Artificial Intelligence (AAAI), pages 1202\u20131207, 1996."}],"container-title":["Lecture Notes in Computer Science","KI 2001: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45422-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T21:14:52Z","timestamp":1683926092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45422-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426127","9783540454229"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45422-5_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"3 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}