Pages that link to "Item:Q2943605"
From MaRDI portal
The following pages link to Proceedings of the 2014 ACM symposium on Principles of distributed computing (Q2943605):
Displaying 33 items.
- Signature-free asynchronous byzantine consensus with t < n/3 and o(n <sup>2</sup> ) messages (Q2943606) (← links)
- Asynchronous MPC with a strict honest majority using non-equivocation (Q2943607) (← links)
- Distributing the setup in universally composable multi-party computation (Q2943608) (← links)
- The future(s) of shared data structures (Q2943609) (← links)
- Multi-message broadcast with abstract MAC layers and unreliable links (Q2943610) (← links)
- Consensus with an abstract MAC layer (Q2943611) (← links)
- Linear-in-delta lower bounds in the LOCAL model (Q2943612) (← links)
- Anonymous networks (Q2943614) (← links)
- Beyond set disjointness (Q2943615) (← links)
- Breathe before speaking (Q2943616) (← links)
- Estimation for monotone sampling (Q2943617) (← links)
- Distributed connectivity decomposition (Q2943618) (← links)
- Can quantum communication speed up distributed computation? (Q2943619) (← links)
- Optimal gossip with direct addressing (Q2943620) (← links)
- Complexity tradeoffs for read and update operations (Q2943622) (← links)
- A generalized asynchronous computability theorem (Q2943623) (← links)
- Balls-into-leaves (Q2943624) (← links)
- Trade-offs between selection complexity and performance when searching the plane without communication (Q2943625) (← links)
- Improved distributed steiner forest construction (Q2943626) (← links)
- Spanners and sparsifiers in dynamic streams (Q2943627) (← links)
- How to withstand mobile virus attacks, revisited (Q2943628) (← links)
- Born and raised distributively (Q2943629) (← links)
- Fast and unconditionally secure anonymous channel (Q2943631) (← links)
- Efficient lock-free binary search trees (Q2943632) (← links)
- The amortized complexity of non-blocking binary search trees (Q2943634) (← links)
- Beyond geometry (Q2943635) (← links)
- On the impact of geometry on ad hoc communication in wireless networks (Q2943636) (← links)
- On the power of the congested clique model (Q2943637) (← links)
- Making objects writable (Q2943638) (← links)
- Asynchronous convex hull consensus in the presence of crash faults (Q2943639) (← links)
- Distributed computing building blocks for rational agents (Q2943641) (← links)
- Simple and efficient local codes for distributed stable network construction (Q5892129) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5892130) (← links)
