Local algorithm: Difference between revisions
Content deleted Content added
→top: 10.1145/2431211.2431223 |
|||
| Line 1: | Line 1: | ||
{{Orphan|date=September 2013}} |
{{Orphan|date=September 2013}} |
||
A '''local algorithm''' is a distributed [[algorithm]] that runs in [[constant time]], independently of the size of the network.<ref>{{cite journal|last=Suomela|first=Jukka|title=Survey of Local Algorithms|journal=ACM Computing Surveys|year=2013|doi=10.1145/2431211.2431223}}</ref> |
A '''local algorithm''' is a distributed [[algorithm]] that runs in [[constant time]], independently of the size of the network.<ref>{{cite journal|last=Suomela|first=Jukka|title=Survey of Local Algorithms|journal=ACM Computing Surveys|year=2013|doi=10.1145/2431211.2431223|volume=45|pages=1–40}}</ref> |
||
==References== |
==References== |
||
Revision as of 18:14, 12 December 2017
A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network.[1]
References
- ^ Suomela, Jukka (2013). "Survey of Local Algorithms". ACM Computing Surveys. 45: 1–40. doi:10.1145/2431211.2431223.
 | This computing article is a stub. You can help Wikipedia by expanding it. |