Local algorithm: Difference between revisions

Revision as of 17:54, 24 September 2013

Latest revision as of 23:33, 14 September 2024

(18 intermediate revisions by 14 users not shown)

Line 1:

{{Short description|Type of distributed algorithm}}

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 (CSUR)|year=2013}}</ref>.

{{One source|date=May 2023}}

== References ==

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 (CSUR)|year=2013|doi=10.1145/2431211.2431223|volume=45|issue=2|pages=1–40|citeseerx=10.1.1.216.1473|s2cid=6588866}}</ref>.

== References ==

{{Reflist}}

[[Category:Distributed algorithms]]

{{algorithm-stub}}