Pages that link to "Item:Q3460729"
From MaRDI portal
The following pages link to Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729):
Displaying 5 items.
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Fooling views: a new lower bound technique for distributed computations under congestion (Q2220402) (← links)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
