{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:26Z","timestamp":1725455486770},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016243","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"199-208","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic simulation of idealized parallel computers on more realistic ones"],"prefix":"10.1007","author":[{"given":"H.","family":"Alt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Hagerup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Koml\u00f3s, E. Szemer\u00e9di: \u201cAn O(n log n) Sorting Network\u201d. Proc. 15'th ACM Symp. Theory of Comp. (1983), 1\u20139.","DOI":"10.1145\/800061.808726"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"A. Borodin, J. E. Hopcroft: \u201cRouting, Merging and Sorting on Parallel Models of Computation\u201d. Proc. 14'th ACM Symp. Theory of Comp. (1982), 338\u2013344.","DOI":"10.1145\/800070.802209"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"S. Fortune, J. Wyllie: \u201cParallelism in Random Access Machines\u201d. Proc. 10'th ACM Symp. Theory of Comp. (1978), 114\u2013118.","DOI":"10.1145\/800133.804339"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"O. Gabber, Z. Galil: \u201cExplicit Constructions of Linear Size Concentrators and Superconcentrators\u201d. Proc. 20'th Conf. Foundations of Comp. Sci. (1979), 364\u2013370.","DOI":"10.1109\/SFCS.1979.16"},{"issue":"1","key":"14_CR5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/356683.356686","volume":"9","author":"D. J. Kuck","year":"1977","unstructured":"D. J. Kuck: \u201cA Survey of Parallel Machine Organization and Programming\u201d. Computing Surveys 9:1 (1977), 29\u201359.","journal-title":"Computing Surveys"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"A. R. Karlin, E. Upfal: \u201cParallel Hashing \u2014 An Efficient Implementation of Shared Memory\u201d. Proc. 18'th ACM Symp. Theory of Comp. (1986), to appear.","DOI":"10.1145\/12130.12146"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"T. Leighton: \u201cTight Bounds on the Complexity of Parallel Sorting\u201d. Proc. 16'th ACM Symp. Theory of Comp. (1984), 71\u201380.","DOI":"10.1145\/800057.808667"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","volume":"21","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn, U. Vishkin: \u201cRandomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories\u201d. Acta Informatica 21 (1984), 339\u2013374.","journal-title":"Acta Informatica"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"E. Upfal: \u201cA Probabilistic Relation Between Desirable and Feasible Models of Parallel Computation\u201d. Proc. 16'th ACM Symp. Theory of Comp. (1984), 258\u2013265.","DOI":"10.1145\/800057.808689"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"E. Upfal, A. Wigderson: How to Share Memory in a Distributed System\u201d. Proc. 25'th Conf. Foundations of Comp. Sci. (1984), 171\u2013180.","DOI":"10.1109\/SFCS.1984.715913"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016243.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:35Z","timestamp":1607549735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0016243","relation":{},"subject":[]}}