{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:29Z","timestamp":1742617169072,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:29Z","timestamp":1330278749000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Lower bounds to processor-time tradeoffs under bounded-speed message propagation"],"prefix":"10.1007","author":[{"given":"Gianfranco","family":"Bilardi","sequence":"first","affiliation":[]},{"given":"Franco P.","family":"Preparata","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, A.K. Chandra and M. Snir. A Model for Hierarchical Memory. In Proc. of the 19th ACM Symposium on Theory of Computing, (1987), 305\u2013314.","DOI":"10.1145\/28395.28428"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(90)90188-N","volume":"71","author":"A. Aggarwal","year":"1990","unstructured":"A. Aggarwal, A.K. Chandra and M. Snir. Communication Complexity of PRAMs. Theoretical Computer Science, 71:3\u201328, 1990.","journal-title":"Theoretical Computer Science"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01840437","volume":"1","author":"G. Bilardi","year":"1986","unstructured":"G. Bilardi and F.P. Preparata. Area-Time Lower-Bound Techniques with Application to Sorting. Algorithmica, 1:65\u201391, 1986.","journal-title":"Algorithmica"},{"key":"1_CR4","unstructured":"G. Bilardi and F.P. Preparata. Horizons of Parallel Computing. In Proc. of INRIA 25th Anniversary Symposium, invited paper, 1992, LNCS Springer-Verlag. To appear in Journal on Parallel and Distributed Computing."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"G. Bilardi and F.P. Preparata. Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds. TR, CS Dept., Brown University, May 1995.","DOI":"10.1145\/215399.215443"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"G. Bilardi and F.P. Preparata. Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds. TR, CS Dept., Brown University, May 1995.","DOI":"10.1145\/215399.215443"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"2","author":"R.P. Brent","year":"1974","unstructured":"R.P. Brent. The Parallel Evaluation of General Arithmetic Expressions. Journal of the ACM, (21)2:201\u2013206, 1974.","journal-title":"Journal of the ACM"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S.A. Cook","year":"1973","unstructured":"S.A. Cook and R.A. Reckhow. Time Bounded Random Access Machines. Journal of Comput. System Science, 7:354\u2013375, 1973.","journal-title":"Journal of Comput. System Science"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"J.W. Hong and H.T. Kung. I\/O Complexity: The Red-Blue Pebble Game. In Proc. of the 13th ACM Symposium on Theory of Computing, (1981), 326\u2013333.","DOI":"10.1145\/800076.802486"},{"key":"1_CR10","unstructured":"J.E. Savage. Space-Time Tradeoffs in Memory Hierarchies. TR, Dept. of Comp.Sci., Brown University, 1995."},{"key":"1_CR11","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:289\u2013317, 1986.","journal-title":"Annual Review of Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:55:36Z","timestamp":1742597736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}