The communication complexity for decentralized evaluation of functions (Q915467): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An improved algorithm for decentralized extrema-finding in circular configurations of processes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Decentralized extrema-finding in circular configurations of processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) Unidirectional Algorithm for the Circular Extrema Problem / rank | |||
Normal rank | |||
Revision as of 08:31, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The communication complexity for decentralized evaluation of functions |
scientific article |
Statements
The communication complexity for decentralized evaluation of functions (English)
0 references
1990
0 references
message complexity
0 references
bit complexity
0 references
distributed systems
0 references
Decentralized algorithms
0 references
0 references
