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.

List of pages that use a given entity

Showing below up to 26 results in range #1 to #26.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Toward a theory of maximally concurrent programs (shortened version): Label: en
  2. Stability of long-lived consensus (extended abstract): Label: en
  3. Fast deterministic consensus in a noisy environment: Label: en
  4. Indulgent algorithms (preliminary version): Label: en
  5. Efficient generation of all regular non-dominated coteries: Label: en
  6. Resettable vector clocks: Label: en
  7. Stable and fault-tolerant object allocation: Label: en
  8. Self-stabilizing token circulation on asynchronous uniform unidirectional rings: Label: en
  9. Debugging distributed programs using controlled re-execution: Label: en
  10. X-ability: Label: en
  11. Efficient atomic broadcast using deterministic merge: Label: en
  12. Distributed reconfiguration of metamorphic robot chains: Label: en
  13. On the interconnection of causal memory systems: Label: en
  14. k-set agreement with limited accuracy failure detectors: Label: en
  15. Clock synchronization with faults and recoveries (extended abstract): Label: en
  16. Random oracles in constantipole: Label: en
  17. The wakeup problem in synchronous broadcast systems (extended abstract): Label: en
  18. Assigning labels in unknown anonymous networks (extended abstract): Label: en
  19. Adaptive and efficient mutual exclusion (extended abstract): Label: en
  20. Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract): Label: en
  21. Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract): Label: en
  22. Compact roundtrip routing in directed networks (extended abstract): Label: en
  23. Sparse communication networks and efficient routing in the plane (extended abstract): Label: en
  24. Average-case analysis of greedy packet scheduling (extended astract): Label: en
  25. Optimal smoothing schedules for real-time streams (extended abstract): Label: en
  26. Interval routing schemes allow broadcasting with linear message-complexity (extended abstract): Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)