Bounds on contention management algorithms (Q553351): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Transactional contention management as a non-clairvoyant scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic sums and distributed resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with conflicts: Online and offline algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of transactional contention managers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lazy Snapshot Algorithm with Eager Validation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Contention Management Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring unstructured wireless multi-hop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for distributed symmetry breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Window-Based Greedy Contention Management for Transactional Memory / rank
 
Normal rank

Latest revision as of 08:54, 4 July 2024

scientific article
Language Label Description Also known as
English
Bounds on contention management algorithms
scientific article

    Statements

    Identifiers