An Additive Combinatorics Approach Relating Rank to Communication Complexity
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2014/07/01
-
Journal
-
Indian UGC (journal)
-
Refrences31
-
Citations2
-
Eli Ben-Sasson Technion - Israel Institute of Technology
-
Shachar Lovett University of California, San Diego
-
Noga Ron-Zewi Technion - Israel Institute of Technology
Abstract
Cite
Ben-Sasson, Eli, et al. “An Additive Combinatorics Approach Relating Rank to Communication Complexity”. Journal of the ACM, vol. 61, no. 4, 2014, pp. 1-18, https://doi.org/10.1145/2629598.
Ben-Sasson, E., Lovett, S., & Ron-Zewi, N. (2014). An Additive Combinatorics Approach Relating Rank to Communication Complexity. Journal of the ACM, 61(4), 1-18. https://doi.org/10.1145/2629598
Ben-Sasson, Eli, Shachar Lovett, and Noga Ron-Zewi. “An Additive Combinatorics Approach Relating Rank to Communication Complexity”. Journal of the ACM 61, no. 4 (2014): 1-18. https://doi.org/10.1145/2629598.
Ben-Sasson E, Lovett S, Ron-Zewi N. An Additive Combinatorics Approach Relating Rank to Communication Complexity. Journal of the ACM. 2014;61(4):1-18.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Science
Science (General)
Cybernetics
Information theory
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| An analog of Freiman’s theorem in groups | 1999 | |||
| Communication Complexity | ||||
| Cambridge University Press | ||||
| 10.1016/0012-365X(88)90199-9 | ||||
| 10.1017/S0963548312000351 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Upper Bounds on Communication in Terms of Approximate Rank | Theory of Computing Systems |
| 2023 | |
| A generalization of a theorem of Rothschild and van Lint | Theoretical Computer Science |
| 2023 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 2
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Upper Bounds on Communication in Terms of Approximate Rank and was published in 2023. The most recent citation comes from a 2023 study titled Upper Bounds on Communication in Terms of Approximate Rank. This article reached its peak citation in 2023, with 2 citations. It has been cited in 2 different journals. Among related journals, the Theory of Computing Systems cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.