Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Aprile, Manuel
and
Faenza, Yuri
2020.
Extended formulations from communication protocols in output-efficient time.
Mathematical Programming,
Vol. 183,
Issue. 1-2,
p.
41.
Doriguello, João F.
and
Montanaro, Ashley
2021.
Quantum Random Access Codes for Boolean Functions.
Quantum,
Vol. 5,
Issue. ,
p.
402.
Bakos, Bence
Hegyvári, Norbert
and
Pálfy, Máté
2021.
On a communication complexity problem in combinatorial number theory.
Moscow Journal of Combinatorics and Number Theory,
Vol. 10,
Issue. 4,
p.
297.
Knop, A.
Lovett, S.
McGuire, S.
and
Yuan, W.
2021.
Guest Column.
ACM SIGACT News,
Vol. 52,
Issue. 2,
p.
46.
Dershowitz, Nachum
Oshman, Rotem
and
Roth, Tal
2021.
The communication complexity of multiparty set disjointness under product distributions.
p.
1194.
Halldórsson, Magnús M.
and
Nolin, Alexandre
2021.
Structural Information and Communication Complexity.
Vol. 12810,
Issue. ,
p.
68.
Hopkins, Samuel B.
Raghavendra, Prasad
and
Shetty, Abhishek
2022.
Matrix discrepancy from Quantum communication.
p.
637.
Malak, Derya
2022.
Fractional Graph Coloring for Functional Compression with Side Information.
p.
750.
Cohen, Shahar P.
and
Naor, Moni
2022.
Advances in Cryptology – CRYPTO 2022.
Vol. 13509,
Issue. ,
p.
252.
Le Gall, François
and
Suruga, Daiki
2022.
LATIN 2022: Theoretical Informatics.
Vol. 13568,
Issue. ,
p.
641.
Fleming, Noah
and
Pitassi, Toniann
2022.
Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs.
Vol. 22,
Issue. ,
p.
497.
Singer, Noah
and
Sudan, Madhu
2022.
Point-hyperplane Incidence Geometry and the Log-rank Conjecture.
ACM Transactions on Computation Theory,
Vol. 14,
Issue. 2,
p.
1.
Hrubeš, Pavel
and
Yehudayoff, Amir
2023.
Shadows of Newton polytopes.
Israel Journal of Mathematics,
Vol. 256,
Issue. 1,
p.
311.
Frongillo, Rafael
Neyman, Eric
and
Waggoner, Bo
2023.
Agreement Implies Accuracy for Substitutable Signals.
p.
702.
Tang, Hao
Li, Boning
Wang, Guoqing
Xu, Haowei
Li, Changhao
Barr, Ariel
Cappellaro, Paola
and
Li, Ju
2023.
Communication-Efficient Quantum Algorithm for Distributed Machine Learning.
Physical Review Letters,
Vol. 130,
Issue. 15,
Gupta, Shashank
Saha, Debashis
Xu, Zhen-Peng
Cabello, Adán
and
Majumdar, A. S.
2023.
Quantum Contextuality Provides Communication Complexity Advantage.
Physical Review Letters,
Vol. 130,
Issue. 8,
Fontes, Lila
Laplante, Sophie
Laurière, Mathieu
and
Nolin, Alexandre
2023.
Structural Information and Communication Complexity.
Vol. 13892,
Issue. ,
p.
427.
Grolmusz, Vince
2023.
A Note on the LogRank Conjecture in Communication Complexity.
Mathematics,
Vol. 11,
Issue. 22,
p.
4651.
Ishai, Yuval
Kushnir, Eyal
and
Rothblum, Ron D.
2023.
Theory of Cryptography.
Vol. 14370,
Issue. ,
p.
251.
Golovnev, Alexander
Guo, Siyao
Peters, Spencer
and
Stephens-Davidowitz, Noah
2023.
Advances in Cryptology – CRYPTO 2023.
Vol. 14082,
Issue. ,
p.
453.