default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNoam Lifshitz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j6]Noam Lifshitz:
On set systems without a simplex-cluster and the junta method. J. Comb. Theory A 170 (2020)- 2019
- [j5]David Ellis
, Noam Lifshitz:
On the union of intersecting families. Comb. Probab. Comput. 28(6): 826-839 (2019) - [j4]David Ellis, Nathan Keller, Noam Lifshitz:
On a biased edge isoperimetric inequality for the discrete cube. J. Comb. Theory A 163: 118-162 (2019) - [j3]Nathan Keller, Noam Lifshitz:
A Note on Large H-Intersecting Families. SIAM J. Discret. Math. 33(1): 398-401 (2019) - 2017
- [j2]Nathan Keller, Noam Lifshitz:
The Junta Method in Extremal Hypergraph Theory and Chvátal's Conjecture. Electron. Notes Discret. Math. 61: 711-717 (2017) - 2015
- [j1]Boaz Tsaban, Noam Lifshitz:
Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme. J. Math. Cryptol. 9(2): 75-78 (2015)
Conference and Workshop Papers
- 2024
- [c9]Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
Influences in Mixing Measures. STOC 2024: 527-536 - [c8]David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer:
Product Mixing in Compact Lie Groups. STOC 2024: 1415-1422 - 2023
- [c7]David Ellis, Guy Kindler, Noam Lifshitz:
An Analogue of Bonami's Lemma for Functions on Spaces of Linear Maps, and 2-2 Games. STOC 2023: 656-660 - 2022
- [c6]Tom Gur, Noam Lifshitz, Siqi Liu:
Hypercontractivity on high dimensional expanders. STOC 2022: 176-184 - 2021
- [c5]Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer:
An Invariance Principle for the Multi-slice, with Applications. FOCS 2021: 228-236 - [c4]Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals:
Complexity Measures on the Symmetric Group and Beyond (Extended Abstract). ITCS 2021: 87:1-87:5 - 2020
- [c3]Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra:
Towards a Proof of the Fourier-Entropy Conjecture? FOCS 2020: 247-258 - [c2]Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
AND testing and robust judgement aggregation. STOC 2020: 222-233 - 2019
- [c1]Noam Lifshitz, Dor Minzer:
Noise Sensitivity on the p -Biased Hypercube. FOCS 2019: 1205-1226
Informal and Other Publications
- 2024
- [i17]David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer:
Product Mixing in Compact Lie Groups. CoRR abs/2401.15456 (2024) - [i16]Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. CoRR abs/2402.00850 (2024) - [i15]Mitali Bafna, Noam Lifshitz, Dor Minzer:
Constant Degree Direct Product Testers with Small Soundness. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [i14]Frederic Koehler, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
Influences in Mixing Measures. CoRR abs/2307.07625 (2023) - [i13]Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. CoRR abs/2310.02406 (2023) - [i12]Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. Electron. Colloquium Comput. Complex. TR23 (2023) - [i11]David Ellis, Guy Kindler, Noam Lifshitz, Dor Minzer:
Product mixing in compact Lie groups. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i10]Ronen Eldan, Guy Kindler, Noam Lifshitz, Dor Minzer:
Isoperimetric Inequalities Made Simpler. CoRR abs/2204.06686 (2022) - 2021
- [i9]Mark Braverman, Subhash Khot, Noam Lifshitz, Dor Minzer:
An Invariance Principle for the Multi-slice, with Applications. CoRR abs/2110.10725 (2021) - [i8]Tom Gur, Noam Lifshitz, Siqi Liu:
Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for ε-Product Spaces. CoRR abs/2111.09375 (2021) - [i7]Tom Gur, Noam Lifshitz, Siqi Liu:
Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for $\epsilon$-Product Spaces. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i6]Yuval Filmus, Guy Kindler, Noam Lifshitz, Dor Minzer:
Hypercontractivity on the symmetric group. CoRR abs/2009.05503 (2020) - [i5]Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals:
Complexity Measures on the Symmetric Group and Beyond. CoRR abs/2010.07405 (2020) - 2019
- [i4]Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
AND Testing and Robust Judgement Aggregation. CoRR abs/1911.00159 (2019) - [i3]Esty Kelman, Guy Kindler, Noam Lifshitz, Dor Minzer, Muli Safra:
Revisiting Bourgain-Kalai and Fourier Entropies. CoRR abs/1911.10579 (2019) - 2017
- [i2]Nathan Keller, Noam Lifshitz:
Approximation of biased Boolean functions of small total influence by DNF's. CoRR abs/1703.10116 (2017) - 2014
- [i1]Boaz Tsaban, Noam Lifshitz:
Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme. IACR Cryptol. ePrint Arch. 2014: 250 (2014)
Coauthor Index
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-10-07 22:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
