The following pages link to (Q5743464):
Displayed 13 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)
- Local algorithms for sparse spanning graphs (Q2300722) (← links)
- New techniques and tighter bounds for local computation algorithms (Q2628795) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- (Q5002725) (← links)
- (Q5002766) (← links)
- (Q5090437) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- (Q5743464) (← links)
- Average Sensitivity of Graph Algorithms (Q6046751) (← links)
- Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics (Q6076330) (← links)