Strong order-preserving renaming in the synchronous message passing model (Q708233): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Michael S. Okun / rank
Normal rank
 
Property / author
 
Property / author: Michael S. Okun / rank
 
Normal rank
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.06.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964746194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming in an asynchronous environment / 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: Q2766870 / 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: Q4398822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hybrid fault models for asynchronous approximate agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting omissive faults in synchronous approximate agreement / 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: 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: Wait-free implementations in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching approximate agreement in the presence of faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous approximate agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Electing a leader in a synchronous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / 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: Renaming in Message Passing Systems with Byzantine Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming in synchronous message passing systems with Byzantine failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new fault-tolerant algorithm for clock synchronization / rank
 
Normal rank

Latest revision as of 08:11, 3 July 2024

scientific article
Language Label Description Also known as
English
Strong order-preserving renaming in the synchronous message passing model
scientific article

    Statements

    Strong order-preserving renaming in the synchronous message passing model (English)
    0 references
    11 October 2010
    0 references
    0 references
    renaming
    0 references
    approximate agreement
    0 references
    wait-free computation
    0 references
    crash failures
    0 references
    message passing systems
    0 references
    0 references
    0 references