{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:43Z","timestamp":1759638043563},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609223"},{"type":"electronic","value":"9783540497233"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60922-9_17","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:03:42Z","timestamp":1330272222000},"page":"193-204","source":"Crossref","is-referenced-by-count":9,"title":["On word-level parallelism in fault-tolerant computing"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Indyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, D.S. Greenberg, M. Merrit, G.Taubenfeld, Computing with Faulty Shared Memory, Proc. 11th Ann. Symposium on Principles of Distributed Computing (1992), 47\u201358.","DOI":"10.1145\/135419.135431"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"A. Andersson, T. Hagerup, S. Nilsson, R. Raman, Sorting in Linear Time ?, Proc. 27th Annual ACM Symposium on Theory of Computing (1995).","DOI":"10.1145\/225058.225173"},{"key":"17_CR3","unstructured":"A.V. Aho, J.E. Hopcroft, J.D. Ullman, \u201dThe Design and Analysis of Computer Algorithms\u201d, Addison-Wesley (1974)."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Y. Aumann, Z.M. Kedem, K.V. Palem, M.O. Rabin, Highly Efficient Asynchronous Execution of Large-Grained Parallel Programs, Proc. 34th Ann. Symposium on Foundations of Computer Science (1993), 271\u2013280.","DOI":"10.1109\/SFCS.1993.366860"},{"key":"17_CR5","volume-title":"Tech. Rep. CRI 88-14","author":"R.J. Anderson","year":"1988","unstructured":"R.J. Anderson, G.L. Miller, Optical Communication for Pointer Based Algorithms, Tech. Rep. CRI 88-14, Comp. Sci. Dept., University of Southern California, Los Angeles, 1988."},{"key":"17_CR6","first-page":"401","volume":"855","author":"B.S. Chlebus","year":"1994","unstructured":"B.S. Chlebus, A. Gambin, P. Indyk, PRAM Computations Resilient to Memory Faults, Proc. 2nd European Symposium on Algorithms (1994), 401\u2013412, Springer LNCS 855.","journal-title":"Springer LNCS"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, A. Gambin, P. Indyk, Shared Memory Simulations on Faulty DMM (1995), submitted.","DOI":"10.1007\/3-540-61440-0_161"},{"key":"17_CR8","first-page":"89","volume":"979","author":"B.S. Chlebus","year":"1995","unstructured":"B.S. Chlebus, L. Gcasieniec, A. Pelc, Fast Deterministic Computations on a Faulty PRAM, Proc. 3rd European Symposium on Algorithms (1995), 89\u2013101, Springer LNCS 979.","journal-title":"Springer LNCS"},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","volume":"32","author":"C. Clos","year":"1953","unstructured":"C. Clos, A study of nonblocking switching networks, The Bell System Technical Journal 32 (1953), 406\u2013424.","journal-title":"The Bell System Technical Journal"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"K. Diks, A. Pelc, Reliable Computations on Faulty EREW PRAM, Theoretical Computer Science, to appear.","DOI":"10.1016\/0304-3975(95)00186-7"},{"key":"17_CR11","first-page":"20","volume-title":"LNCS 678","author":"F. Meyer auf der Heide","year":"1992","unstructured":"F. Meyer auf der Heide, Hashing Strategies for Simulating Shared Memory on Dbtributed Memory Machines, in Proceedings of the 1st Heinz Nixdorf Symposium \u201cParallel Architectures and their Efficient Use,\u201d F. Meyer auf der Heide, B. Monien, A.L. Rosenberg (Eds.), Paderborn, Germany, 1992, Springer LNCS 678, pp. 20\u201329."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"M. L. Fredman, D. E. Willard,\u2019 BLASTING Through The Information Theoretic Bound Using FUSION TREES', Proc. 22nd Ann. ACM Symposium on Theory of Computing (1990).","DOI":"10.1145\/100216.100217"},{"key":"17_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R. G. Gallager","year":"1963","unstructured":"R. G. Gallager, Low-Density Parity-Check Codes, Cambridge, Massachusetts, MIT Press (1963)."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1989\/90","unstructured":"T. Hagerup, Ch. R\u00fcb, A Guided Tour of Chernoff Bounds, Inf. Proc. Letters 33 (1989\/90), 305\u2013308.","journal-title":"Inf. Proc. Letters"},{"key":"17_CR15","unstructured":"J. J\u00e1J\u00e1, \u201dAn Introduction to Parallel Algorithms,\u201d Addison-Wesley (1992)."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"P. Jayanti, T.D. Chandra, S. Toueg, Fault-tolerant Wait-free Shared Objects, Proc. 33rd Ann. Symposium on Foundations of Computer Science (1992), 157\u2013166.","DOI":"10.1109\/SFCS.1992.267776"},{"key":"17_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02277667","volume":"5","author":"P.C. Kanellakis","year":"1992","unstructured":"P.C. Kanellakis, A.A. Shvartsman, Efficient Parallel Algorithms Can Be Made Robust, Distributed Computing, 5 (1992), 201\u2013217.","journal-title":"Distributed Computing"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Z.M. Kedem, K.V. Palem, P.G. Spirakis, Efficient Robust Parallel Computations, Proc. 22nd Ann. ACM Symposium on Theory of Computing (1990), 138\u2013148.","DOI":"10.1145\/100216.100231"},{"key":"17_CR19","unstructured":"F.T. Leighton, \u201dParallel Algorithms and Architectures: Arrays, Trees, Hypercubes,\u201d Morgan Kaufmann (1992)."},{"key":"17_CR20","unstructured":"F.J. MacWilliams, N.J.A Sloane, \u201dThe Theory of Error-Correcting Codes,\u201d North-Holland (1977)."},{"key":"17_CR21","unstructured":"R. Raman, Exploiting the Word-Level Parallelism in Sequential Algorithms, a talk given during the 5th Workshop on Algorithms for Future Technologies ALTEC V, Prague (1995). Also as [2]"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"A. Siegel, On Universal Classes of Fast High Performance Hash Functions, Their Time-Space Trade-off, and Their Applications, Proc. 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 20\u201325.","DOI":"10.1109\/SFCS.1989.63450"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"D. A. Spielman, Linear-Time Encodable and Decodable Error-Correcting Codes, Proc. 27th Annual ACM Symposium on Theory of Computing (1995).","DOI":"10.1145\/225058.225165"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"M. Sipser, D. A. Spielman, Expander Codes, Proc. 35th Annual Symposium on Foundations of Computer Science (1994), 566\u2013576.","DOI":"10.1109\/SFCS.1994.365734"},{"key":"17_CR25","doi-asserted-by":"crossref","first-page":"2299","DOI":"10.1002\/j.1538-7305.1968.tb01087.x","volume":"47","author":"M. G. Taylor","year":"1968","unstructured":"M. G. Taylor, Reliable Information Storage in Memories Designed from Unreliable Components, The Bell System Technical Journal 47 (1968), 2299\u20132337.","journal-title":"The Bell System Technical Journal"},{"key":"17_CR26","doi-asserted-by":"crossref","first-page":"2339","DOI":"10.1002\/j.1538-7305.1968.tb01088.x","volume":"47","author":"M. G. Taylor","year":"1968","unstructured":"M. G. Taylor, Reliable Computation in Computing Systems Designed from Unreliable Components, The Bell System Technical Journal 47 (1968), 2339\u20132366.","journal-title":"The Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","STACS 96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60922-9_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:02:31Z","timestamp":1605628951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60922-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609223","9783540497233"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-60922-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}