{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T09:52:44Z","timestamp":1673344364370},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1007\/bf01189854","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T21:46:49Z","timestamp":1108676809000},"page":"343-356","source":"Crossref","is-referenced-by-count":11,"title":["A model of sequential computation with Pipelined access to memory"],"prefix":"10.1007","volume":"26","author":[{"given":"Fabrizio","family":"Luccio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linda","family":"Pagli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, A. K. Chandra, and M. Snir. A model for hierarchical memory.Proc. 19th ACM STOC, 1987, pp. 305?314.","DOI":"10.1145\/28395.28428"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, A. K. Chandra, and M. Snir. Hierarchical memory with block transfer.Proc. 28th IEEE FOCS, 1987, pp. 1?13.","DOI":"10.1109\/SFCS.1987.31"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, A. K. Chandra, and M. Snir. On communication latency in PRAM computation.Proc. 1st ACM SPAA, 1989, pp. 11?21.","DOI":"10.1145\/72935.72937"},{"key":"CR4","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1984","unstructured":"A. Aho, J. Hopcroft, and J. Ullman.The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1984."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"B. Alpern, L. Carter, and E. Feig. Uniform memory hierarchies.Proc. 31st IEEE FOCS, 1990, pp. 600?608.","DOI":"10.1109\/FSCS.1990.89581"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","volume":"1","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley. A parallel algorithm for constructing minimum spanning trees.J. Algorithms,1 (1980), 51?59.","journal-title":"J. Algorithms"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"R. Cole. Parallel Merge-Sort.Proc. 27th IEEE FOCS, 1986, pp. 511?516.","DOI":"10.1109\/SFCS.1986.41"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree and graph problems.Proc. 27th IEEE FOCS, 1986, pp. 478?491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"S. A. Cook. A taxonomy of problems with fast parallel algorithms.Inform, and Control,64 (1985), 2?22.","journal-title":"Inform, and Control"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","volume":"32","author":"C. P. Kruskal","year":"1983","unstructured":"C. P. Kruskal. Searching, Merging, and Sorting in parallel computation.IEEE Trans. Comput.,32 (1983), 942?946.","journal-title":"IEEE Trans. Comput."},{"key":"CR11","unstructured":"F. Luccio and L. Pagli. Sequential computation based on pipelined access to memory.Proc. 27th Allerton Conference, 1989, pp. 702?711."},{"key":"CR12","volume-title":"Introduction to VLSI Systems","author":"C. Mead","year":"1980","unstructured":"C. Mead and L. Conway.Introduction to VLSI Systems. Addison-Wesley, Reading, MA, 1980."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"M. H. Nodine and J. F. Vitter. Large-scale sorting in parallel memories.Proc. 3rd ACM SPAA, 1991, pp. 29?39.","DOI":"10.1145\/113379.113382"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/2.86786","volume":"21","author":"D. B. Skillicorn","year":"1988","unstructured":"D. B. Skillicorn. A taxonomy for computer architectures.Computer,21 (1988), 46?57.","journal-title":"Computer"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189854.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01189854\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01189854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:36:47Z","timestamp":1586119007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01189854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["BF01189854"],"URL":"https:\/\/doi.org\/10.1007\/bf01189854","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}