{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T21:51:44Z","timestamp":1672264304716},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(94)00288-6","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"1-33","source":"Crossref","is-referenced-by-count":7,"title":["A design of a parallel dictionary using skip lists"],"prefix":"10.1016","volume":"158","author":[{"given":"Joaquim","family":"Gabarr\u00f3","sequence":"first","affiliation":[]},{"given":"Conrado","family":"Mart\u00ednez","sequence":"additional","affiliation":[]},{"given":"Xavier","family":"Messeguer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(94)00288-6_BIB1","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TC.1985.1676551","article-title":"A generalized dictionary machine for VLSI","volume":"C-34","author":"Atallah","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(94)00288-6_BIB2","series-title":"Proc. 17th Math. Foundations Comput. Sci.","first-page":"133","article-title":"A perfect parallel dictionary","volume":"Vol. 598","author":"Bast","year":"1992"},{"issue":"11","key":"10.1016\/0304-3975(94)00288-6_BIB3","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/12.42122","article-title":"Scans as primitive parallel operations","volume":"38","author":"Blelloch","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(94)00288-6_BIB4","series-title":"Proc. IFIP WG10.3 Internat. Conf. on Appl. in Parallel and Distributed Computing","article-title":"A proof system for a simple data-parallel programming language","author":"Boug\u00e9","year":"1994"},{"key":"10.1016\/0304-3975(94)00288-6_BIB5","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests of hypothesis based on sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"issue":"3","key":"10.1016\/0304-3975(94)00288-6_BIB6","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1214\/aoap\/1177005651","article-title":"A limit theory for random skip lists","volume":"2","author":"Devroye","year":"1992","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/0304-3975(94)00288-6_BIB7_1","series-title":"Geburtstag von G\u00fcnter Hotz. Teubner-Texte zur Informatik 1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-95233-2_7","article-title":"Dynamic hashing in real time","volume":"60","author":"Dietzfelbinger","year":"1992"},{"key":"10.1016\/0304-3975(94)00288-6_BIB7_2","series-title":"Proc. 17th ICALP","volume":"Vol. 443","author":"Dietzfelbinger","year":"1990"},{"issue":"2","key":"10.1016\/0304-3975(94)00288-6_BIB8","first-page":"196","article-title":"An optimal parallel dictionary","volume":"102","author":"Dietzfelbinger","year":"1993","journal-title":"Inform. Control."},{"key":"10.1016\/0304-3975(94)00288-6_BIB9","series-title":"Proc. 2nd Joint Internat. Conf. on Vector and Parallel Processing (CONPAR92-VAPPV)","first-page":"545","article-title":"MIMD dictionary machines: from theory to practice","volume":"Vol. 634","author":"Duboux","year":"1992"},{"key":"10.1016\/0304-3975(94)00288-6_BIB10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1006\/jpdc.1994.1080","article-title":"An approach to correctness of data parallel algorithms","volume":"22","author":"Gabarr\u00f3","year":"1994","journal-title":"J. Parallel and Distributed Computing"},{"key":"10.1016\/0304-3975(94)00288-6_BIB11","series-title":"Computer Science 2: Research and Applications","first-page":"15","article-title":"Parallel update and search in skip lists","author":"Gabarr\u00f3","year":"1994"},{"key":"10.1016\/0304-3975(94)00288-6_BIB12","article-title":"Dictionary machine on SIMD archictectures","author":"Gastaldo","year":"1993"},{"key":"10.1016\/0304-3975(94)00288-6_BIB13","series-title":"Proc. 32nd Foundations of Comput. Sci.","first-page":"698","article-title":"Towards a theory of nearly constant time parallel algorithms","author":"Gil","year":"1991"},{"key":"10.1016\/0304-3975(94)00288-6_BIB14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1006\/jpdc.1994.1092","article-title":"Maintaining B-trees on an EREW PRAM","volume":"22","author":"Higham","year":"1994","journal-title":"J. Parallel and Distributed Computing"},{"issue":"12","key":"10.1016\/0304-3975(94)00288-6_BIB15","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1145\/7902.7903","article-title":"Data parallel algorithms","volume":"29","author":"Hillis","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)00288-6_BIB16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0304-3975(94)00296-U","article-title":"Analysis of an optimized search algorithm for skip lists","volume":"144","author":"Kirschenhofer","year":"1995","journal-title":"Theoret. Comput. Sci."},{"issue":"8","key":"10.1016\/0304-3975(94)00288-6_BIB17","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/BF01178735","article-title":"The path length of random skip lists","volume":"31","author":"Kirschenhofer","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)00288-6_BIB18","article-title":"Area-efficient VLSI computation","author":"Leiserson","year":"1983"},{"key":"10.1016\/0304-3975(94)00288-6_BIB19","article-title":"A sequential and parallel implementation of skip lists","author":"Messeguer","year":"1994","journal-title":"Tech. Report LSI-94-41-R, LSI-UPC"},{"key":"10.1016\/0304-3975(94)00288-6_BIB20","article-title":"Skip lists and probabilistic analysis of algorithms","author":"Papadakis","year":"1993"},{"key":"10.1016\/0304-3975(94)00288-6_BIB21","series-title":"Proc. 2nd Scandinavian Workshop on Algorithm Theory","first-page":"160","article-title":"Analysis of the expected search cost in skip lists","volume":"Vol. 447","author":"Papadakis","year":"1990"},{"key":"10.1016\/0304-3975(94)00288-6_BIB22","series-title":"Proc. 10th Internat. Colloquium on Automata, Programming and Languages","first-page":"597","article-title":"Parallel computation on 2\u20133 trees","volume":"Vol. 154","author":"Paul","year":"1983"},{"key":"10.1016\/0304-3975(94)00288-6_BIB23","first-page":"398","article-title":"Parallel computation on 2\u20133 trees","author":"Paul","year":"1983","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(94)00288-6_BIB24","article-title":"A skip list cookbook","author":"Pugh","year":"1990"},{"issue":"6","key":"10.1016\/0304-3975(94)00288-6_BIB25","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1145\/78973.78977","article-title":"Skip lists: a probabilistic alternative to balanced trees","volume":"33","author":"Pugh","year":"1990","journal-title":"Comm. ACM"},{"issue":"4","key":"10.1016\/0304-3975(94)00288-6_BIB26","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM Trans. Programming Languages Sys."},{"issue":"3","key":"10.1016\/0304-3975(94)00288-6_BIB27","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(91)90175-H","article-title":"Some observations on skip-lists","volume":"39","author":"Sen","year":"1991","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0304-3975(94)00288-6_BIB28","unstructured":"Thinking Machines Corporation, Cambridge, MA, C\u2217 Programming Guide. Version 6.0.2, 1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002886?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002886?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:53:10Z","timestamp":1555404790000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594002886"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397594002886"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00288-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}