Communication Complexity and Lower Bounds on Multilective Computations (Q4265538): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2159271456 / rank
 
Normal rank

Revision as of 01:00, 20 March 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
    0 references
    17 October 2000
    0 references
    protocols
    0 references
    multilective computations
    0 references
    VLSI circuits
    0 references

    Identifiers