Local algorithm - Revision history

Jlwoodwa: +link Distributed algorithm

2024-09-14T23:33:06Z

← Previous revision		Revision as of 23:33, 14 September 2024
Line 1:		Line 1:
	{{Short description\|Type of distributed algorithm}}		{{Short description\|Type of distributed algorithm}}
	{{One source\|date=May 2023}}		{{One source\|date=May 2023}}
	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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>

	==References==		==References==

Jlwoodwa: Adding short description: "Type of distributed algorithm"

2024-09-14T23:31:57Z

Adding short description: "Type of distributed algorithm"

← Previous revision		Revision as of 23:31, 14 September 2024
Line 1:		Line 1:
			{{Short description\|Type of distributed algorithm}}
	{{One source\|date=May 2023}}		{{One source\|date=May 2023}}
	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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>

Cewbot: Normalize {{Multiple issues}}: Remove {{Issues}} for only 1 maintenance template: One source

2023-07-07T06:36:07Z

Normalize {{Multiple issues}}: Remove {{Issues}} for only 1 maintenance template: One source

← Previous revision		Revision as of 06:36, 7 July 2023
Line 1:		Line 1:
	{{Issues\|
	{{One source\|date=May 2023}}		{{One source\|date=May 2023}}
	}}
	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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>

JL-Bot: removing orphan template as not a valid orphan

2023-07-03T02:32:42Z

removing orphan template as not a valid orphan

← Previous revision		Revision as of 02:32, 3 July 2023
Line 1:		Line 1:
	{{Issues\|		{{Issues\|
	{{One source\|date=May 2023}}		{{One source\|date=May 2023}}
	{{Orphan\|date=September 2013}}
	}}		}}
	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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>

JoeNMLC: ce, add one source tag

2023-05-16T14:40:59Z

ce, add one source tag

← Previous revision		Revision as of 14:40, 16 May 2023
Line 1:		Line 1:
			{{Issues\|
			{{One source\|date=May 2023}}
	{{Orphan\|date=September 2013}}		{{Orphan\|date=September 2013}}
			}}

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

Citation bot: Add: s2cid. | Use this bot. Report bugs. | Suggested by Abductive | Category:Algorithms and data structures stubs | #UCB_Category 53/84

2021-11-15T05:24:07Z

Add: s2cid. | Use this bot. Report bugs. | Suggested by Abductive | Category:Algorithms and data structures stubs | #UCB_Category 53/84

← Previous revision		Revision as of 05:24, 15 November 2021
Line 1:		Line 1:
	{{Orphan\|date=September 2013}}		{{Orphan\|date=September 2013}}

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

	==References==		==References==

Gnomingstuff: stub sort

2019-07-11T16:37:03Z

stub sort

← Previous revision		Revision as of 16:37, 11 July 2019
Line 9:		Line 9:


	{{~~compu~~-stub}}		{{algorithm-stub}}

Citation bot: Add: citeseerx, issue. | You can use this bot yourself. Report bugs here. | User-activated.

2019-02-15T03:56:00Z

Add: citeseerx, issue. | You can use this bot yourself. Report bugs here. | User-activated.

← Previous revision		Revision as of 03:56, 15 February 2019
Line 1:		Line 1:
	{{Orphan\|date=September 2013}}		{{Orphan\|date=September 2013}}

	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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|pages=1–40}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473}}</ref>

	==References==		==References==

Rjwilmsi: /* top */Journal cites:, using AWB (12158)

2017-12-12T18:14:49Z

top: Journal cites:, using AWB (12158)

← Previous revision		Revision as of 18:14, 12 December 2017
Line 1:		Line 1:
	{{Orphan\|date=September 2013}}		{{Orphan\|date=September 2013}}

	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\|year=2013\|doi=10.1145/2431211.2431223}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|pages=1–40}}</ref>

	==References==		==References==

Rjwilmsi: /* top */ 10.1145/2431211.2431223

2017-12-12T18:14:31Z

top: 10.1145/2431211.2431223

← Previous revision		Revision as of 18:14, 12 December 2017
Line 1:		Line 1:
	{{Orphan\|date=September 2013}}		{{Orphan\|date=September 2013}}

	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\|year=2013}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223}}</ref>

	==References==		==References==

← Previous revision		Revision as of 23:31, 14 September 2024
Line 1:		Line 1:
			{{Short description\|Type of distributed algorithm}}
	{{One source\|date=May 2023}}		{{One source\|date=May 2023}}
	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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>

← Previous revision		Revision as of 02:32, 3 July 2023
Line 1:		Line 1:
	{{Issues\|		{{Issues\|
	{{One source\|date=May 2023}}		{{One source\|date=May 2023}}
	{{Orphan\|date=September 2013}}
	}}		}}
	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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>		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\|year=2013\|doi=10.1145/2431211.2431223\|volume=45\|issue=2\|pages=1–40\|citeseerx=10.1.1.216.1473\|s2cid=6588866}}</ref>

← Previous revision		Revision as of 14:40, 16 May 2023
Line 1:		Line 1:
			{{Issues\|
			{{One source\|date=May 2023}}
	{{Orphan\|date=September 2013}}		{{Orphan\|date=September 2013}}
			}}

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