Jump to content

Category:Distributed algorithms

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Miym (talk | contribs) at 22:07, 29 July 2009 (see also). 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)

See also

Category:Distributed computing problems

Subcategories

This category has the following 6 subcategories, out of 6 total.

A

Agreement algorithms (2 P)

C

Concurrency control algorithms (19 P)

D

Distributed artificial intelligence (4 P)
Distributed computing (15 C, 77 P)

L

Logical clock algorithms (6 P)

T

Termination algorithms (2 P)

Pages in category "Distributed algorithms"

The following 41 pages are in this category, out of 41 total. This list may not reflect recent changes.

Distributed algorithm

*

Shared snapshot objects

A

B

C

D

Distributed minimum spanning tree

G

Gbcast

H

Hirschberg–Sinclair algorithm

L

M

Mega-Merger

O

Operational transformation

P

R

S

T

Two-tree broadcast

V

Verification-based message-passing algorithms in compressed sensing

W

Weak coloring

Y

Yo-yo (algorithm)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Distributed_algorithms&oldid=304964389"