9 citations · 10 across the 6 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2025
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
Xudong Wu, Guangxu Yang, Penghui Yao
We investigates a model of hybrid classical-quantum communication complexity, in which two parties first exchange classical messages and subsequently communicate using quantum mess…
cs.CC2019
Querying a Matrix through Matrix-Vector Products
Xiaoming Sun, David P. Woodruff, Guang Yang +1
We consider algorithms with access to an unknown matrix via matrix-vector products, namely, the algorithm chooses vectors $\mathbf{v}^1, \ldots, \math…
cs.CC2019★ 1 cited
Separating k-Player from t-Player One-Way Communication, with Applications to Data Streams
Elbert Du, Michael Mitzenmacher, David P. Woodruff +1
In a -party communication problem, the players with inputs , respectively, want to evaluate a function using as little comm…