{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:33Z","timestamp":1757629473899,"version":"3.44.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992,1]]},"DOI":"10.1016\/0743-7315(92)90096-6","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"37-49","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A probabilistic parallel associative search and query set of algorithms"],"prefix":"10.1016","volume":"14","author":[{"given":"C.T.","family":"Davarakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.G.","family":"Maritsas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(92)90096-6_BIB1","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/TC.1986.1676788","article-title":"Fast search algorithms for associative memories","author":"Davis","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90096-6_BIB2","series-title":"FRONTIERS '90: 3rd Symposium on the Frontiers of Massively Parallel Computation","article-title":"Designing the 3-LAP (three layers associative processor) for arithmetic and symbolic applications","author":"Davarakis","year":"1990"},{"key":"10.1016\/0743-7315(92)90096-6_BIB3","first-page":"99","article-title":"THE PASQ-set and the MULTAP model","volume":"Vol. I","author":"Davarakis","year":"1989"},{"key":"10.1016\/0743-7315(92)90096-6_BIB4","article-title":"ASP: A cost-effective parallel microcomputer","volume":"0272-1732\/88","author":"Lea","year":"1988","journal-title":"IEEE MICRO"},{"key":"10.1016\/0743-7315(92)90096-6_BIB5","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1109\/12.2176","article-title":"An O(n + k) algorithm for ordered retrieval from an associative memory","author":"Lee","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90096-6_BIB6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0743-7315(89)90043-9","article-title":"A reconfigurable fully parallel associative processor","volume":"6","author":"Scherson","year":"1989","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"10.1016\/0743-7315(92)90096-6_BIB7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/TSE.1982.235426","article-title":"Performance measures for evaluating algorithms for SIMD machines","volume":"SE-8","author":"Siegel","year":"1982","journal-title":"IEEE Trans. Software"},{"year":"1987","series-title":"Associative Processors and Memories Overview and Current Status","author":"Waldschmidt","key":"10.1016\/0743-7315(92)90096-6_BIB8"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731592900966?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731592900966?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:31:07Z","timestamp":1757514667000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731592900966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["0743731592900966"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90096-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A probabilistic parallel associative search and query set of algorithms","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(92)90096-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}