{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:18Z","timestamp":1725487098982},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_13","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T11:01:34Z","timestamp":1183546894000},"page":"169-184","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Theory and Practice of Time-Space Trade-Offs in Memory Limited Search"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,3]]},"reference":[{"issue":"3","key":"13_CR1","first-page":"1627","volume":"28","author":"A. Brodnik","year":"1999","unstructured":"A. Brodnik and J. Munro. Membership in constant time and almost-minimum space. SIAM, 28(3):1627\u20131640, 1999.","journal-title":"Membership in constant time and almost-minimum space"},{"key":"13_CR2","unstructured":"Y. Choueka, Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 2000."},{"key":"13_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-61291-2_68","volume-title":"Searching with pattern databases","author":"J. C. Culberson","year":"1996","unstructured":"J. C. Culberson and J. Schaeffer. Searching with pattern databases. Lecture Notes in Computer Science, pages 402\u2013416. Springer, 1996."},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","volume-title":"IFIP FORTE\/PSTV","author":"J. Eckerle","year":"1998","unstructured":"J. Eckerle and T. Lais. Limits and possibilities of sequential hashing with supertrace. In IFIP FORTE\/PSTV, Lecture Notes in Computer Science. Springer, 1998."},{"key":"13_CR5","unstructured":"S. Edelkamp. Planning with pattern databases. In European Conference on Planning (ECP), 2001. To appear."},{"key":"13_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-45139-0_5","volume-title":"SPIN Workshop","author":"S. Edelkamp","year":"2001","unstructured":"S. Edelkamp, A. Lluch-Lafuente, and S. Leue. Directed model-checking in HSF-SPIN. In SPIN Workshop, Lecture Notes in Computer Science, pages 57\u201379. Springer, 2001."},{"key":"13_CR7","unstructured":"S. Edelkamp, A. Lluch-Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI-Spring Symposium on Model-based Validation of Intelligence, pages 75\u201383, 2001."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"S. Edelkamp, A. Lluch-Lafuente, and S. Leue. Trail-directed model checking. In Workshop on Software Model Checking. Electronic Notes in Theoretical Computer Science, Elsevier, 2001. To appear.","DOI":"10.1016\/S1571-0661(04)00261-0"},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0304-3975(96)00118-1","volume":"169","author":"U. Feige","year":"1996","unstructured":"U. Feige. A fast randomized LOGSPACE algorithm for graph connectivity. Theoretical Computer Science, 169(2):147\u2013160, 1996.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"13_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1006\/jcss.1997.1471","volume":"54","author":"U. Feige","year":"1997","unstructured":"U. Feige. A spectrum of time-space tradeoffs for undirected s-t connectivity. Journal of Computer and System Sciences, 54(2):305\u2013316, 1997.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR11","volume-title":"Design and Validation of Computer Protocols","author":"G. J. Holzmann","year":"1991","unstructured":"G. J. Holzmann. Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, New Jersey, 1991."},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1008696026254","volume":"13","author":"G. J. Holzmann","year":"1998","unstructured":"G. J. Holzmann. An analysis of bitstate hashing. Formal Methods in System Design: An International Journal, 13(3):289\u2013307, 1998.","journal-title":"Formal Methods in System Design: An International Journal"},{"key":"13_CR13","unstructured":"F. H\u00fcffner, S. Edelkamp, H. Fernau, and R. Niedermeier. Finding optimal solutions toAtomix. This volume."},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/s100090050045","volume":"2","author":"M. Kamel","year":"2000","unstructured":"M. Kamel and S. Leue. Formalization and validation of the general inter-orb protocol (GIOP) using Promela and SPIN. In Software Tools for Technology Transfer, volume 2, pages 394\u2013409, 2000.","journal-title":"Software Tools for Technology Transfer"},{"issue":"1","key":"13_CR15","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"},{"key":"13_CR16","unstructured":"R. E. Korf. Divide-and-conquer bidirectional search: First results. In IJCAI, pages 1184\u20131189, 1999."},{"issue":"7","key":"13_CR17","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/34.297950","volume":"16","author":"A. Reinefeld","year":"1994","unstructured":"A. Reinefeld and T. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701\u2013710, 1994.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"13_CR18","unstructured":"S. Russell. Efficient memory-bounded search methods. In ECAI-92, pages 1\u20135, 1992."},{"issue":"2","key":"13_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W. J. Savitch","year":"1970","unstructured":"W. J. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2):177\u2013192, 1970.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR20","unstructured":"A. K. Sen and A. Bagchi. Fast recursive formulations for best-first search that allowcontrolled use of memory. In IJCAI, pages 297\u2013302, 1989."},{"key":"13_CR21","first-page":"81","volume-title":"Methoden des Entwurfs und der Verifikation digitaler Systeme","author":"U. Stern","year":"1996","unstructured":"U. Stern and D. L. Dill. Combining state space caching and hash compaction. In Methoden des Entwurfs und der Verifikation digitaler Systeme, 4. GI\/ITG\/GME Workshop, pages 81\u201390. Shaker Verlag, Aachen, 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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T19:37:44Z","timestamp":1558467464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45422-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540426127","9783540454229"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45422-5_13","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"}}]}}