Impossibility results for weak threshold networks (Q287142): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Counting networks with arbitrary fan-out / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A combinatorial treatment of balancing networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two algorithms for barrier synchronization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound on wait-free counting / rank | |||
Normal rank |
Latest revision as of 01:07, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Impossibility results for weak threshold networks |
scientific article |
Statements
Impossibility results for weak threshold networks (English)
0 references
26 May 2016
0 references
distributed computing
0 references
parallel processing
0 references
impossibility results
0 references