Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion (Q6202227): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An improved lower bound for the time complexity of mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Approach to Recoverable Mutual Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: RMR-efficient implementations of comparison primitives using read and write operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Mutual Exclusion in Sub-logarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable Mutual Exclusion Under System-Wide Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recoverable mutual exclusion with abortability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast, scalable mutual exclusion algorithm / rank
 
Normal rank

Revision as of 17:05, 28 August 2024

scientific article; zbMATH DE number 7824314
Language Label Description Also known as
English
Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
scientific article; zbMATH DE number 7824314

    Statements

    Identifiers