Skip to main content

Search

Reset

Add filters:

Use filters to refine the search results.

 | 
Item hits:
Publication DateArticle TitleAuthor(s)
2017LIST and unique coding for interactive communication in the presence of adversarial noiseBraverman, Mark; Efremenko, K
17-Dec-2015Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity of DisjointnessBraverman, Mark; Garg, A; Ko, YK; Mao, J; Touchette, D
13-Jun-2014Stability in large matching markets with complementaritiesAshlagi, I; Braverman, Mark; Hassidim, A
16-Jan-2017ETH hardness for densest-k-Subgraph with perfect completenessBraverman, Mark; Ko, YK; Rubinstein, A; Weinstein, O
2016Interpolating between truthful and non-truthful mechanisms for combinatorial auctionsBraverman, Mark; Mao, J; Weinberg, SM
12-Jan-2014The computational hardness of pricing compound optionsBraverman, Mark; Pasricha, K
1-Nov-2016A Discrepancy Lower Bound for Information ComplexityBraverman, Mark; Weinstein, O
27-Aug-2015Space-Bounded Church-Turing Thesis and Computational Tractability of Closed SystemsBraverman, Mark; Schneider, J; Rojas, C
20-Nov-2013Individual and combined effects of DNA methylation and copy number alterations on miRNA expression in breast tumorsAure, MR; Leivonen, S-K; Fleischer, T; Zhu, Q; Overgaard, J, et al
18-Apr-2013Computational solutions for omics dataBerger, B; Peng, J; Singh, Mona