Articles by Alexander A. Sherstov
|
Vol 14, Article 22 (pp 1-17)
On Multiparty Communication with Large versus Unbounded Error by Alexander A. Sherstov |
|
Vol 9, Article 20 (pp 653-663)
Approximating the AND-OR Tree by Alexander A. Sherstov |
|
Vol 9, Article 18 (pp 593-615)
[Boolean Spec Issue]
Making Polynomials Robust to Noise by Alexander A. Sherstov |
|
Vol 8, Article 8 (pp 197-208)
The Communication Complexity of Gap Hamming Distance by Alexander A. Sherstov |
■
|
|
Vol 6, Article 10 (pp 227-245)
A Separation of NP and coNP in Multiparty Communication Complexity by Dmitry Gavinsky and Alexander A. Sherstov |