{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T04:04:24Z","timestamp":1751169864238,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031969997","type":"print"},{"value":"9783031970009","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97000-9_17","type":"book-chapter","created":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:52:06Z","timestamp":1751093526000},"page":"272-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Construction of\u00a0Large Zero-Aware Pattern Databases for\u00a0Sliding Puzzles on\u00a0Distributed Memory Machines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-8619-4112","authenticated-orcid":false,"given":"Tomoya","family":"Nagahashi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1357-5770","authenticated-orcid":false,"given":"Daisuke","family":"Takahashi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"17_CR1","unstructured":"MPI. https:\/\/www.mpi-forum.org. Accessed 14 Mar 2025"},{"key":"17_CR2","unstructured":"OpenMP. https:\/\/www.openmp.org. Accessed 14 Mar 2025"},{"key":"17_CR3","unstructured":"clausecker\/24puzzle: Solve 24 puzzles using zero-aware pattern databases https:\/\/github.com\/clausecker\/24puzzle. Accessed 14 Mar 2025"},{"key":"17_CR4","unstructured":"iwiwi\/parallel-radix-sort: An implementation of optimized parallel radix sort https:\/\/github.com\/iwiwi\/parallel-radix-sort. Accessed 14 Mar 2025"},{"key":"17_CR5","unstructured":"Center for computational sciences, University of Tsukuba: Supercomputer Pegasus. https:\/\/www.ccs.tsukuba.ac.jp\/supercomputer. Accessed 14 Mar 2025"},{"key":"17_CR6","unstructured":"Wisteria\/BDEC-01 Supercomputer System | Supercomputing Division, Information Technology Center, The University of Tokyo. https:\/\/www.cc.u-tokyo.ac.jp\/supercomputer\/wisteria\/service\/. Accessed 14 Mar 2025"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Madduri, K.: Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In: International Conference on Parallel Processing, pp. 523\u2013530 (2006). https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp=&arnumber=1690657","DOI":"10.1109\/ICPP.2006.34"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Clausecker, R., Reinefeld, A.: Zero-Aware Pattern Databases with 1-Bit Compression for sliding tile puzzles. In: 12th International Symposium on Combinatorial Search, vol. 10, no. 1, pp. 35\u201343 (2019)","DOI":"10.1609\/socs.v10i1.18500"},{"issue":"38","key":"17_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0166-218X(92)90127-V","volume":"37","author":"G Cooperman","year":"1992","unstructured":"Cooperman, G., Finkelstein, L.: New methods for using Cayley graphs in interconnection networks. Discret. Appl. Math. 37(38), 95\u2013118 (1992)","journal-title":"Discret. Appl. Math."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Culberson, J.C., Schaeffer, J.,: Searching with pattern databases, In: Conference of the Canadian Society for Computational Studies of Intelligence, pp. 402\u2013416 (1996)","DOI":"10.1007\/3-540-61291-2_68"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"D\u00f6bbelin, R., Sch\u00fctt, T., Reinefeld, A.: Building large compressed PDBs for the sliding tile puzzle. In: Workshop on Computer Games 2013 Proceedings, pp. 16\u201327 (2014)","DOI":"10.1007\/978-3-319-05428-5_2"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1613\/jair.1480","volume":"22","author":"A Felner","year":"2004","unstructured":"Felner, A., Korf, R.E., Hanan, S.: Additive pattern database heuristics. J. Artif. Intell. Res. 22, 279\u2013318 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27, 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0747-7171(08)80001-6","volume":"10","author":"D Ratner","year":"1990","unstructured":"Ratner, D., Warmuth, M.: The $$(n^2-1)$$-puzzle and related relocation problems. J. Symb. Comput. 10(2), 111\u2013137 (1990)","journal-title":"J. Symb. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97000-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T06:52:08Z","timestamp":1751093528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97000-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031969997","9783031970009"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97000-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Istanbul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"T\u00fcrkiye","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}