{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:52:48Z","timestamp":1761292368160},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_68","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"768-779","source":"Crossref","is-referenced-by-count":14,"title":["The Price of Resiliency: A Case Study on Sorting with Memory Faults"],"prefix":"10.1007","author":[{"given":"Umberto","family":"Ferraro-Petrillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irene","family":"Finocchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"68_CR1","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."},{"key":"68_CR2","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)","DOI":"10.1145\/167088.167129"},{"key":"68_CR3","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23","author":"C.R. Cook","year":"1980","unstructured":"Cook, C.R., Kim, D.J.: Best sorting algorithms for nearly sorted lists. Comm. of the ACM\u00a023, 620\u2013624 (1980)","journal-title":"Comm. of the ACM"},{"key":"68_CR4","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."},{"key":"68_CR5","doi-asserted-by":"crossref","unstructured":"Finocchi, I., Italiano, G.F.: Sorting and searching in the presence of memory faults (without redundancy). In: Proc. 36th STOC, pp. 101\u2013110 (2004)","DOI":"10.1145\/1007352.1007375"},{"key":"68_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"I. Finocchi","year":"2006","unstructured":"Finocchi, I., Grandoni, F., Italiano, G.F.: Optimal sorting and searching in the presence of memory faults. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052. Springer, Heidelberg (2006)"},{"key":"68_CR7","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."},{"issue":"1","key":"68_CR8","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":"68_CR9","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."},{"key":"68_CR10","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)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:16:59Z","timestamp":1619507819000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11841036_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}