Lower Bounds for Restricted-Use Objects (Q2812146): 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.1137/130905022 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2188999098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal-time adaptive strong renaming, with applications to counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic concurrent data structures from monotone circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster than optimal snapshots (for a while) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Restricted-Use Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate shared-memory counting despite a strong adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of obstruction-free implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mutual Exclusion with O(log^2 Log n) Amortized Work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention in shared memory algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the space complexity of randomized synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time complexity lower bound for randomized implementations of some shared objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Space Lower Bounds for Nonblocking Implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank

Latest revision as of 04:45, 12 July 2024

scientific article
Language Label Description Also known as
English
Lower Bounds for Restricted-Use Objects
scientific article

    Statements

    Lower Bounds for Restricted-Use Objects (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    concurrent objects
    0 references
    lower bounds
    0 references
    restricted-use objects
    0 references
    perturbable objects
    0 references
    0 references