{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:41Z","timestamp":1725472061654},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_26","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"286-298","source":"Crossref","is-referenced-by-count":21,"title":["Optimal Resilient Sorting and Searching in the Presence of Memory Faults"],"prefix":"10.1007","author":[{"given":"Irene","family":"Finocchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Grandoni","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":"26_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":"26_CR2","doi-asserted-by":"crossref","unstructured":"Aumann, Y., Bender, M.A.: Fault-tolerant data structures. In: Proc. 37th IEEE Symp. on Foundations of Computer Science, pp. 580\u2013589 (1996)","DOI":"10.1109\/SFCS.1996.548517"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Borgstrom, R.S., Kosaraju, S.R.: Comparison based search in the presence of errors. In: Proc. 25th ACM Symp. on Theory of Computing, pp. 130\u2013136 (1993)","DOI":"10.1145\/167088.167129"},{"key":"26_CR4","unstructured":"Boyer, R., Moore., S.: MJRTY - A fast majority vote algorithm. University of Texas Tech. Report (1982)"},{"key":"26_CR5","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. Fund. Informaticae\u00a055, 285\u2013306 (2003)","journal-title":"Fund. Informaticae"},{"key":"26_CR6","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 Journal on Computing\u00a023, 1001\u20131018 (1994)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Finocchi, I., Italiano, G.F.: Sorting and searching in the presence of memory faults (without redundancy). In: Proc. 36th ACM Symp. on Theory of Computing, pp. 101\u2013110 (2004)","DOI":"10.1145\/1007352.1007375"},{"key":"26_CR8","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":"26_CR9","doi-asserted-by":"crossref","unstructured":"Henzinger, M.: The past, present and future of Web Search Engines. In: 31st Int. Coll. Automata, Languages and Programming, pp. 12\u201316 (2004)","DOI":"10.1007\/978-3-540-27836-8_2"},{"issue":"1","key":"26_CR10","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 Journal on Computing\u00a029(1), 258\u2013273 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"26_CR11","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. Theoretical Computer Science\u00a0270, 71\u2013109 (2002)","journal-title":"Theoretical Computer Science"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Skorobogatov, S., Anderson, R.: Optical fault induction attacks. In: Proc. 4th Int. Workshop on Cryptographic Hardware and Embedded Systems, pp. 2\u201312 (2002)","DOI":"10.1007\/3-540-36400-5_2"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:46Z","timestamp":1619507986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11786986_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}