Direct Sum Theorems

Direct Sum Theorems is a theoretical framework in communication complexity that establishes lower bounds on the total communication required to solve multiple independent instances of a problem collectively, by asserting that the complexity of computing the direct sum of functions is at least the sum of their individual complexities.

585

Publications

20.5K

Citations

800

Authors

434

Institutions

Publications per year

2017–2026

36

Authors

800

  1. ST
    S. Tariq Rizvi

    The Ohio State University at Lima, United States

    7 publications · 490 citations

    7

    h-index

  2. PH
    Paul Hill

    Auburn University, United States

    5 publications · 134 citations

    5

    h-index

  3. MM
    Marvin Marcus

    University of California, Santa Barbara, United States

    4 publications · 64 citations

    4

    h-index

  4. TB
    Thomas Brylawski

    University of North Carolina at Chapel Hill, United States

    4 publications · 437 citations

    4

    h-index

  5. PF
    Patrick F. Smith

    University of Glasgow, United Kingdom

    4 publications · 78 citations

    4

    h-index

1–5 of 800

Venues

  1. Pacific Journal of Mathematics

    61 publications · 2.8K citations

    34

    h-index

  2. Proceedings of the American Mathematical Society

    PROC · 38 publications · 964 citations

    19

    h-index

  3. IEEE Transactions on Information Theory

    21 publications · 687 citations

    18

    h-index

  4. Communications in Algebra

    29 publications · 1K citations

    16

    h-index

  5. Canadian Journal of Mathematics

    18 publications · 441 citations

    15

    h-index

1–5