{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T21:32:44Z","timestamp":1648762364411},"reference-count":10,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0020-0190(93)90023-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"173-178","source":"Crossref","is-referenced-by-count":0,"title":["Distributed disassembly of mosaics"],"prefix":"10.1016","volume":"46","author":[{"given":"Antoni","family":"Mazurkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90023-3_BIB1","article-title":"Private communication","author":"Arnold","year":"1990","journal-title":"LaBRI Seminar"},{"key":"10.1016\/0020-0190(93)90023-3_BIB2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00263584","article-title":"On the existence of symmetric algorithms to find leaders in network of communicating sequential process","volume":"25","author":"Boug\u00e9","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(93)90023-3_BIB3","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","article-title":"Solution of a problem in concurrent programming control","volume":"8","author":"Dijkstra","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90023-3_BIB4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/TC.1982.1675885","article-title":"Election in a distributed computing system","volume":"31","author":"Garcia-Molina","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(93)90023-3_BIB5","author":"Gibbons","year":"1985"},{"key":"10.1016\/0020-0190(93)90023-3_BIB6","first-page":"155","article-title":"Distributed systems - Towards a formal approach","volume":"77","author":"Le Lann","year":"1977"},{"key":"10.1016\/0020-0190(93)90023-3_BIB7","article-title":"Graph rewriting systems as a tool to design and to prove graph and network algorithms","author":"Litovsky","year":"1990"},{"key":"10.1016\/0020-0190(93)90023-3_BIB8","first-page":"31","author":"Litovsky","year":"1991"},{"key":"10.1016\/0020-0190(93)90023-3_BIB9","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0020-0190(88)90193-7","article-title":"Solvability of the asynchronous ranking problem","volume":"28","author":"Mazurkiewicz","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90023-3_BIB10","author":"Raynal","year":"1988"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:48Z","timestamp":1555132908000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093900233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0020019093900233"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90023-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}