Pages that link to "Item:Q2382670"
From MaRDI portal
The following pages link to Two absolute bounds for distributed bit complexity (Q2382670):
Displaying 6 items.
- On the bit complexity of distributed computations in a ring with a leader (Q1098291) (← links)
- Bit complexity of order statistics on a distributed star network (Q1116337) (← links)
- Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds (Q1741851) (← links)
- Exact communication costs for consensus and leader in a tree (Q1827285) (← links)
- Toward computability of trace distance discord (Q3387982) (← links)
- Structural Information and Communication Complexity (Q5710078) (← links)