{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T06:14:03Z","timestamp":1777529643296,"version":"3.51.4"},"reference-count":24,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0743-7315(89)90011-7","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"649-662","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":31,"title":["Divide and conquer under global constraints: A solution to the N-queens problem"],"prefix":"10.1016","volume":"6","author":[{"given":"Bruce","family":"Abramson","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(89)90011-7_BIB1","series-title":"Mathematical Recreations and Essays","author":"Ball","year":"1973"},{"key":"10.1016\/0743-7315(89)90011-7_BIB2","series-title":"Symposium on Theory of Computing, ACM","first-page":"449","article-title":"The complexity of backtrack searches","author":"Carter","year":"1985"},{"issue":"1","key":"10.1016\/0743-7315(89)90011-7_BIB3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0097-3165(74)90076-4","article-title":"Independent permutations, as related to a problem of Moser and a theorem of P\u00f3yla","volume":"16","author":"Chandra","year":"1974","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0743-7315(89)90011-7_BIB4","series-title":"Structured Programming","first-page":"1","article-title":"Notes on structured programming","author":"Dijkstra","year":"1972"},{"key":"10.1016\/0743-7315(89)90011-7_BIB5","series-title":"Coordinated Computing: Tools and Techniques for Distributed Software","author":"Filman","year":"1984"},{"key":"10.1016\/0743-7315(89)90011-7_BIB6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1145\/22719.24067","article-title":"DIB\u2014A distributed implementation of backtracking","volume":"9","author":"Finkel","year":"1987","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"14","key":"10.1016\/0743-7315(89)90011-7_BIB7","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1145\/321420.321422","article-title":"Nondeterministic algorithms","volume":"14","author":"Floyd","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"issue":"4","key":"10.1016\/0743-7315(89)90011-7_BIB8","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","article-title":"A sufficient condition for backtrack-bounded search","volume":"32","author":"Freuder","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-7315(89)90011-7_BIB9","series-title":"The Unexpected Hanging and Other Mathematical Diversions","author":"Gardner","year":"1969"},{"key":"10.1016\/0743-7315(89)90011-7_BIB10","article-title":"Performance measurement and analysis of certain search algorithms","author":"Gaschnig","year":"1979"},{"issue":"3","key":"10.1016\/0743-7315(89)90011-7_BIB11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-7315(89)90011-7_BIB12","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"},{"key":"10.1016\/0743-7315(89)90011-7_BIB13","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1109\/TC.1983.1676280","article-title":"Divide-and-conquer for parallel processing","volume":"32","author":"Horowitz","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0743-7315(89)90011-7_BIB14","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0097-3165(83)90048-1","article-title":"Latin squares and superqueens","volume":"34","author":"Hwang","year":"1983","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"129","key":"10.1016\/0743-7315(89)90011-7_BIB15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.2307\/2005469","article-title":"Estimating the efficiency of backtrack programs","volume":"29","author":"Knuth","year":"1975","journal-title":"Math. Comp."},{"key":"10.1016\/0743-7315(89)90011-7_BIB16","series-title":"Mathematical Recreation","author":"Kraitchik","year":"1942"},{"key":"10.1016\/0743-7315(89)90011-7_BIB17","series-title":"Heuristics","author":"Pearl","year":"1984"},{"key":"10.1016\/0743-7315(89)90011-7_BIB18","series-title":"Mathematische Unterhaltungen and Spiele","first-page":"364","article-title":"Uber die \u2018doppelt-periodischen\u2019 Losungen des n-Damen-Problems","author":"P\u00f3lya","year":"1918"},{"key":"10.1016\/0743-7315(89)90011-7_BIB19","series-title":"Programming with Sets: An Introduction to Set 1","author":"Schwartz","year":"1986"},{"key":"10.1016\/0743-7315(89)90011-7_BIB20","series-title":"The crippled queen placement problem","author":"Wagner","year":"1984"},{"key":"10.1016\/0743-7315(89)90011-7_BIB21","series-title":"The Psychology of Computer Vision","first-page":"19","article-title":"Understanding line drawings in scenes with shadows","author":"Waltz","year":"1975"},{"issue":"4","key":"10.1016\/0743-7315(89)90011-7_BIB22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/362575.362577","article-title":"Program development by stepwise refinement","volume":"14","author":"Wirth","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(89)90011-7_BIB23","series-title":"Algorithms + Data Structures = Programs","author":"Wirth","year":"1976"},{"key":"10.1016\/0743-7315(89)90011-7_BIB24","series-title":"Challenging Mathematical Problems with Elementary Solutions","author":"Yaglom","year":"1964"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900117?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900117?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:15Z","timestamp":1757514495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0743731589900117"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90011-7","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Divide and conquer under global constraints: A solution to the N-queens problem","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(89)90011-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}