{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:25Z","timestamp":1759638985449,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_79","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:58:54Z","timestamp":1330275534000},"page":"267-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Exploiting storage redundancy to speed up randomized shared memory simulations"],"prefix":"10.1007","author":[{"given":"Friedhelm","family":"Meyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Scheideier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Stemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"23_CR1","volume-title":"Technical Report CRI 88-14","author":"R.J. Anderson","year":"1988","unstructured":"R.J. Anderson and G.L. Miller. Optical Communication for Pointer Based Algorithms, Technical Report CRI 88-14, Computer Science Department, University of Southern Carolina, Los Angeles, CA 90089-0782 USA, 1988."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"H. Bast and T. Hagerup. Fast and reliable parallel hashing. In Proc. of the 3rd Ann. ACM Symp. on Parallel Algorithms and Architectures, pp. 50\u201361, 1991.","DOI":"10.1145\/113379.113384"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger, F. Meyer auf der Heide. How to distribute a hash table in a complete network. In Proc. of the 22nd Ann. ACM Symp. on Theory of Computing, pp. 117\u2013127, 1990.","DOI":"10.1145\/100216.100229"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide. Simple efficient shared memory simulations. In Proceedings of the 5th Ann. ACM Symposium on Parallel Algorithms and Architectures, pp. 110\u2013119, 1993.","DOI":"10.1145\/165231.165246"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"M. Ger\u00e9b-Graus and T. Tsantilas. Efficient Optical Communication in Parallel Computers. In Proceedings of the 4th ACM Symposium on Parallel Algorithms and Architectures, pp. 41\u201348, 1992.","DOI":"10.1145\/140901.140906"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"L. A. Goldberg and M. Jerrum and T. Leighton. A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer. In Proceedings of the 5th Ann. ACM Symposium on Parallel Algorithms and Architectures, pp. 300\u2013309, 1993.","DOI":"10.1145\/165231.166108"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"L.A. Goldberg, Y. Matias, S. Rao. An optical simulation of shared memory. Technical Report, 1994.","DOI":"10.1145\/181014.181406"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"J. Gil, Y. Matias, U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In Proc. of the 32nd Ann. IEEE Symp. on Foundations of Computer Science, pp. 698\u2013710, 1991.","DOI":"10.1109\/SFCS.1991.185438"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"R. Karp, M. Luby and F. Meyer auf der Heide. Efficient PRAM simulation on distributed memory machine. In Proc. of the 24th Ann. ACM Symp. on Theory of Computing, pp. 318\u2013326, 1992.","DOI":"10.1145\/129712.129743"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"F. Meyer auf der Heide. Hashing strategies for simulating shared memory on distributed memory machines. In Proc. of the 1st Heinz Nixdorf Symposium \u201cParallel Architectures and Their Efficient Use\u201d, F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., pp. 20\u201329, 1992.","DOI":"10.1007\/3-540-56731-3_3"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"P.D. MacKenzie, C.G. Plaxton, R. Rajamaran. On contention resolution protocols and associated phenomena. University of Texas at Austin, Technical Report 94-06, 1994.","DOI":"10.1145\/195058.195122"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In Proc. of the 30th IEEE Ann. Symp. on Foundations of Computer Science, pp. 20\u201325, 1989.","DOI":"10.1109\/SFCS.1989.63450"},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"E. Upfal, A. Wigderson. How to share memory in a distributed system. J. Assoc. Comput. Mach. 34, pp. 116\u2013127, 1987.","journal-title":"J. Assoc. Comput. Mach."},{"key":"23_CR14","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","volume":"4(3)","author":"L. Valiant","year":"1975","unstructured":"L. Valiant. Parallelism in comparison problems. In SIAM J. Comp. 4(3), pp. 348\u2013355, 1975.","journal-title":"SIAM J. Comp."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"L. Valiant. General Purpose Parallel Architectures, Chapter 18 of Handbook of Theoretical Computer Science. Edited by J. van Leeuwen, Elsevier 1990.","DOI":"10.1016\/B978-0-444-88071-0.50023-0"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:41:53Z","timestamp":1742596913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_79"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}