Tight Bounds for Asynchronous Renaming (Q3189653): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1145/2597630 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057041531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic snapshots of shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-logarithmic Test-and-Set against a Weak Adversary / 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: Fast Randomized Test-and-Set and 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: Counting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming in an asynchronous environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive and efficient mutual exclusion (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for decision problems in the presence of timing uncertainty and failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive and Efficient Algorithms for Lattice Agreement and Renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient adaptive collect using randomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment / 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: Immediate atomic snapshots and fast renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully-Adaptive Algorithms for Long-Lived Renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New combinatorial topology bounds for renaming: the lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: New combinatorial topology bounds for renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-free implementations in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous exclusive selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent weakness of conditional primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extended BG-simulation and the characterization of t-resiliency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizable implementations do not suffice for randomized distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-RMR implementations of CAS and other synchronization primitives using read and write operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized wait-free concurrent objects (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / 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: A time complexity lower bound for adaptive mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Las-Vegas Processor Identity Problem (How and When to Be Unique) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The processor identity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-free algorithms for fast, long-lived renaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong order-preserving renaming in the synchronous message passing model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank

Latest revision as of 00:46, 9 July 2024

scientific article
Language Label Description Also known as
English
Tight Bounds for Asynchronous Renaming
scientific article

    Statements

    Tight Bounds for Asynchronous Renaming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    distributed computing
    0 references
    concurrent data structures
    0 references
    lower bounds
    0 references
    renaming
    0 references
    shared memory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references