Constant-Time Local Computation Algorithms
From MaRDI portal
Recommendations
- Constant-time local computation algorithms
- Space-efficient local computation algorithms
- New techniques and tighter bounds for local computation algorithms
- Local computation: lower and upper bounds
- Linear-time parameterized algorithms with limited local resources
- scientific article; zbMATH DE number 4203713
- On the probe complexity of local computation algorithms
- Local computation algorithms for spanners
Cited in
(8)- On the probe complexity of local computation algorithms
- Converting online algorithms to local computation algorithms
- Space-efficient local computation algorithms
- New techniques and tighter bounds for local computation algorithms
- Constant-time local computation algorithms
- scientific article; zbMATH DE number 1837654 (Why is no real title available?)
- Local computation algorithms for spanners
- Local computation algorithms for graphs of non-constant degrees
This page was built for publication: Constant-Time Local Computation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2788995)