The computability of relaxed data structures: queues and stacks as examples (Q518927)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The computability of relaxed data structures: queues and stacks as examples
scientific article

    Statements

    The computability of relaxed data structures: queues and stacks as examples (English)
    0 references
    0 references
    0 references
    4 April 2017
    0 references
    relaxed data structure
    0 references
    consensus number
    0 references
    synchronization
    0 references
    wait-freedom
    0 references
    queue
    0 references
    stack
    0 references
    multiset
    0 references
    \(k\)-register
    0 references

    Identifiers