{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:28Z","timestamp":1725552328283},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131929"},{"type":"electronic","value":"9783642131936"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13193-6_1","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T11:54:59Z","timestamp":1272369299000},"page":"1-12","source":"Crossref","is-referenced-by-count":5,"title":["Experimental Study of Resilient Algorithms and Data Structures"],"prefix":"10.1007","author":[{"given":"Umberto","family":"Ferraro-Petrillo","sequence":"first","affiliation":[]},{"given":"Irene","family":"Finocchi","sequence":"additional","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Anderson, R., Kuhn, M.: Tamper resistance \u2013 a cautionary note. In: Proc. 2nd Usenix Workshop on Electronic Commerce, pp. 1\u201311 (1996)","key":"1_CR1"},{"doi-asserted-by":"crossref","unstructured":"Anderson, R., Kuhn, M.: Low cost attacks on tamper resistant devices. In: Proc. International Workshop on Security Protocols, pp. 125\u2013136 (1997)","key":"1_CR2","DOI":"10.1007\/BFb0028165"},{"doi-asserted-by":"crossref","unstructured":"Aslam, J.A., Dhagat, A.: Searching in the presence of linearly bounded errors. In: Proc. 23rd STOC, pp. 486\u2013493 (1991)","key":"1_CR3","DOI":"10.1145\/103418.103469"},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0404042","volume":"4","author":"S. Assaf","year":"1991","unstructured":"Assaf, S., Upfal, E.: Fault-tolerant sorting networks. SIAM J. Discrete Math.\u00a04(4), 472\u2013480 (1991)","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"crossref","unstructured":"Aumann, Y., Bender, M.A.: Fault-tolerant data structures. In: Proc. 37th IEEE Symp. on Foundations of Computer Science (FOCS 1996), pp. 580\u2013589 (1996)","key":"1_CR5","DOI":"10.1109\/SFCS.1996.548517"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/978-3-540-45126-6_12","volume-title":"Financial Cryptography","author":"J. Bl\u00f6mer","year":"2003","unstructured":"Bl\u00f6mer, J., Seifert, J.-P.: Fault based cryptanalysis of the Advanced Encryption Standard (AES). In: Wright, R.N. (ed.) FC 2003. LNCS, vol.\u00a02742, pp. 162\u2013181. Springer, Heidelberg (2003)"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 37\u201351. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Borgstrom, R.S., Rao Kosaraju, S.: Comparison based search in the presence of errors. In: Proc. 25th STOC, pp. 130\u2013136 (1993)","key":"1_CR8","DOI":"10.1145\/167088.167129"},{"doi-asserted-by":"crossref","unstructured":"Boyer, R., Moore, S.: MJRTY \u2014 A fast majority vote algorithm. In: Automated Reasoning: Essays in Honor of Woody Bledsoe, pp. 105\u2013118 (1991)","key":"1_CR9","DOI":"10.1007\/978-94-011-3488-0_5"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-75520-3_32","volume-title":"Algorithms \u2013 ESA 2007","author":"G.S. Brodal","year":"2007","unstructured":"Brodal, G.S., Fagerberg, R., Finocchi, I., Grandoni, F., Italiano, G.F., J\u00f8rgensen, A.G., Moruz, G., M\u00f8lhave, T.: Optimal Resilient Dynamic Dictionaries. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 347\u2013358. Springer, Heidelberg (2007)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/978-3-642-10631-6_85","volume-title":"Algorithms and Computation","author":"G.S. Brodal","year":"2009","unstructured":"Brodal, G.S., J\u00f8rgensen, A.G., Moruz, G., M\u00f8lhave, T.: Counting in the presence of memory faults. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 842\u2013851. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Brodal, G.S., J\u00f8rgensen, A.G., M\u00f8lhave, T.: Fault tolerant external memory algorithms. In: Proc. 11th Int. Symposium on Algorithms and Data Structures (WADS 2009), pp. 411\u2013422 (2009)","key":"1_CR12","DOI":"10.1007\/978-3-642-03367-4_36"},{"unstructured":"Caminiti, S., Finocchi, I., Fusco, E.G.: Resilient dynamic programming (2010) (manuscript)","key":"1_CR13"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1007\/3-540-61440-0_161","volume-title":"Automata, Languages and Programming","author":"B.S. Chlebus","year":"1996","unstructured":"Chlebus, B.S., Gambin, A., Indyk, P.: Shared-memory simulations on a faulty-memory DMM. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 586\u2013597. Springer, Heidelberg (1996)"},{"issue":"3-4","key":"1_CR15","first-page":"285","volume":"55","author":"B.S. Chlebus","year":"2003","unstructured":"Chlebus, B.S., Gasieniec, L., Pelc, A.: Deterministic computations on a PRAM with static processor and memory faults. Fundamenta Informaticae\u00a055(3-4), 285\u2013306 (2003)","journal-title":"Fundamenta Informaticae"},{"unstructured":"Dhagat, A., Gacs, P., Winkler, P.: On playing \u201ctwenty questions\u201d with a liar. In: Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms (SODA 1992), pp. 16\u201322 (1992)","key":"1_CR16"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1137\/S0097539791195877","volume":"23","author":"U. Feige","year":"1994","unstructured":"Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. on Comput.\u00a023, 1001\u20131018 (1994)","journal-title":"SIAM J. on Comput."},{"issue":"4","key":"1_CR18","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00453-008-9264-1","volume":"53","author":"U. Ferraro-Petrillo","year":"2009","unstructured":"Ferraro-Petrillo, U., Finocchi, I., Italiano, G.F.: The Price of Resiliency: a Case Study on Sorting with Memory Faults. Algorithmica\u00a053(4), 597\u2013620 (2009)","journal-title":"Algorithmica"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/978-3-642-13193-6_34","volume-title":"SEA 2010","author":"U. Ferraro-Petrillo","year":"2010","unstructured":"Ferraro-Petrillo, U., Grandoni, F., Italiano, G.F.: Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 398\u2013410. Springer, Heidelberg (2010)"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.cosrev.2007.10.001","volume":"1","author":"I. Finocchi","year":"2007","unstructured":"Finocchi, I., Grandoni, F., Italiano, G.F.: Designing reliable algorithms in unreliable memories. Computer Science Review\u00a01(2), 77\u201387 (2007)","journal-title":"Computer Science Review"},{"issue":"44","key":"1_CR21","doi-asserted-by":"publisher","first-page":"4457","DOI":"10.1016\/j.tcs.2009.07.026","volume":"410","author":"I. Finocchi","year":"2009","unstructured":"Finocchi, I., Grandoni, F., Italiano, G.F.: Optimal sorting and searching in the presence of memory faults. Theor. Comput. Sci.\u00a0410(44), 4457\u20134470 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1644015.1644016","volume":"6","author":"I. Finocchi","year":"2009","unstructured":"Finocchi, I., Grandoni, F., Italiano, G.F.: Resilient Search Trees. ACM Transactions on Algorithms\u00a06(1), 1\u201319 (2009)","journal-title":"ACM Transactions on Algorithms"},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00453-007-9088-4","volume":"52","author":"I. Finocchi","year":"2008","unstructured":"Finocchi, I., Italiano, G.F.: Sorting and searching in faulty memories. Algorithmica\u00a052(3), 309\u2013332 (2008)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Govindavajhala, S., Appel, A.W.: Using memory errors to attack a virtual machine. In: Proc. IEEE Symposium on Security and Privacy, pp. 154\u2013165 (2003)","key":"1_CR24","DOI":"10.1109\/SECPRI.2003.1199334"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1022802010738","volume":"19","author":"S. Hamdioui","year":"2003","unstructured":"Hamdioui, S., Al-Ars, Z., van de Goor, J., Rodgers, M.: Dynamic faults in Random-Access-Memories: Concept, faults models and tests. Journal of Electronic Testing: Theory and Applications\u00a019, 195\u2013205 (2003)","journal-title":"Journal of Electronic Testing: Theory and Applications"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Automata, Languages and Programming","author":"M.R. Henzinger","year":"2004","unstructured":"Henzinger, M.R.: The Past, Present, and Future of Web Search Engines. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 3\u20133. Springer, Heidelberg (2004)"},{"unstructured":"Henzinger, M.R.: Combinatorial algorithms for web search engines - three success stories. In: ACM-SIAM Symposium on Discrete Algorithms, SODA (2007) (invited talk)","key":"1_CR27"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TC.1984.1676475","volume":"33","author":"K.H. Huang","year":"1984","unstructured":"Huang, K.H., Abraham, J.A.: Algorithm-based fault tolerance for matrix operations. IEEE Transactions on Computers\u00a033, 518\u2013528 (1984)","journal-title":"IEEE Transactions on Computers"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/3-540-60922-9_17","volume-title":"STACS 96","author":"P. Indyk","year":"1996","unstructured":"Indyk, P.: On word-level parallelism in fault-tolerant computing. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046, pp. 193\u2013204. Springer, Heidelberg (1996)"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-540-73951-7_12","volume-title":"Algorithms and Data Structures","author":"A.G. J\u00f8rgensen","year":"2007","unstructured":"J\u00f8rgensen, A.G., Moruz, G., M\u00f8lhave, T.: Priority queues resilient to memory faults. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 127\u2013138. Springer, Heidelberg (2007)"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","volume":"20","author":"D.J. Kleitman","year":"1980","unstructured":"Kleitman, D.J., Meyer, A.R., Rivest, R.L., Spencer, J., Winklmann, K.: Coping with errors in binary search procedures. J. Comp. Syst. Sci.\u00a020, 396\u2013404 (1980)","journal-title":"J. Comp. Syst. Sci."},{"unstructured":"Kopetz, H.: Mitigation of Transient Faults at the System Level \u2013 the TTA Approach. In: Proc. 2nd Workshop on System Effects of Logic Soft Errors (2006)","key":"1_CR32"},{"issue":"9","key":"1_CR33","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1109\/12.83656","volume":"40","author":"K.B. Lakshmanan","year":"1991","unstructured":"Lakshmanan, K.B., Ravikumar, B., Ganesan, K.: Coping with erroneous information while sorting. IEEE Trans. on Computers\u00a040(9), 1081\u20131084 (1991)","journal-title":"IEEE Trans. on Computers"},{"issue":"1","key":"1_CR34","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0097539796305298","volume":"29","author":"T. Leighton","year":"1999","unstructured":"Leighton, T., Ma, Y.: Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults. SIAM J. on Comput.\u00a029(1), 258\u2013273 (1999)","journal-title":"SIAM J. on Comput."},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/jcss.1997.1470","volume":"54","author":"T. Leighton","year":"1997","unstructured":"Leighton, T., Ma, Y., Plaxton, C.G.: Breaking the \u0398(nlog2 n) barrier for sorting with faults. J. Comp. Syst. Sci.\u00a054, 265\u2013304 (1997)","journal-title":"J. Comp. Syst. Sci."},{"unstructured":"Lu, C., Reed, D.A.: Assessing fault sensitivity in MPI applications. In: Proc. 2004 ACM\/IEEE Conf. on Supercomputing (SC 2004), vol.\u00a037 (2004)","key":"1_CR36"},{"doi-asserted-by":"crossref","unstructured":"May, T.C., Woods, M.H.: Alpha-Particle-Induced Soft Errors In Dynamic Memories. IEEE Trans. Elect. Dev.\u00a026(2) (1979)","key":"1_CR37","DOI":"10.1109\/T-ED.1979.19370"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0304-3975(89)90077-7","volume":"63","author":"A. Pelc","year":"1989","unstructured":"Pelc, A.: Searching with known error probability. Theoretical Computer Science\u00a063, 185\u2013202 (1989)","journal-title":"Theoretical Computer Science"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0304-3975(01)00303-6","volume":"270","author":"A. Pelc","year":"2002","unstructured":"Pelc, A.: Searching games with errors: Fifty years of coping with liars. Theoret. Comp. Sci.\u00a0270, 71\u2013109 (2002)","journal-title":"Theoret. Comp. Sci."},{"unstructured":"Pinheiro, E., Weber, W., Barroso, L.A.: Failure trends in large disk drive populations. In: Proc. 5th USENIX Conference on File and Storage Technologies (2007)","key":"1_CR40"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/3-540-45655-4_47","volume-title":"Computing and Combinatorics","author":"B. Ravikumar","year":"2002","unstructured":"Ravikumar, B.: A fault-tolerant merge sorting algorithm. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 440\u2013447. Springer, Heidelberg (2002)"},{"issue":"3","key":"1_CR42","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.future.2004.11.015","volume":"22","author":"D.A. Reed","year":"2006","unstructured":"Reed, D.A., Lu, C., Mendes, C.L.: Reliability challenges in large systems. Future Gener. Comput. Syst.\u00a022(3), 293\u2013302 (2006)","journal-title":"Future Gener. Comput. Syst."},{"issue":"25","key":"1_CR43","first-page":"1","volume":"7","author":"G.K. Saha","year":"2006","unstructured":"Saha, G.K.: Software based fault tolerance: a survey. Ubiquity\u00a07(25), 1 (2006)","journal-title":"Ubiquity"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-36400-5_2","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"S. Skorobogatov","year":"2003","unstructured":"Skorobogatov, S., Anderson, R.: Optical fault induction attacks. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 2\u201312. Springer, Heidelberg (2003)"},{"unstructured":"Tezzaron Semiconductor. Soft Errors in Electronic Memory \u2013 A White Paper (January 2004) (manuscript), http:\/\/www.tezzaron.com\/about\/papers\/soft_errors_1_1_secure.pdf","key":"1_CR45"},{"key":"1_CR46","volume-title":"Testing semiconductor memories: Theory and practice","author":"A.J. Goor van de","year":"1998","unstructured":"van de Goor, A.J.: Testing semiconductor memories: Theory and practice. ComTex Publishing, Gouda (1998)"},{"key":"1_CR47","first-page":"43","volume-title":"Automata Studies","author":"J. Neumann von","year":"1956","unstructured":"von Neumann, J.: Probabilistic logics and the synthesis of reliable organisms from unreliable components. In: Shannon, C., McCarty, J. (eds.) Automata Studies, pp. 43\u201398. Princeton University Press, Princeton (1956)"},{"doi-asserted-by":"crossref","unstructured":"Xu, J., Chen, S., Kalbarczyk, Z., Iyer, R.K.: An experimental study of security vulnerabilities caused by errors. In: Proc. International Conference on Dependable Systems and Networks, pp. 421\u2013430 (2001)","key":"1_CR48","DOI":"10.1109\/DSN.2001.941426"},{"key":"1_CR49","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/0214009","volume":"14","author":"A.C. Yao","year":"1985","unstructured":"Yao, A.C., Yao, F.F.: On fault-tolerant networks for sorting. SIAM J. on Comput.\u00a014, 120\u2013128 (1985)","journal-title":"SIAM J. on Comput."}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13193-6_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:02:30Z","timestamp":1606186950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}