Communication Complexity and Lower Bounds on Multilective Computations (Q4265538): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1051/ita:1999113 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1051/ITA:1999113 / rank | |||
Normal rank | |||
Latest revision as of 14:03, 29 December 2024
scientific article; zbMATH DE number 1339740
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Communication Complexity and Lower Bounds on Multilective Computations |
scientific article; zbMATH DE number 1339740 |
Statements
Communication Complexity and Lower Bounds on Multilective Computations (English)
0 references
17 October 2000
0 references
protocols
0 references
multilective computations
0 references
VLSI circuits
0 references
0 references
0 references
