{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:17:30Z","timestamp":1787509050813,"version":"build-2736575974"},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540508406","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028978","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:28:19Z","timestamp":1133396899000},"page":"120-131","source":"Crossref","is-referenced-by-count":3,"title":["Time-optimal simulations of networks by universal parallel computers"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rolf","family":"Wanka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Koml\u00f3s, E. Szemer\u00e9di, An O(n log n) sorting network, Proc. 15th ACM-STOC (1983) 1\u20139","DOI":"10.1145\/800061.808726"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"M. Atallah, S. R. Kosaraju, Graph problems on a mesh-connected processor array, Proc. 14th ACM-STOC (1982) 345\u2013353","DOI":"10.1145\/800070.802210"},{"key":"10_CR3","first-page":"307","volume":"32","author":"K. E. Batcher","year":"1968","unstructured":"K. E. Batcher, Sorting networks and their applications, AFIPS Conf. Proceedings 32 (1968), 307\u2013314","journal-title":"AFIPS Conf. Proceedings"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1145\/322374.322382","volume":"30","author":"Z. Galil","year":"1983","unstructured":"Z. Galil, W.J. Paul, An efficient general-purpose parallel computer, JACM 30 (1983) 360\u2013387","journal-title":"JACM"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1137\/0212023","volume":"12","author":"S. E. Hambrusch","year":"1983","unstructured":"S. E. Hambrusch, VLSI algorithms for the connected component problem, SIAM Journal on Computing 12 (1983) 354\u2013365","journal-title":"SIAM Journal on Computing"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"T. Leighton, Tight bounds on the complexity of parallel sorting, Proc. 16th ACM-STOC (1984) 71\u201380","DOI":"10.1145\/800057.808667"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF00265559","volume":"19","author":"F. Meyer auf der Heide","year":"1983","unstructured":"F. Meyer auf der Heide, Efficiency of universal parallel computers, Acta Informatica 19 (1983) 269\u2013296","journal-title":"Acta Informatica"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1137\/0215008","volume":"15","author":"F. Meyer auf der Heide","year":"1986","unstructured":"F. Meyer auf der Heide, Efficient simulations among several models of parallel computers, SIAM Journal on Computing 15 (1986) 106\u2013109","journal-title":"SIAM Journal on Computing"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(83)90001-7","volume":"16","author":"F. Meyer auf der Heide","year":"1983","unstructured":"F. Meyer auf der Heide, Infinite cube-connected cycles, Information Processing Letters 16 (1983) 1\u20132","journal-title":"Information Processing Letters"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TC.1977.1674863","volume":"C26\u20135","author":"M. C. Pease","year":"1977","unstructured":"M. C. Pease, The indirect binary n-cube microprocessor array, IEEE Transactions on Computers C26\u20135 (1977) 458\u2013473","journal-title":"IEEE Transactions on Computers"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F. Preparata","year":"1981","unstructured":"F. Preparata, J. Vuillemin, The cube connected cycles: a versatile network for parallel computation, CACM 24 (1981) 300\u2013309","journal-title":"CACM"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"J. H. Reif, L. G. Valiant, A logarithmic time sort for linear size networks, Proc. 15th ACM-STOC (1983) 10\u201316","DOI":"10.1145\/800061.808727"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1109\/T-C.1971.223205","volume":"C20-2","author":"H. Stone","year":"1971","unstructured":"H. Stone, Parallel processing with the perfect shuffle, IEEE Transactions on Computers C20-2 (1971) 153\u2013161","journal-title":"IEEE Transactions on Computers"},{"key":"10_CR14","unstructured":"R. Wanka, \u00dcber die Effizienz von Simulationen eingeschr\u00e4nkter Netzwerkklassen auf universellen parallelen Rechnern, Diplomarbeit, University of Dortmund, 1988"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A. Waksman","year":"1968","unstructured":"A. Waksman, A permuting network, JACM 15 (1968) 159\u2013163","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","STACS 89"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0028978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:14:57Z","timestamp":1586578497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540508406"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0028978","relation":{},"subject":[]}}