Designing reliable algorithms in unreliable memories (Q458451)

From MaRDI portal
Revision as of 03:37, 9 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Designing reliable algorithms in unreliable memories
scientific article

    Statements

    title
    Designing reliable algorithms in unreliable memories (English)
    0 references
    author
    Irene Finocchi
    0 references
    Fabrizio Grandoni
    0 references
    Giuseppe F. Italiano
    0 references
    publication date
    7 October 2014
    0 references
    zbMATH Keywords
    resilient searching
    0 references
    resilient sorting
    0 references
    resilient search trees
    0 references
    resilient priority queues
    0 references
    cites work
    Q4387320
    0 references
    Q4828913
    0 references
    Q4818868
    0 references
    Q4432962
    0 references
    Q2747613
    0 references
    Q4763384
    0 references
    Q2934637
    0 references
    Q2934695
    0 references
    Q3128931
    0 references
    Q4808665
    0 references
    Q4425683
    0 references
    Q4121861
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P10
    0 references
    68P05
    0 references
    68-02
    0 references
    zbMATH DE Number
    6352084
    0 references
    Wikidata QID
    Q61609562
    0 references
    OpenAlex ID
    W2140026235
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q458451&oldid=35414784"
    Powered by MediaWiki