Optimal Resilient Dynamic Dictionaries
From MaRDI portal
Publication:3527225
DOI10.1007/978-3-540-75520-3_32zbMath1151.68384OpenAlexW1779795042MaRDI QIDQ3527225
Thomas Mølhave, Rolf Fagerberg, Irene Finocchi, Allan Grønlund Jørgensen, Gabriel Moruz, Giuseppe F. Italiano, Fabrizio Grandoni, Gerth Stølting Brodal
Publication date: 25 September 2008
Published in: Algorithms – ESA 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75520-3_32
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (9)
Fault Tolerant External Memory Algorithms ⋮ Resilient level ancestor, bottleneck, and lowest common ancestor queries in dynamic trees ⋮ Designing reliable algorithms in unreliable memories ⋮ Searching a Tree with Permanently Noisy Advice ⋮ Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting ⋮ Resilient dynamic programming ⋮ Resilient Dictionaries for Randomly Unreliable Memory ⋮ The price of resiliency: a case study on sorting with memory faults ⋮ Optimal resilient sorting and searching in the presence of memory faults
This page was built for publication: Optimal Resilient Dynamic Dictionaries
