{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:21Z","timestamp":1725664461934},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996]]},"DOI":"10.1007\/3-540-60922-9_16","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:03:51Z","timestamp":1330272231000},"page":"181-192","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fault-tolerant shared memory simulations"],"prefix":"10.1007","author":[{"given":"Petra","family":"Berenbrink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","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,7]]},"reference":[{"key":"16_CR1","volume-title":"Technical Report CRI 88-14","author":"J.R. Anderson","year":"1988","unstructured":"J.R. 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":"16_CR2","volume-title":"Technical Report","author":"\u00d6. Babaoglu","year":"1988","unstructured":"\u00d6. Babaoglu, R. Drummond and P. Stephenson: The impact of communication network properties on reliable broadcast protocols. Technical Report, Department of Computer Science, Cornell University, Ithaca, New York 1988."},{"key":"16_CR3","unstructured":"P. Berenbrink, F. Meyer auf der Heide and V. Stemann: Fault-tolerant shared memory simulations. Technical Report, to appear."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, A. Gambin and P. Indyk: PRAM computations resilient to memory faults. In Proc. of the 2nd Annual European Symposium on Algorithms, pp 401\u2013412, 1994.","DOI":"10.1007\/BFb0049426"},{"key":"16_CR5","unstructured":"F. Christian, H. Aghili, D. Dolev and Ray Strong: Atomic broadcast: from simple message diffusion to byzantine agreement. Computer Science, 1984."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"A. Czumaj, F. Meyer auf der Heide and V. Stemann: Shared memory simulations with triple logarithmic delay. In Proc. of the 3rd Annual European Symposium on Algorithms, pp 46\u201359, 1995.","DOI":"10.1007\/3-540-60313-1_133"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide: Simple, efficient shared memory simulations. In Proc. of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp 110\u2013119, 1993.","DOI":"10.1145\/165231.165246"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"M. Dietzfelbinger and F. Meyer auf der Heide: How to distribute a hash table in a complete network. In Proc. of the 22nd ACM Symposium on Theory of Computing, pp 117\u2013127, 1990.","DOI":"10.1145\/100216.100229"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"L.A. Goldberg, M. Jerrum and T. Leighton: A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer. In Proc. of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pp 300\u2013309, 1993.","DOI":"10.1145\/165231.166108"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"L.A. Goldberg, Y. Matias and S. Rao: An optical simulation of shared memory. In Proc. of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, pp 257\u2013267, 1994.","DOI":"10.1145\/181014.181406"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"R. Karp, M. Luby, and F. Meyer auf der Heide: Efficient PRAM simulations on distributed memory machine. In Proc. of the 24th Annual ACM Symposium on Theory of Computing, pp 318\u2013326, 1992.","DOI":"10.1145\/129712.129743"},{"key":"16_CR12","volume-title":"Technical Report 94-06","author":"P.D. MacKenzie","year":"1994","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."},{"key":"16_CR13","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":"16_CR14","doi-asserted-by":"crossref","unstructured":"F. Meyer auf der Heide, C. Scheideler and V. Stemann: Exploiting storage redundancy to speed up randomized shared memory simulations. In Proc. of the 12th Annual Symposium on Theoretical Aspects of Computer Science, pp 267\u2013278, 1995.","DOI":"10.1007\/3-540-59042-0_79"},{"key":"16_CR15","unstructured":"J.P. Schmitt, A. Siegel and A. Srinivasan: Chernoff-Hoeffding bounds for applications with limited independence. In the Proc. of the 4th ACM-Siam Symposium on Discrete Algorithms, pp 331\u2013340, 1993."},{"key":"16_CR16","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 Annual Symposium on Foundations of Computer Science, pp 20\u201325, 1989.","DOI":"10.1109\/SFCS.1989.63450"},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"E. Upfal and 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."}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T04:43:25Z","timestamp":1578545005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_16"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"7 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}