{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:23:44Z","timestamp":1725600224678},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_21","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:41:31Z","timestamp":1312879291000},"page":"243-254","source":"Crossref","is-referenced-by-count":2,"title":["Lossless Fault-Tolerant Data Structures with Additive Overhead"],"prefix":"10.1007","author":[{"given":"Paul","family":"Christiano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik D.","family":"Demaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaunak","family":"Kishore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Alstrup, S., Husfeldt, T., Rauhe, T.: Marked ancestor problems. In: Proc. 39th Annual Symposium on Foundations of Computer Science, pp. 534\u2013543 (1998)","key":"21_CR1","DOI":"10.1109\/SFCS.1998.743504"},{"doi-asserted-by":"crossref","unstructured":"Aumann, Y., Bender, M.A.: Fault tolerant data structures. In: Proc. 37th Annual Symposium on Foundations of Computer Science, pp. 580\u2013589 (1996)","key":"21_CR2","DOI":"10.1109\/SFCS.1996.548517"},{"key":"21_CR3","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)"},{"unstructured":"Chiang, Y.-J., Goodrich, M.T., Grove, E.F., Tamassia, R., Vengroff, D.E., Vitter, J.S.: External-memory graph algorithms. In: Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 139\u2013149 (1995)","key":"21_CR4"},{"issue":"9","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1109\/5.163409","volume":"80","author":"Y.-J. Chiang","year":"1992","unstructured":"Chiang, Y.-J., Tamassia, R.: Dynamic algorithms in computational geometry. Proc. IEEE\u00a080(9), 1412\u20131434 (1992)","journal-title":"Proc. IEEE"},{"unstructured":"de Wolf, R.: Error-correcting data structure. In: Proc. 26th International Symposium on Theoretical Aspects of Computer Science, pp. 313\u2013324 (February 2009)","key":"21_CR6"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M. Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. J. ACM\u00a047, 987\u20131011 (2000)","journal-title":"J. ACM"},{"unstructured":"Finocchi, I., Grandoni, F., Italiano, G.F.: Resilient search trees. In: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 547\u2013553 (2007)","key":"21_CR8"},{"issue":"44","key":"21_CR9","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 resilient sorting and searching in the presence of memory faults. Theoretical Computer Science\u00a0410(44), 4457\u20134470 (2009)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Finocchi, I., Grandoni, F., Italiano, G.F.: Resilient dictionaries. ACM Transactions on Algorithms\u00a06(1) (2009)","key":"21_CR10","DOI":"10.1145\/1644015.1644016"},{"issue":"3","key":"21_CR11","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"},{"unstructured":"Li, X., Shen, K., Huang, M.C., Chu, L.: A memory soft error measurement on production systems. In: Proc. 2007 USENIX Annual Technical Conference, pp. 21:1\u201321:6 (2007)","key":"21_CR12"},{"issue":"6","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"D.A. Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory\u00a042(6), 1723\u20131732 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"unstructured":"Tezzaron Semiconductor. Soft errors in electronic memory. White paper (January 2004), \n                  \n                    http:\/\/www.tezzaron.com\/about\/papers\/soft_errors_1_1_secure.pdf","key":"21_CR14"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T03:09:31Z","timestamp":1554001771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}