{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:03Z","timestamp":1725663543880},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180999"},{"type":"electronic","value":"9783540477600"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18099-0_24","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:27:59Z","timestamp":1330198079000},"page":"11-15","source":"Crossref","is-referenced-by-count":0,"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","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman: \u201cTwo Theorems on Random Polynomial Time\u201d. Proc. 19'th Symp. Found. of Comp. Sci. (1978), 75\u201383.","DOI":"10.1109\/SFCS.1978.37"},{"key":"1_CR2","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":"1_CR3","first-page":"307","volume":"32","author":"K.E. Batcher","year":"1968","unstructured":"K.E. Batcher: \u201cSorting networks and their applications\u201d. Proc. AFIPS Spring Joint Comp. Conf. 32 (1968), 307\u2013314.","journal-title":"Proc. AFIPS Spring Joint Comp. Conf."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"A. Borodin, J.E. Hoperoft: \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":"1_CR5","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":"1_CR6","doi-asserted-by":"crossref","unstructured":"O. Gabber, Z. Galil: \u201cExplicit Constructions of Linear Size Concentrators and Superconcentrators\u201d. Proc. 20'th Symp. Found. of Comp. Sci. (1979), 364\u2013370.","DOI":"10.1109\/SFCS.1979.16"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","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":"1_CR8","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), 160\u2013168.","DOI":"10.1145\/12130.12146"},{"key":"1_CR9","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":"1_CR10","doi-asserted-by":"publisher","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":"1_CR11","volume-title":"Theory of Graphs","author":"O. Ore","year":"1962","unstructured":"O. Ore: \u201cTheory of Graphs\u201d. American Mathematical Society, Providence, Rhode Island (1962)."},{"issue":"5","key":"1_CR12","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Preparata","year":"1981","unstructured":"F.P. Preparata, J. Vuillemin: \u201cThe Cube-Connected Cycles: A Versatile Network for Parallel Computation\u201d. Communications of the ACM 24:5 (1981), 300\u2013309.","journal-title":"Communications of the ACM"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"J.H. Reif: \u201cOn the Power of Probabilistic Choice in Synchronous Parallel Computations\u201d. Proc. 9'th Int. Coll. Automata, Languages and Programming (1982), 442\u2013450.","DOI":"10.1007\/BFb0012790"},{"key":"1_CR14","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":"1_CR15","doi-asserted-by":"crossref","unstructured":"E. Upfal, A. Wigderson: How to Share Memory in a Distributed System\u201d. Proc. 25'th Symp. Found. of Comp. Sci. (1984), 171\u2013180.","DOI":"10.1109\/SFCS.1984.715913"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/S0019-9958(83)80003-5","volume":"56","author":"U. Vishkin","year":"1983","unstructured":"U. Vishkin, A. Wigderson: \u201cDynamic Parallel Memories\u201d. Information and Control 56 (1983), 174\u2013182.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Parallel Algorithms and Architectures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18099-0_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:13Z","timestamp":1605644053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18099-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540180999","9783540477600"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-18099-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}