{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:28Z","timestamp":1725455428270},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016246","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"230-238","source":"Crossref","is-referenced-by-count":1,"title":["Properties of complexity measures for PRAMs and WARMs"],"prefix":"10.1007","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":"Bernd","family":"Voigt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ingo","family":"Wegener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Cook,S.; Dwork,C.; Reischuk,R.: Upper and lower time bounds for parallel random access machines without simultaneous writes, to appear: SIAM Journal on Computing","DOI":"10.1137\/0215006"},{"key":"17_CR2","first-page":"17","volume":"5 A","author":"P. Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P.; R\u00e9nyi, A.: On the evolution of random graphs, Publ.Math.Inst. Hung.Acad.Sci. 5 A (1960) 17\u201361","journal-title":"Publ.Math.Inst. Hung.Acad.Sci."},{"key":"17_CR3","first-page":"5","volume":"38","author":"A.D. Korshunov","year":"1981","unstructured":"Korshunov, A.D.: On the number of monotone Boolean functions (in Russian), Probl.Kibern. 38 (1981) 5\u2013108","journal-title":"Probl.Kibern."},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"R.L. Rivest","year":"1976","unstructured":"Rivest, R.L.; Vuillemin, J.: On recognizing graph properties from adjacency matrices, Theoretical Computer Science 3 (1976) 371\u2013384","journal-title":"Theoretical Computer Science"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/3-540-12689-9_124","volume":"158","author":"H.U. Simon","year":"1983","unstructured":"Simon, H.U.: A tight \u03a9 (log log n) bound on the time for parallel RAM's to compute nondegenerate Boolean functions, FCT'83, Lecture Notes in Computer Science 158 (1983) 439\u2013444","journal-title":"Lecture Notes in Computer Science"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Tur\u00e1n,G.: The critical complexity of graph properties, Information Processing Letters (1984) 151\u2013153","DOI":"10.1016\/0020-0190(84)90019-X"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1137\/0214024","volume":"14","author":"U. Vishkin","year":"1985","unstructured":"Vishkin, U.; Wigderson, A.: Trade-offs between depth and width in parallel computation, SIAM Journal on Computing 14 (1985) 303\u2013314","journal-title":"SIAM Journal on Computing"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0019-9958(84)80031-5","volume":"62","author":"I. Wegener","year":"1984","unstructured":"Wegener, I.: Optimal decision trees and one-time-only branching programs for symmetric Boolean functions, Information and Control 62 (1984) 129\u2013143","journal-title":"Information and Control"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/BFb0028833","volume":"199","author":"I. Wegener","year":"1985","unstructured":"Wegener, I.: The critical complexity of all (monotone) Boolean functions and monotone graph properties, FCT'85, Lecture Notes in Computer Science 199 (1985) 494\u2013502","journal-title":"Lecture Notes in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016246.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:36Z","timestamp":1607549736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0016246","relation":{},"subject":[]}}