Jump to content

Local algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Rjwilmsi (talk | contribs) at 18:14, 12 December 2017 (top: Journal cites:, using AWB (12158)). 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. 45: 1–40. doi:10.1145/2431211.2431223.