Search
Add filters:
Use filters to refine the search results.
Item hits:
Publication Date | Article Title | Author(s) |
---|---|---|
Jun-2018 | Visible Machine Learning for Biomedicine. | Yu, Michael K; Ma, Jianzhu; Fisher, Jasmin; Kreisberg, Jason F; Raphael, Benjamin J, et al |
2013 | From information to exact communication | Braverman, Mark; Garg, Ankit; Pankratov, Denis; Weinstein, Omri |
Jun-2018 | Hitting sets with near-optimal error for read-once branching programs | Braverman, Mark; Cohen, Gil; Garg, Sumegha |
2015 | Interactive Information Complexity | Braverman, Mark |
Dec-2017 | Constant-Rate Coding for Multiparty Interactive Communication Is Impossible | Braverman, Mark; Efremenko, Klim; Gelles, Ran; Haeupler, Bernhard |
2013 | How to Compress Interactive Communication | Barak, Boaz; Braverman, Mark; Chen, Xi; Rao, Anup |
2014 | Interactive information and coding theory | Braverman, Mark |
2015 | Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis | Braverman, Mark; Ko, Young K; Weinstein, Omri |
2017 | Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All | Braverman, Mark; Garg, Sumegha; Schvartzman, Ariel |
2018 | Information Value of Two-Prover Games | Braverman, Mark; Ko, Young K |