{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:11:56Z","timestamp":1778249516950,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602163","type":"print"},{"value":"9783540447337","type":"electronic"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0030842","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T03:51:40Z","timestamp":1133409100000},"page":"270-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Extending the Hong-Kung model to memory hierarchies"],"prefix":"10.1007","author":[{"given":"John E.","family":"Savage","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, A. Chandra, and M. Snir, \u201cA Model for Hierarchical Memory,\u201d Procs. 21st Annual ACM Symposium on Theory of Computing (May 15\u201317, 1989), 305\u2013314.","DOI":"10.1145\/28395.28428"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, A. Chandra, and M. Snir, \u201cHierarchical Memory with Block Transfer,\u201d Proc. 28th Annl. Symp. on Foundations of Computer Science (October 1987), 204\u2013216.","DOI":"10.1109\/SFCS.1987.31"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"A. Aggarwal and J. S. Vitter, \u201cThe Input\/Output Complexity of Sorting and Related Problems,\u201d Communications of the ACM 31 (September 1988), 1116\u20131127.","journal-title":"Communications of the ACM"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"B. Alpern, L. Carter, and E. Feig, \u201cUniform Memory Hierarchies,\u201d Proc. 31st Annual Symposium on Foundations of Computer Science (October 22\u201324, 1990), 600\u2013608.","DOI":"10.1109\/FSCS.1990.89581"},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TC.1983.1676281","volume":"C-32","author":"D. A. Carlson","year":"1983","unstructured":"D. A. Carlson, \u201cTime-Space Tradeoffs for Back-to-Back FFT Algorithms,\u201d IEEE Trans. Computing C-32 (1983), 585\u2013589.","journal-title":"IEEE Trans. Computing"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"S. Even and A. Litman, \u201cLayered Cross Product\u2013A Technique to Construct Interconnection Networks,\u201d Proc. 4th Ann. ACM Symp. on Parallel Algorithms and Architectures (June 29\u2013July 1, 1992), 60\u201369.","DOI":"10.1145\/140901.140908"},{"key":"29_CR7","first-page":"35","volume":"60","author":"D. Y. Grigoryev","year":"1976","unstructured":"D. Y. Grigoryev, \u201cAn Application of Separability and Independence Notions for Proving Lower Bounds of Circuit Complexity,\u201d Notes of Scientific Seminars, Steklov Math. Inst. 60 (1976), 35\u201348.","journal-title":"Notes of Scientific Seminars, Steklov Math. Inst."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"J.-W. Hong and H. T. Kung, \u201cI\/O Complexity: The Red-Blue Pebble Game,\u201d Proc. 13th Ann. ACM Symp. on Theory of Computing (May 11\u201313, 1981), 326\u2013333.","DOI":"10.1145\/800076.802486"},{"key":"29_CR9","volume-title":"Introduction to Parallel Algorithms and Architectures","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton, in Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1992."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"M. H. Nodine and J. S. Vitter, \u201cLarge-Scale Sorting in Parallel Memories (Extended Abstract),\u201d Procs. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (July 21\u201324, 1991), 29\u201339.","DOI":"10.1145\/113379.113382"},{"key":"29_CR11","unstructured":"M. S. Paterson and C. E. Hewitt, \u201cComparative Schematology,\u201d Proc. Proj. MAC Conf. on Concurrent Systems and Parallel Computation (June 1970), 119\u2013127."},{"key":"29_CR12","unstructured":"J. E. Savage and J. S. Vitter, \u201cParallelism in Space-Time Tradeoffs,\u201d in Advances in Computing Research, F. P. Preparata, ed., 1987, 117\u2013146."},{"key":"29_CR13","unstructured":"J. E. Savage, A Generalization of Grigoryev's Space-Time Tradeoff Method, Unpublished manuscript, March 1995."},{"key":"29_CR14","first-page":"118","volume":"20","author":"M. Tompa","year":"1980","unstructured":"M. Tompa, \u201cTime-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits,\u201d JCSS 20 (1980), 118\u2013132.","journal-title":"JCSS"},{"key":"29_CR15","first-page":"106","volume":"23","author":"M. Tompa","year":"1981","unstructured":"M. Tompa, \u201cCorrigendum: Time-Space Tradeoffs for Computing Functions, Using Connectivity Properties of Their Circuits,\u201d JCSS 23 (1981), 106.","journal-title":"JCSS"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"J. S. Vitter and E. A. M. Shriver, \u201cOptimal Disk I\/O with Parallel Block Transfer,\u201d Procs. 22nd Annual ACM Symposium on Theory of Computing (May 1990), 159\u2013169.","DOI":"10.1145\/100216.100234"},{"key":"29_CR17","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1109\/TC.1981.1675790","volume":"C-30","author":"C. L. Wu","year":"1981","unstructured":"C. L. Wu and T. Y. Feng, \u201cThe Universality of the Shuffle-Exchange Network,\u201d IEEE Trans. Computing C-30 (May 1981), 324\u2013332.","journal-title":"IEEE Trans. Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030842","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:21:20Z","timestamp":1778246480000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0030842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602163","9783540447337"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0030842","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"20 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}