Entity usage
From MaRDI portal
This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.
Showing below up to 20 results in range #1 to #20.
- Structured derivations of consensus algorithms for failure detectors: Label: en
- A polylog time wait-free construction for closed objects: Label: en
- Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract): Label: en
- Consensus numbers of multi-objects: Label: en
- A time complexity lower bound for randomized implementations of some shared objects: Label: en
- A tight lower bound for randomized synchronous consensus: Label: en
- A lower bound on the local time complexity of universal constructions: Label: en
- Synthesis of fault-tolerant concurrent programs: Label: en
- Reliable message delivery and conditionally-fast transactions are not possible without accurate clocks: Label: en
- The message classification model: Label: en
- Round-by-round fault detectors (extended abstract): Label: en
- Unifying synchronous and asynchronous message-passing models: Label: en
- The unified structure of consensus: Label: en
- Optimal efficiency of optimistic contract signing: Label: en
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography: Label: en
- Universal service-providers for database private information retrieval (extended abstract): Label: en
- Amortizing randomness in private multiparty computations: Label: en
- Asynchronous group mutual exclusion (extended abstract): Label: en
- Contention in balancing networks resolved (extended abstract): Label: en
- Competitive dynamic bandwidth allocation: Label: en
