Pages that link to "Item:Q2790098"
From MaRDI portal
The following pages link to Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 (Q2790098):
Displaying 20 items.
- Competitive dynamic bandwidth allocation (Q2790099) (← links)
- Contention in balancing networks resolved (extended abstract) (Q2790101) (← links)
- Asynchronous group mutual exclusion (extended abstract) (Q2790102) (← links)
- Amortizing randomness in private multiparty computations (Q2790103) (← links)
- Universal service-providers for database private information retrieval (extended abstract) (Q2790104) (← links)
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography (Q2790105) (← links)
- Optimal efficiency of optimistic contract signing (Q2790106) (← links)
- The unified structure of consensus (Q2790107) (← links)
- Unifying synchronous and asynchronous message-passing models (Q2790108) (← links)
- Round-by-round fault detectors (extended abstract) (Q2790109) (← links)
- The message classification model (Q2790110) (← links)
- Reliable message delivery and conditionally-fast transactions are not possible without accurate clocks (Q2790111) (← links)
- Synthesis of fault-tolerant concurrent programs (Q2790112) (← links)
- A lower bound on the local time complexity of universal constructions (Q2790113) (← links)
- A tight lower bound for randomized synchronous consensus (Q2790114) (← links)
- A time complexity lower bound for randomized implementations of some shared objects (Q2790115) (← links)
- Consensus numbers of multi-objects (Q2790116) (← links)
- Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract) (Q2790117) (← links)
- A polylog time wait-free construction for closed objects (Q2790119) (← links)
- Structured derivations of consensus algorithms for failure detectors (Q2790120) (← links)
