default search action
Amos Beimel
- > Home > Persons > Amos Beimel
Publications
- 2022
- [c67]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds. STOC 2022: 1671-1684 - 2021
- [j37]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Learning Privately with Labeled and Unlabeled Examples. Algorithmica 83(1): 177-215 (2021) - [i35]Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, Uri Stemmer:
Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR abs/2111.03980 (2021) - 2020
- [c63]Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer:
The Power of Synergy in Differential Privacy: Combining a Small Curator with Local Randomizers. ITC 2020: 14:1-14:25 - [c60]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. TCC (2) 2020: 683-712 - [i32]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. CoRR abs/2009.13510 (2020) - [i28]Amos Beimel, Iftach Haitner, Kobbi Nissim, Uri Stemmer:
On the Round Complexity of the Shuffle Model. IACR Cryptol. ePrint Arch. 2020: 1182 (2020) - 2019
- [j35]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Characterizing the Sample Complexity of Pure Private Learners. J. Mach. Learn. Res. 20: 146:1-146:33 (2019) - [c59]Amos Beimel, Kobbi Nissim, Mohammad Zaheri:
Exploring Differential Obliviousness. APPROX-RANDOM 2019: 65:1-65:20 - [c58]Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer:
Private Center Points and Learning of Halfspaces. COLT 2019: 269-282 - [i27]Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer:
Private Center Points and Learning of Halfspaces. CoRR abs/1902.10731 (2019) - [i26]Amos Beimel, Kobbi Nissim, Mohammad Zaheri:
Exploring Differential Obliviousness. CoRR abs/1905.01373 (2019) - [i25]Amos Beimel, Aleksandra Korolova, Kobbi Nissim, Or Sheffet, Uri Stemmer:
The power of synergy in differential privacy: Combining a small curator with local randomizers. CoRR abs/1912.08951 (2019) - 2016
- [j33]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. Theory Comput. 12(1): 1-61 (2016) - 2015
- [c48]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Learning Privately with Labeled and Unlabeled Examples. SODA 2015: 461-477 - 2014
- [j30]Amos Beimel, Hai Brenner, Shiva Prasad Kasiviswanathan, Kobbi Nissim:
Bounds on the sample complexity for private learning and private data release. Mach. Learn. 94(3): 401-437 (2014) - [i15]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Characterizing the Sample Complexity of Private Learners. CoRR abs/1402.2224 (2014) - [i14]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Learning Privately with Labeled and Unlabeled Examples. CoRR abs/1407.2662 (2014) - [i13]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. CoRR abs/1407.2674 (2014) - 2013
- [c43]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy. APPROX-RANDOM 2013: 363-378 - [c42]Amos Beimel, Kobbi Nissim, Uri Stemmer:
Characterizing the sample complexity of private learners. ITCS 2013: 97-110 - 2011
- [i8]Amos Beimel, Kobbi Nissim, Eran Omri:
Distributed Private Data Analysis: On Simultaneously Solving How and What. CoRR abs/1103.2626 (2011) - 2010
- [j27]Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb:
How Should We Solve Search Problems Privately? J. Cryptol. 23(2): 344-371 (2010) - [c35]Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim:
Bounds on the Sample Complexity for Private Learning and Private Data Release. TCC 2010: 437-454 - 2009
- [j25]Amos Beimel, Renen Hallak, Kobbi Nissim:
Private Approximation of Clustering and Vertex Cover. Comput. Complex. 18(3): 435-494 (2009) - 2008
- [j23]Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb:
Private Approximation of Search Problems. SIAM J. Comput. 38(5): 1728-1760 (2008) - [c33]Amos Beimel, Kobbi Nissim, Eran Omri:
Distributed Private Data Analysis: Simultaneously Solving How and What. CRYPTO 2008: 451-468 - 2007
- [c30]Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinreb:
How Should We Solve Search Problems Privately? CRYPTO 2007: 31-49 - [c28]Amos Beimel, Renen Hallak, Kobbi Nissim:
Private Approximation of Clustering and Vertex Cover. TCC 2007: 383-403 - 2006
- [c26]Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb:
Private approximation of search problems. STOC 2006: 119-128 - 2005
- [i5]Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb:
Private Approximation of Search Problems. Electron. Colloquium Comput. Complex. TR05 (2005)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint