{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:40:01Z","timestamp":1737420001436,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540755197"},{"type":"electronic","value":"9783540755203"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75520-3_32","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T03:46:33Z","timestamp":1189741593000},"page":"347-358","source":"Crossref","is-referenced-by-count":21,"title":["Optimal Resilient Dynamic Dictionaries"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Fagerberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irene","family":"Finocchi","sequence":"additional","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"}]},{"given":"Allan Gr\u00f8nlund","family":"J\u00f8rgensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Moruz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"M\u00f8lhave","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Aslam, J.A., Dhagat, A.: Searching in the presence of linearly bounded errors. In: ACM STOC 1991, pp. 486\u2013493","DOI":"10.1145\/103418.103469"},{"issue":"4","key":"32_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":"32_CR3","doi-asserted-by":"crossref","unstructured":"Aumann, Y., Bender, M.A.: Fault-tolerant data structures. In: IEEE FOCS 1996, pp. 580\u2013589","DOI":"10.1109\/SFCS.1996.548517"},{"key":"32_CR4","unstructured":"Blum, M., Evans, W., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. In: IEEE FOCS 1991"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Borgstrom, R.S., Rao Kosaraju, S.: Comparison based search in the presence of errors. In: ACM STOC 1993, pp. 130\u2013136.","DOI":"10.1145\/167088.167129"},{"key":"32_CR6","unstructured":"Boyer, R., Moore., S.: MJRTY: - A fast majority vote algorithm. University of Texas Tech. Report (1982)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Fagerberg, R., Jacob, R.: Cache-oblivious search trees via binary trees of small height. ACM-SIAM SODA 2002, 39\u201348","DOI":"10.7146\/brics.v8i36.21696"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Fagerberg, R., Jacob, R.: Cache-oblivious search trees via trees of small height. Technical Report ALCOMFT-TR-02-53, ALCOM-FT (May 2002)","DOI":"10.7146\/brics.v8i36.21696"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Gambin, A., Indyk, P.: Shared-memory simulations on a faulty-memory DMM. In: ICALP 1996, pp. 586\u2013597","DOI":"10.1007\/3-540-61440-0_161"},{"issue":"4","key":"32_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MM.2003.1225959","volume":"23","author":"C. Constantinescu","year":"2003","unstructured":"Constantinescu, C.: Trends and challenges in VLSI circuit reliability. IEEE micro\u00a023(4), 14\u201319 (2003)","journal-title":"IEEE micro"},{"key":"32_CR11","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press\/McGraw-Hill Book Company (2001)"},{"key":"32_CR12","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":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1007\/11841036_68","volume-title":"Algorithms \u2013 ESA 2006","author":"U.F. Petrillo","year":"2006","unstructured":"Petrillo, U.F., Finocchi, I., Italiano, G.F.: The price of resiliency: a case study on sorting with memory faults. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 768\u2013779. Springer, Heidelberg (2006)"},{"key":"32_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/11786986_26","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, pp. 286\u2013298. Springer, Heidelberg (2006)"},{"key":"32_CR15","unstructured":"Finocchi, I., Grandoni, F., Italiano, G.: Resilient search trees. In: ACM-SIAM SODA 2007, pp. 547\u2013555."},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Finocchi, I., Italiano, G.F.: Sorting and searching in faulty memories. Algorithmica ACM STOC 2004, pp. 101\u2013110 (extended abstract) (to appear)","DOI":"10.1145\/1007352.1007375"},{"key":"32_CR17","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. Journal of Electronic Testing: Theory and Applications\u00a019, 195\u2013205 (2003)","journal-title":"Journal of Electronic Testing: Theory and Applications"},{"key":"32_CR18","unstructured":"Henzinger, M.R.: Combinatorial algorithms for web search engines - three success stories. In: ACM-SIAM SODA 2007 (invited talk)"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"WADS 2007","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, Springer, Heidelberg (2007)"},{"key":"32_CR20","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. Journal of Computer and System Sciences\u00a020, 396\u2013404 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"32_CR21","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":"32_CR22","doi-asserted-by":"crossref","unstructured":"May, T.C., Woods, M.H.: Alpha-particle-induced soft errors in dynamic memories. IEEE Transactions on Electron Devices\u00a026(2) (1979)","DOI":"10.1109\/T-ED.1979.19370"},{"key":"32_CR23","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":"32_CR24","unstructured":"Tezzaron Semiconductor. Soft errors in electronic memory - a white paper (2004), http:\/\/www.tezzaron.com\/about\/papers\/papers.html"},{"key":"32_CR25","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 Journal on Computing\u00a014, 120\u2013128 (1985)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75520-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:01:26Z","timestamp":1737417686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75520-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540755197","9783540755203"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75520-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}