{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T02:01:36Z","timestamp":1726452096610},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90083-6","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"53-73","source":"Crossref","is-referenced-by-count":14,"special_numbering":"C","title":["Properties of complexity measures for PRAMs and WRAMs"],"prefix":"10.1016","volume":"48","author":[{"given":"Siegfried","family":"Bublitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ute","family":"Sch\u00fcrfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"Wegener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Voigt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90083-6_BIB1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90083-6_BIB2","first-page":"17","article-title":"On the evolution of random graphs","volume":"5A","author":"Erd\u00f6s","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"year":"1968","series-title":"An Introduction to Probability Theory and its Applications","author":"Feller","key":"10.1016\/0304-3975(86)90083-6_BIB3"},{"year":"1984","series-title":"Fundamentals of the Average Case Analysis of Particular Algorithms","author":"Kemp","key":"10.1016\/0304-3975(86)90083-6_BIB4"},{"key":"10.1016\/0304-3975(86)90083-6_BIB5","series-title":"Surveys in Combinatorics","first-page":"44","article-title":"Extremal hypergraph problems","author":"Kleitmann","year":"1979"},{"key":"10.1016\/0304-3975(86)90083-6_BIB6","first-page":"5","article-title":"On the number of monotone Boolean functions","volume":"38","author":"Korshunov","year":"1981","journal-title":"Probl. Kibern."},{"key":"10.1016\/0304-3975(86)90083-6_BIB7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","article-title":"On recognizing graph properties from adjacency matrices","volume":"3","author":"Rivest","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90083-6_BIB8","series-title":"Proc. FCT '83","first-page":"439","article-title":"A tight gM(log log n) bound on the time for parallel RAMs to compute nondegenerate Boolean functions","volume":"158","author":"Simon","year":"1983"},{"key":"10.1016\/0304-3975(86)90083-6_BIB9","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0020-0190(84)90019-X","article-title":"The critical complexity of graph properties","volume":"18","author":"Tur\u00e1n","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(86)90083-6_BIB10","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0214024","article-title":"Trade-offs between depth and width in parallel computation","volume":"14","author":"Vishkin","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(86)90083-6_BIB11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0019-9958(84)80031-5","article-title":"Optimal decision trees and one-time-only branching programs for symmetric Boolean functions","volume":"62","author":"Wegener","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(86)90083-6_BIB12","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/S0019-9958(85)80036-X","article-title":"The critical complexity of all (monotone) Boolean functions and monotone graph properties","volume":"67","author":"Wegener","year":"1985","journal-title":"Inform. and Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900836?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900836?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:59Z","timestamp":1553201639000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":12,"alternative-id":["0304397586900836"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90083-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1986]]}}}