The price of resiliency: a case study on sorting with memory faults (Q1016529): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q61609544, #quickstatements; #temporary_batch_1711574657256
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4387320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault Tolerant Sorting Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison-based search in the presence of errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Resilient Dynamic Dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with Noisy Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Resiliency: A Case Study on Sorting with Memory Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and searching in faulty memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing reliable algorithms in unreliable memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Resilient Sorting and Searching in the Presence of Memory Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On word-level parallelism in fault-tolerant computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Queues Resilient to Memory Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coping with errors in binary search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching with known error probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching games with errors -- fifty years of coping with liars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5481416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4425683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fault-Tolerant Networks for Sorting / rank
 
Normal rank

Latest revision as of 12:44, 1 July 2024

scientific article
Language Label Description Also known as
English
The price of resiliency: a case study on sorting with memory faults
scientific article

    Statements

    The price of resiliency: a case study on sorting with memory faults (English)
    0 references
    0 references
    0 references
    0 references
    6 May 2009
    0 references
    sorting
    0 references
    memory faults
    0 references
    memory models
    0 references
    fault injection
    0 references
    computing with unreliable information
    0 references
    experimental algorithmics
    0 references
    0 references
    0 references

    Identifiers