Linearizable counting networks (Q5137016): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4763397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coins, weights and contention in balancing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention in shared memory algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient synchronization of multiprocessors with shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new solution of Dijkstra's concurrent programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mutual exclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial treatment of balancing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The serializability of concurrent database updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A steady state analysis of diffracting trees / rank
 
Normal rank

Latest revision as of 03:20, 24 July 2024

scientific article; zbMATH DE number 7279513
Language Label Description Also known as
English
Linearizable counting networks
scientific article; zbMATH DE number 7279513

    Statements

    Linearizable counting networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    data structures
    0 references
    concurrency
    0 references
    contention
    0 references
    linearizability
    0 references
    counting networks
    0 references
    0 references