{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:24:09Z","timestamp":1757629449577,"version":"3.44.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","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\/"},{"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\/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":[[1990,11]]},"DOI":"10.1016\/0743-7315(90)90013-f","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"205-221","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A fully parallel algorithm for implementing path expressions"],"prefix":"10.1016","volume":"10","author":[{"given":"Anne","family":"Dinning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(90)90013-F_BIB1","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BF01661169","article-title":"Compiling path expressions into VLSI circuits","author":"Anantharaman","year":"1986","journal-title":"Distrib. Comput."},{"key":"10.1016\/0743-7315(90)90013-F_BIB2","series-title":"Tech. Rep. CUCS-185-85","article-title":"Miss Manners: A specialized silicon compiler for synchronizer","author":"Balraj","year":"1985"},{"article-title":"The specification of process synchronization by Path Expressions","year":"1973","author":"Campbell","key":"10.1016\/0743-7315(90)90013-F_BIB3"},{"issue":"10","key":"10.1016\/0743-7315(90)90013-F_BIB4","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1145\/362759.362813","article-title":"Concurrent control with \u201cReaders\u201d and \u201cWriters\u201d","volume":"14","author":"Courtois","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(90)90013-F_BIB5","series-title":"Proc. Nineteenth Annual ACM Symposium on Theory of Computing","first-page":"315","article-title":"Parallel symmetry breaking in sparse graph","author":"Goldberg","year":"1987"},{"year":"1987","series-title":"A new parallel algorithm for the maximal independent set problem","author":"Goldberg","key":"10.1016\/0743-7315(90)90013-F_BIB6"},{"article-title":"Basic techniques for the efficient coordination of very large numbers of cooperating sequential processes","year":"1983","author":"Gottlieb","key":"10.1016\/0743-7315(90)90013-F_BIB7"},{"article-title":"An overview of the NYU ultracomputer project","year":"1975","author":"Gottlieb","key":"10.1016\/0743-7315(90)90013-F_BIB8"},{"key":"10.1016\/0743-7315(90)90013-F_BIB9","series-title":"Tech. Rep.","article-title":"Path Expressions","author":"Haberman","year":"1975"},{"key":"10.1016\/0743-7315(90)90013-F_BIB10","series-title":"Parallel MIMD Computation: The HEP Supercomputer and its Applications","first-page":"1","article-title":"HEP architecture, programming and performance","author":"Jordan","year":"1985"},{"key":"10.1016\/0743-7315(90)90013-F_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/10590.10609","article-title":"Efficient synchronization on multiprocessors with shared memory","author":"Kruskal","year":"1986"},{"key":"10.1016\/0743-7315(90)90013-F_BIB12","series-title":"Experimental Parallel Computing Architectures","article-title":"Parallel supercomputing today and the Cedar approach","author":"Kuck","year":"1987"},{"key":"10.1016\/0743-7315(90)90013-F_BIB13","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00264564","article-title":"Formal semantics of a class of high-level primitives for coordinating concurrent processes","volume":"5","author":"Lauer","year":"1975","journal-title":"Acta Inform."},{"key":"10.1016\/0743-7315(90)90013-F_BIB14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF00266047","article-title":"COSY\u2014A system specification language based on paths and processes","volume":"12","author":"Lauer","year":"1979","journal-title":"Acta Inform."},{"key":"10.1016\/0743-7315(90)90013-F_BIB15","first-page":"265","article-title":"Impartiality, justice and fairness: The ethnics of concurrent termination","author":"Lehman","year":"1979","journal-title":"Automata Language Programming"},{"key":"10.1016\/0743-7315(90)90013-F_BIB16","series-title":"Rep. ASM\/121","article-title":"VLSI implementation of Cosy","author":"Li","year":"1984"},{"key":"10.1016\/0743-7315(90)90013-F_BIB17","series-title":"Symposium on Principles of Programming Languages","article-title":"On the composition of processes","author":"Pratt","year":"1982"},{"issue":"3","key":"10.1016\/0743-7315(90)90013-F_BIB18","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/TSE.1978.231501","article-title":"Software descriptions with Flow Expressions","volume":"SE-4","author":"Shaw","year":"1978","journal-title":"IEEE Trans. Software Engrg."},{"year":"1986","series-title":"METANODE: Exploiting special purpose processors to build a general purpose machine","author":"Siegel","key":"10.1016\/0743-7315(90)90013-F_BIB19"},{"key":"10.1016\/0743-7315(90)90013-F_BIB20","series-title":"Parallel MIMD Computation: The HEP Sypercomputer and its Applications","first-page":"41","article-title":"The Architecture of HEP","author":"Smith","year":"1985"},{"key":"10.1016\/0743-7315(90)90013-F_BIB21","series-title":"Proc. Twelfth Annual Symposium on Computer Architecture","first-page":"292","article-title":"The transputer","author":"Whitby-smith","year":"1987"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090013F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090013F?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:24Z","timestamp":1757514504000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159090013F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["074373159090013F"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90013-f","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A fully parallel algorithm for implementing path expressions","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(90)90013-F","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}