Jump to content

Local algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by JL-Bot (talk | contribs) at 02:32, 3 July 2023 (removing orphan template as not a valid orphan). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Local algorithm" – news · newspapers · books · scholar · JSTOR (May 2023)

(Learn how and when to remove this message)

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 (2): 1–40. CiteSeerX 10.1.1.216.1473. doi:10.1145/2431211.2431223. S2CID 6588866.

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Local_algorithm&oldid=1163118539"

Hidden categories: