| 2023 | EMNLP | q2d: Turning Questions into Dialogs to Teach Models How to Search. | Yonatan Bitton, Shlomi Cohen-Ganor, Ido Hakimi, Yoad Lewenberg, Roee Aharoni, Enav Weinreb |
| 2010 | ICALP | Choosing, Agreeing, and Eliminating in Communication Complexity. | Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb |
| 2009 | FOCS | The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. | Eyal Kushilevitz, Enav Weinreb |
| 2009 | ICALP | Partition Arguments in Multiparty Communication Complexity. | Jan Draisma, Eyal Kushilevitz, Enav Weinreb |
| 2009 | STOC | On the complexity of communication complexity. | Eyal Kushilevitz, Enav Weinreb |
| 2008 | CRYPTO | Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries. | Payman Mohassel, Enav Weinreb |
| 2008 | STOC | Communication in the presence of replication. | Omer Barkol, Yuval Ishai, Enav Weinreb |
| 2007 | CRYPTO | How Should We Solve Search Problems Privately? | Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb |
| 2007 | TCC | Secure Linear Algebra Using Linearly Recurrent Sequences. | Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin |
| 2006 | STOC | Private approximation of search problems. | Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb |
| 2006 | TCC | Communication Efficient Secure Linear Algebra. | Kobbi Nissim, Enav Weinreb |
| 2005 | TCC | Characterizing Ideal Weighted Threshold Secret Sharing. | Amos Beimel, Tamir Tassa, Enav Weinreb |
| 2003 | FOCS | Separating the Power of Monotone Span Programs over Different Fields. | Amos Beimel, Enav Weinreb |