{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:53:54Z","timestamp":1725537234348},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046162"},{"type":"electronic","value":"9783642046179"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04617-9_5","type":"book-chapter","created":{"date-parts":[[2009,9,15]],"date-time":"2009-09-15T10:55:02Z","timestamp":1253012102000},"page":"33-40","source":"Crossref","is-referenced-by-count":1,"title":["Perfect Hashing for State Spaces in BDD Representation"],"prefix":"10.1007","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Edelkamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Allis, L.V.: A knowledge-based approach to Connect-Four. The game is solved: White wins. Master\u2019s thesis, Vrije Universiteit, The Netherlands (1998)"},{"key":"5_CR2","unstructured":"Ball, M., Holte, R.C.: The compression power of BDDs. In: ICAPS, pp. 2\u201311 (2008)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-73951-7_13","volume-title":"Algorithms and Data Structures","author":"F.C. Botelho","year":"2007","unstructured":"Botelho, F.C., Pagh, R., Ziviani, N.: Simple and space-efficient minimal perfect hash functions. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 139\u2013150. Springer, Heidelberg (2007)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Botelho, F.C., Ziviani, N.: External perfect hashing for very large key sets. In: Conference on Information and Knowledge Management, pp. 653\u2013662 (2007)","DOI":"10.1145\/1321440.1321532"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. In: Design Automation Conference (DAC), pp. 688\u2013694 (1985)","DOI":"10.1109\/DAC.1985.1586017"},{"key":"5_CR6","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. Discrete Applied Mathematics\u00a037\/38, 95\u2013118 (1992)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"5_CR7","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"J.C. Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence\u00a014(4), 318\u2013334 (1998)","journal-title":"Computational Intelligence"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Kissmann, P.: Limits and possibilities of BDDs in state space search. In: AAAI, pp. 46\u201353 (2008)","DOI":"10.1007\/978-3-540-85845-4_6"},{"key":"5_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-85845-4_23","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"S. Edelkamp","year":"2008","unstructured":"Edelkamp, S., Kissmann, P.: Symbolic classification of general two-player games. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS (LNAI), vol.\u00a05243, pp. 185\u2013192. Springer, Heidelberg (2008)"},{"key":"5_CR10","unstructured":"Edelkamp, S., Messerschmidt, H., Sulewski, D., Y\u00fccel, C.: Solving games in parallel with linear-time perfect hash functions. Technical report, TZI, University of Bremen (2009)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-540-70545-1_50","volume-title":"Computer Aided Verification","author":"S. Edelkamp","year":"2008","unstructured":"Edelkamp, S., Sanders, P., Simecek, P.: Semi-external LTL model checking. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 530\u2013542. Springer, Heidelberg (2008)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Sulewski, D.: Flash-efficient LTL model checking with minimal counterexamples. In: Conference on Software Engineering and Formal Methods (SEFM), pp. 73\u201382 (2008)","DOI":"10.1109\/SEFM.2008.34"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s100090050034","volume":"2","author":"G.J. Holzmann","year":"1999","unstructured":"Holzmann, G.J., Puri, A.: A minimized automaton representation of reachable states. International Journal on Software Tools for Technology Transfer\u00a02(3), 270\u2013278 (1999)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"5_CR14","unstructured":"Korf, R.E.: Minimizing disk I\/O in two-bit-breath-first search. In: AAAI, pp. 317\u2013324 (2008)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kunkle, D., Cooperman, G.: Twenty-six moves suffice for Rubik\u2019s cube. In: International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 235\u2013242 (2007)","DOI":"10.1145\/1277548.1277581"},{"key":"5_CR16","unstructured":"Love, N.C., Hinrichs, T.L., Genesereth, M.R.: General game playing: Game description language specification. Technical Report LG-2006-01, Stanford Logic Group (2006)"},{"key":"5_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Press, Dordrecht (1993)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams \u2014 Theory and Applications. Society of Industrial and Applied Mathematics (2000)","DOI":"10.1137\/1.9780898719789"}],"container-title":["Lecture Notes in Computer Science","KI 2009: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04617-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:54:49Z","timestamp":1558540489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04617-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046162","9783642046179"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04617-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}