{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:05:46Z","timestamp":1725552346251},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_34","type":"book-chapter","created":{"date-parts":[[2010,4,27]],"date-time":"2010-04-27T07:54:59Z","timestamp":1272354899000},"page":"398-410","source":"Crossref","is-referenced-by-count":4,"title":["Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries"],"prefix":"10.1007","author":[{"given":"Umberto","family":"Ferraro-Petrillo","sequence":"first","affiliation":[]},{"given":"Fabrizio","family":"Grandoni","sequence":"additional","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Aslam, J.A., Dhagat, A.: Searching in the presence of linearly bounded errors. In: STOC, pp. 486\u2013493 (1991)","DOI":"10.1145\/103418.103469"},{"issue":"4","key":"34_CR2","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":"34_CR3","doi-asserted-by":"crossref","unstructured":"Aumann, Y., Bender, M.A.: Fault-tolerant data structures. In: FOCS, pp. 580\u2013589 (1996)","DOI":"10.1109\/SFCS.1996.548517"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Borgstrom, R.S., Rao Kosaraju, S.: Comparison based search in the presence of errors. In: STOC, pp. 130\u2013136 (1993)","DOI":"10.1145\/167088.167129"},{"key":"34_CR5","unstructured":"Boyer, R., Moore, S.: MJRTY - A fast majority vote algorithm. University of Texas Tech. Report (1982)"},{"key":"34_CR6","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., Jorgensen, A.G., Moruz, G., Molhave, 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":"34_CR7","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)"},{"key":"34_CR8","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. Comput.\u00a023, 1001\u20131018 (1994)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"34_CR9","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"},{"issue":"44","key":"34_CR10","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."},{"key":"34_CR11","unstructured":"Finocchi, I., Grandoni, F., Italiano, G.F.: Resilient search trees. In: SODA, pp. 547\u2013553 (2007)"},{"issue":"2","key":"34_CR12","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":"3","key":"34_CR13","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"},{"key":"34_CR14","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., de Goor, J.V., Rodgers, M.: Dynamic faults in random-access-memories: Concept, faults models and tests. J. of Electronic Testing: Theory and Applications\u00a019, 195\u2013205 (2003)","journal-title":"J. of Electronic Testing: Theory and Applications"},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Automata, Languages and Programming","author":"M. Henzinger","year":"2004","unstructured":"Henzinger, M.: 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, p. 3. Springer, Heidelberg (2004)"},{"key":"34_CR16","unstructured":"Henzinger, M.R.: Combinatorial algorithms for web search engines - three success stories. In: SODA (2007) (invited talk)"},{"key":"34_CR17","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":"34_CR18","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. Comput.\u00a029(1), 258\u2013273 (1999)","journal-title":"SIAM J. Comput."},{"key":"34_CR19","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)","DOI":"10.1109\/T-ED.1979.19370"},{"key":"34_CR20","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":"34_CR21","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_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:02:38Z","timestamp":1606168958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13193-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131929","9783642131936"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13193-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}