{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T05:22:03Z","timestamp":1741152123335,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_12","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"107-120","source":"Crossref","is-referenced-by-count":2,"title":["Upper and Lower I\/O Bounds for Pebbling r-Pyramids"],"prefix":"10.1007","author":[{"given":"Desh","family":"Ranjan","sequence":"first","affiliation":[]},{"given":"John","family":"Savage","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Zubair","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"Computer Architecture: A Quantitative Approach","author":"J.L. Hennessy","year":"2007","unstructured":"Hennessy, J.L., Patterson, D.A.: Computer Architecture: A Quantitative Approach. Morgan Kaufmann, San Francisco (2007)"},{"key":"12_CR2","first-page":"346","volume-title":"Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation, FRONTIERS 1996","author":"V. Kumar","year":"1996","unstructured":"Kumar, V., Sameh, A., Grama, A., Karypis, G.: Architecture, algorithms and applications for future generation supercomputers. In: Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation, FRONTIERS 1996, Washington, DC, USA, p. 346. IEEE Computer Society, Los Alamitos (1996)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/BFb0030842","volume-title":"Computing and Combinatorics","author":"J.E. Savage","year":"1995","unstructured":"Savage, J.E.: Extending the Hong-Kung model to memory hierarchies. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 270\u2013281. Springer, Heidelberg (1995)"},{"key":"12_CR4","volume-title":"Models of Computation: Exploring the Power of Computing","author":"J.E. Savage","year":"1998","unstructured":"Savage, J.E.: Models of Computation: Exploring the Power of Computing. Addison Wesley, Reading (1998)"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Hong, J.W., Kung, H.T.: I\/O complexity: The red-blue pebble game. In: Proc. 13th Ann. ACM Symp. on Theory of Computing, pp. 326\u2013333 (1981)","DOI":"10.1145\/800076.802486"},{"key":"12_CR6","volume-title":"Mathematical Models of Financial Derivatives","author":"Y. Kwok","year":"1998","unstructured":"Kwok, Y.: Mathematical Models of Financial Derivatives. Springer, Singapore (1998)"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0304-405X(79)90015-1","volume":"7","author":"J.C. Cox","year":"1979","unstructured":"Cox, J.C., Ross, S.A., Rubinstein, M.: Option pricing: A simplified approach. Journal of Financial Economics\u00a07(3), 229\u2013263 (1979)","journal-title":"Journal of Financial Economics"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1644001.1644008","volume":"37","author":"J.E. Savage","year":"2010","unstructured":"Savage, J.E., Zubair, M.: Cache-optimal algorithms for option pricing. ACM Trans. Math. Softw.\u00a037(1), 1\u201330 (2010)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1155\/2009\/681708","volume":"17","author":"J.E. Savage","year":"2009","unstructured":"Savage, J.E., Zubair, M.: Evaluating multicore algorithms on the unified memory model. Scientific Programming\u00a017(4), 295\u2013308 (2009)","journal-title":"Scientific Programming"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","volume":"9","author":"S.A. Cook","year":"1974","unstructured":"Cook, S.A.: An observation on storage-time trade off. J. Comp. Systems Sci.\u00a09, 308\u2013316 (1974)","journal-title":"J. Comp. Systems Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T06:36:31Z","timestamp":1741070191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}