{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:29:13Z","timestamp":1725456553855},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540513711"},{"type":"electronic","value":"9783540462019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035754","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:00:28Z","timestamp":1133427628000},"page":"95-107","source":"Crossref","is-referenced-by-count":0,"title":["Time lower bounds for CREW-PRAM computation of monotone functions"],"prefix":"10.1007","author":[{"given":"Gianfranco","family":"Bilardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abha","family":"Moitra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0216053","volume":"16","author":"H. Alt","year":"1987","unstructured":"H. Alt, T. Hagerup, K. Melhorn and F.P. Preparata, Simulation of idealized parallel computers on more realistic ones, SIAM J. Comput., 16 (1987), pp.808\u2013835.","journal-title":"SIAM J. Comput."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","volume":"30","author":"A. Bordin","year":"1985","unstructured":"A. Bordin, and J.E. Hopcroft, Routing, merging, and sorting on parallel models of computation, J. of Computer and System Sciences, 30 (1985), pp. 130\u2013145.","journal-title":"J. of Computer and System Sciences"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/0215006","volume":"15","author":"S. Cook","year":"1986","unstructured":"S. Cook, C. Dwork and R. Reischuk, Upper and lower time bounds for parallel random access machines without simultaneous writes, SIAM J. Comput., 15 (1986), pp. 87\u201397.","journal-title":"SIAM J. Comput."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"F.E. Fich, F. M. auf der Heide, P. Ragde, and A. Wigderson, One, two, three\u2026 infinity: lower bounds for parallel computation, Proc. 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 48\u201358.","DOI":"10.1145\/22145.22151"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"F.E. Fich, P.L. Ragde, and A. Wigderson, Relations between concurrent \u2014 write models of parallel computation, Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing, 1984, pp. 179\u2013189.","DOI":"10.1145\/800222.806745"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"S. Fortune, and J. Wyllie, Parallelism in random access machines, Proc. 10th ACM Symposium on Theory of Computing, 1978, pp. 114\u2013118.","DOI":"10.1145\/800133.804339"},{"key":"7_CR7","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1145\/322344.322353","volume":"29","author":"L.M. Goldschlager","year":"1982","unstructured":"L.M. Goldschlager, A universal interconnection pattern for parallel computers, J. Assoc. Comput. Mach., 29 (1982), pp. 1073\u20131086.","journal-title":"J. Assoc. Comput. Mach."},{"key":"7_CR8","unstructured":"K. Herley and G. Bilardi, Deterministic simulations of PRAMs on bounded degree networks, Proceedings of the 26th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, September 1988."},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","volume":"C-34","author":"C.P. Kruskal","year":"1985","unstructured":"C.P. Kruskal, L. Rudolph, and M. Snir, The power of parallel prefix, IEEE Trans. on Computers, C-34 (1985), pp. 965\u2013968.","journal-title":"IEEE Trans. on Computers"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"A. Karlin, and E. Upfal, Parallel hashing \u2014 an efficient implementation of shared memory, Proc. 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 160\u2013168.","DOI":"10.1145\/12130.12146"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R.E. Ladner","year":"1980","unstructured":"R.E. Ladner, and M.J. Fischer, Parallel prefix computation, J. Assoc. Comput. Mach., 27 (1980), pp. 831\u2013838.","journal-title":"J. Assoc. Comput. Mach."},{"key":"7_CR12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","volume":"C-30","author":"G. Lev","year":"1981","unstructured":"G. Lev, N. Pippenger, and L.G. Valiant, A fast parallel algorithm for routing in permutation networks, IEEE Trans. on computers, C-30 (1981), pp. 93\u2013100.","journal-title":"IEEE Trans. on computers"},{"key":"7_CR13","unstructured":"I.Parberry and P.Y. Yan, Improved upper and lower time bounds for parallel random access machines without simultaneous writes, The Pensylvania State University, TR CS-87-30, October 1987."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"A.G. Ranade, How to emulate shared memory, Proc. 28th Annual IEEE Symposium on Foundations of Computer Science, 1987, pp. 185\u2013194.","DOI":"10.1109\/SFCS.1987.32"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"H.U. Simon, A tight \u03a9(loglogn)-bound on the time for parallel RAMs to compute nondegenerate boolean functions, Proceedings of 1983 FCT, Lecture Notes in Computer Science 158, pp.439\u2013444.","DOI":"10.1007\/3-540-12689-9_124"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1137\/0214051","volume":"14","author":"M. Snir","year":"1985","unstructured":"M. Snir, On parallel searching, SIAM J. Comput., 14 (1985), pp. 688\u2013708.","journal-title":"SIAM J. Comput."},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1146\/annurev.cs.01.060186.001445","volume":"1","author":"L. Snyder","year":"1986","unstructured":"L. Snyder, Type architectures, shared memory and the corollary of modest potential, Annual Review of Computer Science, 1(1986), pp. 289\u2013317.","journal-title":"Annual Review of Computer Science"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach, and U. Vishkin, Finding the maximum, merging and sorting in a parallel computation model, J. of Algorithms, 2 (1981), pp. 88\u2013102.","journal-title":"J. of Algorithms"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0020-0190(84)90019-X","volume":"18","author":"G. Turan","year":"1984","unstructured":"G. Turan, The critical complexity of graph properties, Information Processing Letters, 18 (1984), pp. 151\u2013153.","journal-title":"Information Processing Letters"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"E. Upfal, A probabilistic relation between desirable and feasible models of parallel computation, Proc. of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 258\u2013265.","DOI":"10.1145\/800057.808689"},{"key":"7_CR21","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"E. Upfal and A. Wigderson, How to share memory in a distributed system, J. of Association of Computing Machinery, 34 (1987), pp. 116\u2013127.","journal-title":"J. of Association of Computing Machinery"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","volume":"4","author":"U. Vishkin","year":"1983","unstructured":"U. Vishkin, Implementation of simultaneous memory access in models that forbid it, J. Algorithms, 4 (1983), pp. 45\u201350.","journal-title":"J. Algorithms"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/S0019-9958(85)80036-X","volume":"67","author":"I. Wegener","year":"1985","unstructured":"I. Wegener, The critical complexity of all (monotone) boolean functions and monotone graph properties, Information and Control, 67 (1985), pp. 212\u2013222.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:32:03Z","timestamp":1586593923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0035754","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}