Jump to content

Local algorithm

From Wikipedia, the free encyclopedia

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

References

[edit]
  1. ^ Suomela, Jukka (2013). "Survey of Local Algorithms". ACM Computing Surveys. 45 (2): 1–40. CiteSeerX 10.1.1.216.1473. doi:10.1145/2431211.2431223. S2CID 6588866.