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

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

  1. Brief Announcement: Label: en
  2. Brief Announcement: Label: en
  3. Brief Announcement: Label: en
  4. A Distributed Learning Dynamics in Social Groups: Label: en
  5. Clocked Population Protocols: Label: en
  6. Stateless Computation: Label: en
  7. Brief Announcement: Label: en
  8. Brief Announcement: Label: en
  9. Asynchronous Shared Channel: Label: en
  10. Triangle Finding and Listing in CONGEST Networks: Label: en
  11. Greedy Routing and the Algorithmic Small-World Phenomenon: Label: en
  12. Brief Announcement: Label: en
  13. Brief Announcement: Label: en
  14. Brief Announcement: Label: en
  15. Life Beyond Set Agreement: Label: en
  16. Ignore or Comply?: Label: en
  17. Coordination Without Prior Agreement: Label: en
  18. FruitChains: Label: en
  19. A Template for Implementing Fast Lock-free Trees Using HTM: Label: en
  20. The Power of Choice in Priority Scheduling: Label: en
  21. Symmetry Breaking with Noisy Processes: Label: en
  22. Effectiveness of Delaying Timestamp Computation: Label: en
  23. Brief Announcement: Label: en
  24. Brief Announcement: Label: en
  25. Brief Announcement: Label: en
  26. On Using Time Without Clocks via Zigzag Causality: Label: en
  27. Transactional Lock Elision Meets Combining: Label: en
  28. Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model: Label: en
  29. Recoverable Mutual Exclusion in Sub-logarithmic Time: Label: en
  30. Brief Announcement: Label: en
  31. Brief Announcement: Label: en
  32. Brief Announcement: Label: en
  33. Brief Announcement: Label: en
  34. Optimal Distance Labeling Schemes for Trees: Label: en
  35. Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity: Label: en
  36. Distributed Approximation of Maximum Independent Set and Maximum Matching: Label: en
  37. Brief Announcement: Label: en
  38. Distributed MIS via All-to-All Communication: Label: en
  39. Distributed MST and Routing in Almost Mixing Time: Label: en
  40. What Can be Sampled Locally?: Label: en
  41. On the Multiparty Communication Complexity of Testing Triangle-Freeness: Label: en
  42. LCL Problems on Grids: Label: en
  43. Brief Announcement: Label: en
  44. Brief Announcement: Label: en
  45. Brief Announcement: Label: en
  46. Space Complexity of Fault-Tolerant Register Emulations: Label: en
  47. Seeing is Believing: Label: en
  48. A Layered Architecture for Erasure-Coded Consistent Distributed Storage: Label: en
  49. Analyzing Contention and Backoff in Asynchronous Shared Memory: Label: en
  50. Gossip in a Smartphone Peer-to-Peer Network: Label: en

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