{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:27:28Z","timestamp":1725456448650},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634409"},{"type":"electronic","value":"9783540695493"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0002875","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T12:29:42Z","timestamp":1132748982000},"page":"1217-1220","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Changing the distribution depth during a parallel tree search"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Prcovic","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,9,26]]},"reference":[{"issue":"2","key":"163_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/22719.24067","volume":"9","author":"R. Finkel","year":"1987","unstructured":"R. Finkel and U. Manber. DIB\u2014A Distributed Implementation of Backtracking. ACM Transaction on Programming Languages and Systenas, 9(2):235\u2013256, 1987.","journal-title":"ACM Transaction on Programming Languages and Systenas"},{"key":"163_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1994.1065","volume":"22","author":"V. Kumar","year":"1994","unstructured":"V. Kumar, A. Grama, and V. Rao. Scalable load balancing techniques for parallel computers. Journal of Parallel and Distributed Computing, 22(1), 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"163_CR3","unstructured":"G.-J. Li and B.W. Wah. How Good are Parallel and Ordered Depth-First Searches. In Proceedings of the 1986 International Conference on Parallel Processing, pages 992\u2013999. IEEE Computer Society Press, 1986."},{"key":"163_CR4","unstructured":"P. Prosser. Binary constraint satifaction problems: Some are harder than others. In 11th European Conference. on Artificial Intelligence, pages 95\u201399, 1994."},{"issue":"4","key":"163_CR5","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/71.219757","volume":"4","author":"V. N. Rao","year":"1993","unstructured":"V. N. Rao and V. Kumar. On the Efficiency of Parallel Backtracking. In IEEE Transactions on Parallel and Distributed Systenas, volume 4:4, pages 427\u2013437, 1993.","journal-title":"IEEE Transactions on Parallel and Distributed Systenas"}],"container-title":["Lecture Notes in Computer Science","Euro-Par'97 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0002875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:47:30Z","timestamp":1587343650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0002875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634409","9783540695493"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/bfb0002875","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"26 September 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}