Pages that link to "Item:Q5361387"
From MaRDI portal
The following pages link to Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Q5361387):
Displaying 36 items.
- Reconciliations (Q5361388) (← links)
- Repeatable and portable message-passing programs (Q5361389) (← links)
- Making operations of concurrent data types fast (Q5361390) (← links)
- Delimiting the power of bounded size synchronization objects (extended abstract) (Q5361391) (← links)
- Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract) (Q5361392) (← links)
- Contention---free complexity of shared memory algorithms (Q5361393) (← links)
- Using belief to reason about cache coherence (Q5361395) (← links)
- Open systems in TLA (Q5361396) (← links)
- ENF event predicate detection in distributed systems (Q5361399) (← links)
- Mixed consistency (Q5361400) (← links)
- Global flush communication primitive for inter-process communication (Q5361401) (← links)
- A checkpoint protocol for an entry consistent shared memory system (Q5361402) (← links)
- A performance evaluation of lock-free synchronization protocols (Q5361403) (← links)
- Using <i>k</i>-exclusion to implement resilient, scalable shared objects (extended abstract) (Q5361404) (← links)
- Disjoint-access-parallel implementations of strong shared memory primitives (Q5361405) (← links)
- Time-optimal message-efficient work performance in the presence of faults (Q5361406) (← links)
- Resilience of general interactive tasks (Q5361407) (← links)
- Asynchronous secure computations with optimal resilience (extended abstract) (Q5361409) (← links)
- Coins, weights and contention in balancing networks (Q5361410) (← links)
- A combinatorial treatment of balancing networks (Q5361411) (← links)
- A characterization of networks supporting linear interval routing (Q5361412) (← links)
- Potential function analysis of greedy hot-potato routing (Q5361413) (← links)
- The virtual path layout problem in fast networks (extended abstract) (Q5361414) (← links)
- Self-stabilization by counter flushing (Q5361415) (← links)
- Memory-efficient and self-stabilizing network RESET (extended abstract) (Q5361416) (← links)
- Adaptive algorithms for PASO systems (Q5361417) (← links)
- Uniform actions in asynchronous distributed systems (Q5361418) (← links)
- Observable clock synchronization extended abstract (Q5361419) (← links)
- Knowledge, timed precedence and clocks (preliminary report) (Q5361421) (← links)
- A formally verified algorithm for clock synchronization under a hybrid fault model (Q5361422) (← links)
- Proving time bounds for randomized distributed algorithms (Q5361423) (← links)
- Set consensus using arbitrary objects (preliminary version) (Q5361424) (← links)
- Wait-freedom vs. <i>t</i>-resiliency and the robustness of wait-free hierarchies (extended abstract) (Q5361425) (← links)
- A gap theorem for consensus types extended abstract (Q5361426) (← links)
- On the use of registers in achieving wait-free consensus (Q5361427) (← links)
- Consensus power makes (some) sense! (extended abstract) (Q5361428) (← links)
