Pages that link to "Item:Q2628795"
From MaRDI portal
The following pages link to New techniques and tighter bounds for local computation algorithms (Q2628795):
Displaying 10 items.
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- Constant-time local computation algorithms (Q1743110) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- Input locality and hardness amplification (Q1946597) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- Constant-Time Local Computation Algorithms (Q2788995) (← links)
- On the probe complexity of local computation algorithms (Q5002725) (← links)
- (Q5090437) (← links)
- A Local Criterion for Polynomial-Time Stratified Computations (Q5747634) (← links)
- Average Sensitivity of Graph Algorithms (Q6046751) (← links)