Beimel, Amos; Ben Daniel, Sebastian; Kushilevitz, Eyal; Weinreb, Enav Choosing, agreeing, and eliminating in communication complexity. (English) Zbl 1366.68050 Comput. Complexity 23, No. 1, 1-42 (2014). MSC: 68Q05 68Q10 68Q25 PDFBibTeX XMLCite \textit{A. Beimel} et al., Comput. Complexity 23, No. 1, 1--42 (2014; Zbl 1366.68050) Full Text: DOI Link
Beimel, Amos; Hallak, Renen; Nissim, Kobbi Private approximation of clustering and vertex cover. (English) Zbl 1213.68307 Comput. Complexity 18, No. 3, 435-494 (2009). MSC: 68Q17 68R10 94A60 PDFBibTeX XMLCite \textit{A. Beimel} et al., Comput. Complexity 18, No. 3, 435--494 (2009; Zbl 1213.68307) Full Text: DOI
Beimel, Amos; Gál, Anna; Paterson, Mike Lower bounds for monotone span programs. (English) Zbl 0870.68072 Comput. Complexity 6(1996-97), No. 1, 29-45 (1997). MSC: 68Q15 94C10 PDFBibTeX XMLCite \textit{A. Beimel} et al., Comput. Complexity 6, No. 1, 29--45 (1997; Zbl 0870.68072) Full Text: DOI