Enav Weinreb

Available identifiers

zbMath Open weinreb.enavMaRDI QIDQ541667

List of research outcomes

Publication	Date of Publication	Type
On the complexity of communication complexity	2015-02-04	Paper
Private approximation of search problems	2014-11-25	Paper
Choosing, agreeing, and eliminating in communication complexity	2014-09-25	Paper
The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection	2014-07-25	Paper
Partition arguments in multiparty communication complexity	2011-06-07	Paper
On \(d\)-multiplicative secret sharing	2010-11-12	Paper
On locally decodable codes, self-correctable codes, and \(t\)-private PIR	2010-11-08	Paper
Choosing, Agreeing, and Eliminating in Communication Complexity	2010-09-07	Paper
How should we solve search problems privately?	2010-03-01	Paper
Monotone circuits for monotone weighted threshold functions	2009-12-18	Paper
Private Approximation of Search Problems	2009-11-06	Paper
Partition Arguments in Multiparty Communication Complexity	2009-07-14	Paper
Characterizing Ideal Weighted Threshold Secret Sharing	2009-03-16	Paper
How Should We Solve Search Problems Privately?	2009-03-10	Paper
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR	2009-02-17	Paper
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries	2009-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q5302091	2009-01-05	Paper
Secure Linear Algebra Using Linearly Recurrent Sequences	2007-08-30	Paper
Theory of Cryptography	2007-02-12	Paper
Theory of Cryptography	2005-12-07	Paper
Separating the Power of Monotone Span Programs over Different Fields	2005-09-16	Paper

Research outcomes over time

This page was built for person: Enav Weinreb