Enav Weinreb

29 papers A* 8A 1B 3Journal 13Unranked 4
YearRankTypeTitle / Venue / Authors
2023 A* conf
q2d: Turning Questions into Dialogs to Teach Models How to Search.
EMNLP
Yonatan Bitton, Shlomi Cohen-Ganor, Ido Hakimi, Yoad Lewenberg, Roee Aharoni, Enav Weinreb
2023 J jnl
q2d: Turning Questions into Dialogs to Teach Models How to Search.
CoRR
Yonatan Bitton, Shlomi Cohen-Ganor, Ido Hakimi, Yoad Lewenberg, Roee Aharoni, Enav Weinreb
2014 J jnl
Choosing, Agreeing, and Eliminating in Communication Complexity.
Comput. Complex.
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
2011 J jnl
Partition arguments in multiparty communication complexity.
Theor. Comput. Sci.
Jan Draisma, Eyal Kushilevitz, Enav Weinreb
2010 — conf
Choosing, Agreeing, and Eliminating in Communication Complexity.
ICALP (1)
Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb
2010 J jnl
How Should We Solve Search Problems Privately?
J. Cryptol.
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
2010 J jnl
On
J. Cryptol.
Omer Barkol, Yuval Ishai, Enav Weinreb
2010 J jnl
On Locally Decodable Codes, Self-Correctable Codes, and
Algorithmica
Omer Barkol, Yuval Ishai, Enav Weinreb
2009 A* conf
On the complexity of communication complexity.
STOC
Eyal Kushilevitz, Enav Weinreb
2009 J jnl
Partition Arguments in Multiparty Communication Complexity
CoRR
Jan Draisma, Eyal Kushilevitz, Enav Weinreb
2009 — conf
Partition Arguments in Multiparty Communication Complexity.
ICALP (1)
Jan Draisma, Eyal Kushilevitz, Enav Weinreb
2009 A* conf
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection.
FOCS
Eyal Kushilevitz, Enav Weinreb
2008 J jnl
Characterizing Ideal Weighted Threshold Secret Sharing.
SIAM J. Discret. Math.
Amos Beimel, Tamir Tassa, Enav Weinreb
2008 A* conf
Communication in the presence of replication.
STOC
Omer Barkol, Yuval Ishai, Enav Weinreb
2008 A* conf
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries.
CRYPTO
Payman Mohassel, Enav Weinreb
2008 J jnl
Private Approximation of Search Problems.
SIAM J. Comput.
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2008 J jnl
Searchable encryption with decryption in the standard model.
IACR Cryptol. ePrint Arch.
Dennis Hofheinz, Enav Weinreb
2007 A* conf
How Should We Solve Search Problems Privately?
CRYPTO
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb
2007 — conf
On Locally Decodable Codes, Self-correctable Codes, and
APPROX-RANDOM
Omer Barkol, Yuval Ishai, Enav Weinreb
2007 B conf
Secure Linear Algebra Using Linearly Recurrent Sequences.
TCC
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew K. Franklin
2006 B conf
Communication Efficient Secure Linear Algebra.
TCC
Kobbi Nissim, Enav Weinreb
2006 J jnl
Monotone circuits for monotone weighted threshold functions.
Inf. Process. Lett.
Amos Beimel, Enav Weinreb
2006 A* conf
Private approximation of search problems.
STOC
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2006 — conf
Secure Linear Algebra Using Linearly Recurrent Sequences.
Complexity of Boolean Functions
Eike Kiltz, Enav Weinreb
2005 B conf
Characterizing Ideal Weighted Threshold Secret Sharing.
TCC
Amos Beimel, Tamir Tassa, Enav Weinreb
2005 A conf
Monotone Circuits for Weighted Threshold Functions.
CCC
Amos Beimel, Enav Weinreb
2005 J jnl
Private Approximation of Search Problems
Electron. Colloquium Comput. Complex.
Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb
2005 J jnl
Separating the Power of Monotone Span Programs over Different Fields.
SIAM J. Comput.
Amos Beimel, Enav Weinreb
2003 A* conf
Separating the Power of Monotone Span Programs over Different Fields.
FOCS
Amos Beimel, Enav Weinreb