{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:48:32Z","timestamp":1649094512539},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1016\/0167-8191(90)90161-2","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T02:10:42Z","timestamp":1060308642000},"page":"75-79","source":"Crossref","is-referenced-by-count":5,"title":["A note on the load balancing problem for coarse grained hypercube dictionary machines"],"prefix":"10.1016","volume":"16","author":[{"given":"Frank","family":"Dehne","sequence":"first","affiliation":[]},{"given":"Michel","family":"Gastaldo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0167-8191(90)90161-2_BIB1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TC.1985.1676551","article-title":"A generalized dictionary machine for VLSI","volume":"34","author":"Atallah","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90161-2_BIB2","first-page":"257","article-title":"A tree machine for searching problems","volume":"1979","author":"Bentley","year":"1981"},{"issue":"6","key":"10.1016\/0167-8191(90)90161-2_BIB3","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1109\/12.2211","article-title":"Systolic tree implementation of data structures","volume":"37","author":"Chang","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90161-2_BIB4","series-title":"Proc. Internat. Conf. Parallel Processing","first-page":"832","article-title":"Optimal VLSI dictionary machines on meshes","author":"Dehne","year":"1987"},{"key":"10.1016\/0167-8191(90)90161-2_BIB5","series-title":"Parallel and Distributed Algorithms","first-page":"137","article-title":"An optimal VLSI dictionary machine for hypercube architectures","author":"Dehne","year":"1989"},{"key":"10.1016\/0167-8191(90)90161-2_BIB6","series-title":"Proc. Internat. Symp. Computer Architecture","first-page":"151","article-title":"Dictionary machines with small number of processors","author":"Fisher","year":"1984"},{"key":"10.1016\/0167-8191(90)90161-2_BIB7","series-title":"Proc. Internat. Conf. Parallel Processing","first-page":"180","article-title":"The power of parallel profix","author":"Kruskal","year":"1985"},{"key":"10.1016\/0167-8191(90)90161-2_BIB8","article-title":"Systolic priority queues","author":"Leiserson","year":"1979"},{"issue":"2","key":"10.1016\/0167-8191(90)90161-2_BIB9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","article-title":"Brodcasting data in SIMD Computers","volume":"30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(90)90161-2_BIB10","first-page":"707","article-title":"Implementing a dictionary on hypercube machines","author":"Omondi","year":"1987"},{"issue":"9","key":"10.1016\/0167-8191(90)90161-2_BIB11","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1982.1676104","article-title":"A dictionary machine for VLSI","volume":"31","author":"Ottman","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/0167-8191(90)90161-2_BIB12","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/TC.1985.1676640","article-title":"An efficient unsorted VLSI dictionary machine","volume":"34","author":"Somani","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0167-8191(90)90161-2_BIB13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TC.1987.5009453","article-title":"Dictionary machines on cube-class networks","volume":"36","author":"Schwartz","year":"1987","journal-title":"IEEE Trans. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819190901612?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819190901612?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:26:18Z","timestamp":1552598778000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819190901612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0167819190901612"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90161-2","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}