{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:34:08Z","timestamp":1757615648738,"version":"3.44.0"},"reference-count":3,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,3,27]],"date-time":"2003-03-27T00:00:00Z","timestamp":1048723200000},"content-version":"vor","delay-in-days":4317,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1016\/0020-0190(91)90085-v","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"295-299","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel cardinality stacks and an application"],"prefix":"10.1016","volume":"38","author":[{"given":"Robert","family":"Kennedy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90085-V_BIB1","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978","journal-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(91)90085-V_BIB2","series-title":"Tech. Rept. STAN-CS-90-1301","article-title":"Processor-efficient implementation of a Maximum Flow algorithm","author":"Goldberg","year":"1990"},{"key":"10.1016\/0020-0190(91)90085-V_BIB3","series-title":"Proc. 10th Coll. on Automata, Languages and Programming","first-page":"597","article-title":"Parallel dictionaries on 2\u20133 trees","author":"Paul","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190085V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190085V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:56Z","timestamp":1757084336000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190085V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":3,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["002001909190085V"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90085-v","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1991,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel cardinality stacks and an application","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(91)90085-V","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}