Mark Braverman, Omri Weinstein. A Discrepancy Lower Bound for Information Complexity. In Anupam Gupta, Klaus Jansen, José D. P. Rolim, Rocco A. Servedio, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Volume 7408 of Lecture Notes in Computer Science, pages 459-470, Springer, 2012. [doi]
@inproceedings{BravermanW12,
title = {A Discrepancy Lower Bound for Information Complexity},
author = {Mark Braverman and Omri Weinstein},
year = {2012},
doi = {10.1007/978-3-642-32512-0_39},
url = {http://dx.doi.org/10.1007/978-3-642-32512-0_39},
researchr = {https://researchr.org/publication/BravermanW12},
cites = {0},
citedby = {0},
pages = {459-470},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings},
editor = {Anupam Gupta and Klaus Jansen and José D. P. Rolim and Rocco A. Servedio},
volume = {7408},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-32511-3},
}