{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:59:41Z","timestamp":1787500781071,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540565031","type":"print"},{"value":"9783540475743","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:13:53Z","timestamp":1330236833000},"page":"110-119","source":"Crossref","is-referenced-by-count":2,"title":["An O(\u221an)-worst-case-time solution to the granularity problem"],"prefix":"10.1007","author":[{"given":"A.","family":"Pietracaprina","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F. P.","family":"Preparata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"issue":"5","key":"14_CR1","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0216053","volume":"16","author":"H. Alt","year":"1987","unstructured":"H. Alt, T. Hagerup, K. Mehlhorn, and F.P. Preparata. Deterministic simulation of idealized parallel computers on more realistic ones. SIAM J. on Computing, 16(5):808\u2013835, 1987.","journal-title":"SIAM J. on Computing"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"N. Alon and V. D. Milman. \u03bb1, isoperimetric inequalities for graphs and superconcentrators. Journal of Combinatorial Theory Series\nB, 38:73\u201388, 1985.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"D.K. Gifford. Weighted voting for replicated data. Proc. of the 7th ACM Symp. on Operating System Principles, pages 150\u2013159, 1979.","DOI":"10.1145\/800215.806583"},{"key":"14_CR4","volume-title":"Combinatorial Theory","author":"M. Hall Jr.","year":"1986","unstructured":"M. Hall Jr. Combinatorial Theory. John Wiley & Sons, New York NY, second edition, 1986.","edition":"second edition"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"K.T. Herley. Efficient simulations of small shared memories on bounded degree networks. Proc. of the 30th IEEE Symp. on Foundations of Comp. Sc., pages 390\u2013395, 1989.","DOI":"10.1109\/SFCS.1989.63508"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"K.T. Herley. Space-efficient representations of shared data for parallel computers. Proc. of the 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 407\u2013416, 1990.","DOI":"10.1145\/97444.97708"},{"issue":"4","key":"14_CR7","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1145\/48014.350550","volume":"35","author":"A. R. Karlin","year":"1988","unstructured":"A.R. Karlin and E. Upfal. Parallel hashing: An efficient implementation of shared memory. J. ACM, 35(4):876\u2013892, 1988.","journal-title":"J. ACM"},{"key":"14_CR8","first-page":"339","volume":"21","author":"D. J. Kuck","year":"1977","unstructured":"D.J. Kuck. A survey of parallel machine organization and programming. ACM Computing Surveys, 21:339\u2013374, 1977.","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"14_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(88)90160-3","volume":"28","author":"F. Luccio","year":"1988","unstructured":"F. Luccio, A. Pietracaprina, and G. Pucci. A probabilistic simulation of PRAMs in VLSI. Information Processing Lett., 28(3):141\u2013147, 1988.","journal-title":"Information Processing Lett."},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF01840402","volume":"5","author":"F. Luccio","year":"1990","unstructured":"F. Luccio, A. Pietracaprina, and G. Pucci. A new scheme for the deterministic simulation of PRAMs in VLSI. Algorithmica, 5:529\u2013544, 1990.","journal-title":"Algorithmica"},{"issue":"1","key":"14_CR11","first-page":"29","volume":"9","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of prams by parallel machines with restricted granularity of parallel memories. Acta Informatica, 9(1):29\u201359, 1984.","journal-title":"Acta Informatica"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0022-0000(91)90005-P","volume":"42","author":"A. G. Ranade","year":"1991","unstructured":"A.G. Ranade. How to emulate shared memory. J. on Computers and System Sci., 42:307\u2013326, 1991.","journal-title":"J. on Computers and System Sci."},{"issue":"3","key":"14_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0605030","volume":"5","author":"R. M. Tanner","year":"1984","unstructured":"R.M. Tanner. Explicit concentrators from generalized n-gons. SIAM J. on Algebraic Discrete Methods, 5(3):287\u2013293, 1984.","journal-title":"SIAM J. on Algebraic Discrete Methods"},{"issue":"1","key":"14_CR14","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"E. Upfal and A. Widgerson. How to share memory in a distributed system. J. ACM, 34(1):116\u2013127, 1987.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:53:06Z","timestamp":1619556786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}