Entity usage

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 26 results in range #1 to #26.

Fast distributed construction of k-dominating sets and applications: Label: en
Optimal distributed algorithm for minimum spanning trees revisited: Label: en
Memory requirement for universal routing schemes: Label: en
Lock-free linked lists using compare-and-swap: Label: en
Software transactional memory: Label: en
Long-lived renaming made fast: Label: en
Universal constructions for multi-object operations: Label: en
Formal verification of timed properties of randomized distributed algorithms: Label: en
Formal semantics for expressing optimism: Label: en
Knowledge-based programs: Label: en
Reasoning about meta level activities in open distributed systems: Label: en
Lower bounds for convergence function based clock synchronization: Label: en
Achieving independence efficiently and securely: Label: en
Crumbling walls: Label: en
More on t-resilience vs. wait-freedom (extended abstract): Label: en
Failure detectors and the wait-free hierarchy (extended abstract): Label: en
Algebraic spans: Label: en
A framework for protocol composition in Horus: Label: en
On the relevance of communication costs of rollback-recovery protocols: Label: en
On distributed object checkpointing and recovery: Label: en
Collecting cyclic distributed garbage by controlled migration: Label: en
Distributed dynamic channel allocation for mobile computing: Label: en
Faster computation on directed networks of automata: Label: en
Sub-linear distributed algorithms for sparse certificates and biconnected components: Label: en
Fault-local distributed mending (extended abstract): Label: en
Issues in distributed control for ATM networks: Label: en