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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2178984928 / rank
 
Normal rank
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