Jump to content

Local algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Headbomb (talk | contribs) at 18:25, 13 March 2016 (top: clean up, replaced: ACM Computing Surveys (CSUR) → ACM Computing Surveys using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A local algorithm is a distributed algorithm that runs in constant time, independently of the size of the network.[1]

References

  1. ^ Suomela, Jukka (2013). "Survey of Local Algorithms". ACM Computing Surveys.