{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:04:27Z","timestamp":1787501067527,"version":"build-2736575974"},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":7047,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/s0022-0000(05)80003-0","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"231-254","source":"Crossref","is-referenced-by-count":34,"title":["Exact lower time bounds for computing Boolean functions on CREW PRAMs"],"prefix":"10.1016","volume":"48","author":[{"given":"Martin","family":"Dietzfelbinger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00fcdiger","family":"Reischuk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80003-0_bib1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0890-5401(88)90040-5","article-title":"Limits on the power of concurrent-write parallel machines","volume":"76","author":"Beame","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80003-0_bib2","unstructured":"P. Beame and N. Nisan, personal communication."},{"key":"10.1016\/S0022-0000(05)80003-0_bib3","series-title":"Proceedings, 28th IEEE Sympos. Found. of Computer Sci.","first-page":"118","article-title":"Generic oracles and oracle classes","author":"Blum","year":"1987"},{"key":"10.1016\/S0022-0000(05)80003-0_bib4","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/0403015","article-title":"Harmonic analysis of polynomial threshold functions","volume":"3","author":"Bruck","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0022-0000(05)80003-0_bib5","series-title":"Proceedings, 31st IEEE Sympos. Found. of Computer Sci.","first-page":"632","article-title":"Polynomial threshold functions, AC0 functions, and spectral norms","author":"Bruck","year":"1990"},{"key":"10.1016\/S0022-0000(05)80003-0_bib6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(86)90083-6","article-title":"Properties of complexity measures for PRAMs and WRAMs","volume":"48","author":"Bublitz","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80003-0_bib7","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\/S0022-0000(05)80003-0_bib8","article-title":"Realistic Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs","author":"Dietzfelbinger","year":"1991"},{"key":"10.1016\/S0022-0000(05)80003-0_bib9","series-title":"Proceedings, 16th International Colloquium on Automata, Languages and Programming","first-page":"439","article-title":"Parallel retrieval of scattered information","volume":"Vol. 372","author":"Hagerup","year":"1989"},{"key":"10.1016\/S0022-0000(05)80003-0_bib10","series-title":"Proceedings, 5th Structure in Complexity Theory Conference","first-page":"66","article-title":"On the power of randomness in the decision tree model","author":"Hajnal","year":"1990"},{"key":"10.1016\/S0022-0000(05)80003-0_bib11","article-title":"One-Way Functions, Robustness, and Nonisomorphism of NP-Complete Sets","author":"Hartmanis","year":"1987"},{"key":"10.1016\/S0022-0000(05)80003-0_bib12","series-title":"Proceedings, 29th IEEE Sympos. Found. of Computer Sci.","first-page":"68","article-title":"The influence of variables on boolean functions","author":"Kahn","year":"1988"},{"key":"10.1016\/S0022-0000(05)80003-0_bib13","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1137\/0220051","article-title":"Time complexity of Boolean functions on CREW PRAMs","volume":"20","author":"Kuty\u0142owski","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80003-0_bib14","article-title":"Evaluating Formulas on Parallel Machines without Simultaneous Writes","author":"Kuty\u0142owski","year":"1990"},{"key":"10.1016\/S0022-0000(05)80003-0_bib15","series-title":"Recent Developments in Switching Theory","first-page":"121","article-title":"Harmonic analysis of switching functions","author":"Lechner","year":"1971"},{"key":"10.1016\/S0022-0000(05)80003-0_bib16","series-title":"Proceedings, 30th IEEE Sympos. Found. of Computer Sci.","first-page":"574","article-title":"Constant depth circuits, Fourier transform, and learnability","author":"Linial","year":"1989"},{"key":"10.1016\/S0022-0000(05)80003-0_bib17","series-title":"Perceptrons","author":"Minsky","year":"1969"},{"key":"10.1016\/S0022-0000(05)80003-0_bib18","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1137\/0220062","article-title":"CREW PRAMs and decision trees","volume":"20","author":"Nisan","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80003-0_bib19","series-title":"Proceedings, 24th ACM Sympos. Theory of Computing","first-page":"462","article-title":"On the degree of boolean functions as real polynomials","author":"Nisan","year":"1992"},{"key":"10.1016\/S0022-0000(05)80003-0_bib20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0220005","article-title":"Improved upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"20","author":"Parberry","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80003-0_bib21","series-title":"Proceedings, 24th ACM Sympos. Theory of Computing","first-page":"468","article-title":"On the degree of polynomials that approximate symmetric boolean functions","author":"Paturi","year":"1992"},{"issue":"No. 4","key":"10.1016\/S0022-0000(05)80003-0_bib22","first-page":"598","article-title":"Lower bounds on the size of bounded depth networks over a complete basis with logical addition","volume":"41","author":"Razborov","year":"1987","journal-title":"Mat. Zametki"},{"key":"10.1016\/S0022-0000(05)80003-0_bib23","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/TIT.1954.1057465","article-title":"A class of multiple error-correcting codes and the decoding scheme","volume":"IT-4","author":"Reed","year":"1954","journal-title":"IRE Trans. Inform. Theory"},{"key":"10.1016\/S0022-0000(05)80003-0_bib24","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\/S0022-0000(05)80003-0_bib25","series-title":"Proceedings, 27th IEEE Sympos. Found of Computer Sci.","first-page":"29","article-title":"Probabilistic boolean decision trees and the complexity of evaluating game trees","author":"Saks","year":"1986"},{"key":"10.1016\/S0022-0000(05)80003-0_bib26","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S0019-9958(82)90477-6","article-title":"A tight \u03c9(log log n) bound on the time for parallel RAM's to compute nondegenerate Boolean functions","volume":"55","author":"Simon","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80003-0_bib27","series-title":"Proceedings, 19th ACM Sympos. Theory of Computing","first-page":"77","article-title":"Algebraic methods in the theory of lower bounds for Boolean circuit complexity","author":"Smolensky","year":"1987"},{"key":"10.1016\/S0022-0000(05)80003-0_bib28","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0214051","article-title":"On parallel searching","volume":"14","author":"Snir","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80003-0_bib29","article-title":"Algebraic Methods in Lower Bounds for Computational Models with Limited Communication","author":"Szegedy","year":"1989"},{"key":"10.1016\/S0022-0000(05)80003-0_bib30","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02125350","article-title":"Query complexity, or why is it difficult to separate NPA \u2229 co-NPA from PA by a random oracle A?","volume":"9","author":"Tardos","year":"1989","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(05)80003-0_bib31","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800030?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800030?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T17:27:43Z","timestamp":1548178063000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["S0022000005800030"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80003-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}