This website uses cookies to help us give you the best experience when you visit our website. By continuing to use this website, you consent to our use of these cookies.
Mark Braverman, Rao, Anup , Weinstein, Omri , and Yehudayoff, Amir . 2013. “Direct Product Via Round-Preserving Compression”. In Automata, Languages, And Programming - 40Th International Colloquium, Icalp 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I, 7965:Pp. 232–243. Springer. doi:10.1007/978-3-642-39206-1\_20. Publisher's Version
Mark Braverman, Rao, Anup , Weinstein, Omri , and Yehudayoff, Amir . 2013. “Direct Products In Communication Complexity”. In 54Th Annual Ieee Symposium On Foundations Of Computer Science, Focs 2013, 26-29 October, 2013, Berkeley, Ca, Usa, Pp. 746–755. IEEE Computer Society. doi:10.1109/FOCS.2013.85. Publisher's Version
Mark Braverman, Garg, Ankit , Pankratov, Denis , and Weinstein, Omri . 2013. “From Information To Exact Communication”. In Symposium On Theory Of Computing Conference, Stoc'13, Palo Alto, Ca, Usa, June 1-4, 2013, Pp. 151–160. ACM. doi:10.1145/2488608.2488628. Publisher's Version
Mark Braverman, Garg, Ankit , Pankratov, Denis , and Weinstein, Omri . 2013. “Information Lower Bounds Via Self-Reducibility”. In Computer Science - Theory And Applications - 8Th International Computer Science Symposium In Russia, Csr 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings, 7913:Pp. 183–194. Springer. doi:10.1007/978-3-642-38536-0\_16. Publisher's Version
Mark Braverman and Weinstein, Omri . 2012. “A Discrepancy Lower Bound For Information Complexity”. In 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, 7408:Pp. 459–470. Springer. doi:10.1007/978-3-642-32512-0\_39. Publisher's Version