Pages that link to "Item:Q2220402"
From MaRDI portal
The following pages link to Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402):
Displaying 6 items.
- A note on improved results for one round distributed clique listing (Q2681399) (← links)
- The Communication Complexity of Set Intersection and Multiple Equality Testing (Q5858651) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)
- Lower bound for constant-size local certification (Q6155248) (← links)
- Improved hardness of approximation of diameter in the CONGEST model (Q6535016) (← links)
- Deterministic near-optimal distributed listing of cliques (Q6658820) (← links)