{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:04:38Z","timestamp":1648857878802},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1016\/0020-0190(94)90030-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"73-76","source":"Crossref","is-referenced-by-count":2,"title":["Two-coloring linked lists is NC1-complete for logarithmic space"],"prefix":"10.1016","volume":"49","author":[{"given":"Sanjeev","family":"Saxena","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90030-2_BIB1","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","article-title":"Optimal bounds for decision problems on the CRCW PRAM","volume":"36","author":"Beame","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)90030-2_BIB2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90030-2_BIB3","first-page":"95","article-title":"New simulations between CRCW PRAMs","volume":"380","author":"Chlebus","year":"1989"},{"key":"10.1016\/0020-0190(94)90030-2_BIB4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90030-2_BIB5","article-title":"Parallel merge sort - Correction","author":"Cole","year":"1993","journal-title":"Manuscript"},{"key":"10.1016\/0020-0190(94)90030-2_BIB6","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","article-title":"Faster optimal parallel prefix sums and list ranking","volume":"81","author":"Cole","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(94)90030-2_BIB7","first-page":"2","article-title":"A taxonomy of problems with fast parallel solutions","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(94)90030-2_BIB8","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","article-title":"Problems complete for deterministic logarithmic space","volume":"8","author":"Cook","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)90030-2_BIB9","first-page":"315","article-title":"Parallel symmetry breaking in sparse graphs","author":"Goldberg","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(94)90030-2_BIB10","first-page":"89","article-title":"Incomparability in parallel computation","author":"Grolmusz","year":"1987","journal-title":"Proc. 28th IEEE Symp. FOCS"},{"key":"10.1016\/0020-0190(94)90030-2_BIB11","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"H\u00e5stad","year":"1986","journal-title":"Proc. 18th ACM Symp. on Theory of Computing"},{"issue":"3","key":"10.1016\/0020-0190(94)90030-2_BIB12","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/0218043","article-title":"Expressibility and parallel complexity","volume":"18","author":"Immerman","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)90030-2_BIB13","article-title":"Fast connected components algorithms for the EREW PRAM","author":"Karger","year":"1993","journal-title":"Manuscript"},{"key":"10.1016\/0020-0190(94)90030-2_BIB14","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","article-title":"Parallel computation and conflicts in memory access","volume":"14","author":"Ku\u010dera","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)90030-2_BIB15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexities of networks for sorting and switching","volume":"22","author":"Muller","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(94)90030-2_BIB16","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TC.1983.1676279","article-title":"Efficient VLSI networks for parallel processing based on orthogonal trees","volume":"32","author":"Nath","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(94)90030-2_BIB17","first-page":"143","article-title":"On parallel sorting and addition with concurrent writes","volume":"338","author":"Saxena","year":"1988"},{"key":"10.1016\/0020-0190(94)90030-2_BIB18","series-title":"Ph.D. Thesis","article-title":"Design and analysis of some parallel algorithms","author":"Schieber","year":"1987"},{"key":"10.1016\/0020-0190(94)90030-2_BIB19","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900302?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900302?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:29:14Z","timestamp":1555144154000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0020019094900302"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90030-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}