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

Distributed connectivity decomposition: Label: en
Distributed computing building blocks for rational agents: Label: en
Asynchronous convex hull consensus in the presence of crash faults: Label: en
Making objects writable: Label: en
On the power of the congested clique model: Label: en
On the impact of geometry on ad hoc communication in wireless networks: Label: en
Beyond geometry: Label: en
The amortized complexity of non-blocking binary search trees: Label: en
Efficient lock-free binary search trees: Label: en
Fast and unconditionally secure anonymous channel: Label: en
Born and raised distributively: Label: en
How to withstand mobile virus attacks, revisited: Label: en
Spanners and sparsifiers in dynamic streams: Label: en
Improved distributed steiner forest construction: Label: en
Trade-offs between selection complexity and performance when searching the plane without communication: Label: en
Balls-into-leaves: Label: en
A generalized asynchronous computability theorem: Label: en
Complexity tradeoffs for read and update operations: Label: en
Optimal gossip with direct addressing: Label: en
Can quantum communication speed up distributed computation?: Label: en
Distributed algorithms for the Lovász local lemma and graph coloring: Label: en
Estimation for monotone sampling: Label: en
Breathe before speaking: Label: en
Beyond set disjointness: Label: en
Anonymous networks: Label: en
Linear-in-delta lower bounds in the LOCAL model: Label: en
Consensus with an abstract MAC layer: Label: en
Multi-message broadcast with abstract MAC layers and unreliable links: Label: en
The future(s) of shared data structures: Label: en
Distributing the setup in universally composable multi-party computation: Label: en
Asynchronous MPC with a strict honest majority using non-equivocation: Label: en
Signature-free asynchronous byzantine consensus with t < n/3 and o(n ² ) messages: Label: en
Simple and efficient local codes for distributed stable network construction: Label: en