{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:41:37Z","timestamp":1787499697079,"version":"build-2736575974"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory of Computing Systems"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1007\/bf02679451","type":"journal-article","created":{"date-parts":[[2007,7,28]],"date-time":"2007-07-28T00:56:42Z","timestamp":1185584202000},"page":"3-37","source":"Crossref","is-referenced-by-count":1,"title":["Practical constructive schemes for deterministic shared-memory access"],"prefix":"10.1007","volume":"30","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":[[2007,7,30]]},"reference":[{"issue":"5","key":"BF02679451_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 Journal of Computing, 16(5):808\u2013835, 1987.","journal-title":"SIAM Journal of Computing"},{"key":"BF02679451_CR2","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0743-7315(91)90018-5","volume":"12","author":"Y. Aumann","year":"1990","unstructured":"Y. Aumann and A. Schuster. Improved memory utilization in deterministic PRAM simulations.Journal of Parallel and Distributed Computing, 12:146\u2013151, 1990.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"BF02679451_CR3","volume-title":"Algebraic Coding Theory","author":"E. R. Berlekamp","year":"1968","unstructured":"E. R. Berlekamp.Algebraic Coding Theory. McGraw-Hill, New York, 1968."},{"key":"BF02679451_CR4","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. Simple, efficient shared memory simulations.Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, pages 110\u2013119, 1993.","DOI":"10.1145\/165231.165246"},{"key":"BF02679451_CR5","doi-asserted-by":"crossref","unstructured":"D. K. Gifford. Weighted voting for replicated data.Proc. 7th ACM Symp. on Operating System Principles, pages 150\u2013159, 1979.","DOI":"10.1145\/800215.806583"},{"key":"BF02679451_CR6","volume-title":"Finite Groups","author":"D. Gorenstein","year":"1968","unstructured":"D. Gorenstein.Finite Groups. Harper and Row, New York, 1968."},{"key":"BF02679451_CR7","doi-asserted-by":"crossref","unstructured":"K. T. Herley. Efficient simulations of small shared memories on bounded degree networks.Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 390\u2013395, 1989.","DOI":"10.1109\/SFCS.1989.63508"},{"key":"BF02679451_CR8","doi-asserted-by":"crossref","unstructured":"K. T. Herley. Space-efficient representations of shared data for parallel computers.Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, pages 407\u2013416, 1990.","DOI":"10.1145\/97444.97708"},{"issue":"2","key":"BF02679451_CR9","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1137\/S0097539789164765","volume":"23","author":"K. Herley","year":"1994","unstructured":"K. Herley and G. Bilardi. Deterministic simulations of PRAMs on bounded-degree networks.SIAM Journal on Computing, 23(2):276\u2013292, April 1994.","journal-title":"SIAM Journal on Computing"},{"key":"BF02679451_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566066","volume-title":"Design Theory","author":"D. R. Hughes","year":"1985","unstructured":"D. R. Hughes and F. C. Piper.Design Theory. Cambridge University Press, Cambridge, MA, 1985."},{"issue":"1","key":"BF02679451_CR11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/356683.356686","volume":"9","author":"D. J. Kuck","year":"1977","unstructured":"D. J. Kuck. A survey of parallel machine organization and programming.ACM Computing Surveys, 9(1):29\u201359, March 1977.","journal-title":"ACM Computing Surveys"},{"issue":"4","key":"BF02679451_CR12","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(4):529\u2013544, 1990.","journal-title":"Algorithmica"},{"key":"BF02679451_CR13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","volume":"21","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, 21:339\u2013374, 1984.","journal-title":"Acta Informatica"},{"issue":"1","key":"BF02679451_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01294463","volume":"15","author":"M. Morgenstern","year":"1995","unstructured":"M. Morgenstern. Natural bounded concentrators.Combinatorica, 15(1):111\u2013122, 1995.","journal-title":"Combinatorica"},{"key":"BF02679451_CR15","first-page":"110","volume-title":"Proc. 10th Symp. on Theoretical Aspects of Computer Science","author":"A. Pietracaprina","year":"1993","unstructured":"A. Pietracaprina and F. P. Preparata. AnO(\u221an)-worst-case-time solution to the granularity problem. In K. W. Wagner P. Enjalbert, A. Finkel, editor,Proc. 10th Symp. on Theoretical Aspects of Computer Science, pages 110\u2013119, W\u00fcrzburg, February 1993. LNCS 665, Springer-Verlag, Berlin."},{"key":"BF02679451_CR16","first-page":"319","volume-title":"Proc. 2nd European Symp. on Algorithms","author":"A. Pietracaprina","year":"1994","unstructured":"A. Pietracaprina and G. Pucci. Tight bounds on deterministic PRAM emulations with constant redundancy. In J. V. Leeuwen, editor,Proc. 2nd European Symp. on Algorithms, pages 319\u2013400, Utrecht, September 1994, LNCS 855, Springer-Verlag, Berlin."},{"key":"BF02679451_CR17","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.Journal of Computer and System Sciences, 42:307\u2013326, 1991. See alsoProc. 28th IEEE Symp. on Foundations of Computer Science, pages 185\u2013194, 1987.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"BF02679451_CR18","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/320071.320076","volume":"4","author":"R. H. Thomas","year":"1979","unstructured":"R. H. Thomas. A majority consensus approach to concurrency control for multiple copy databases.ACM Transactions on Databases Systems, 4(2):180\u2013209, 1979.","journal-title":"ACM Transactions on Databases Systems"},{"issue":"1","key":"BF02679451_CR19","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.Journal of the ACM, 34(1):116\u2013127, 1987.","journal-title":"Journal of the ACM"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02679451.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02679451\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02679451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T07:40:47Z","timestamp":1558338047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02679451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":19,"aliases":["10.1007\/s002240000039"],"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["BF02679451"],"URL":"https:\/\/doi.org\/10.1007\/bf02679451","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}