Noam Lifshitz

Orcid: 0000-0002-2271-3605

According to our database1, Noam Lifshitz authored at least 24 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Constant Degree Direct Product Testers with Small Soundness.
Electron. Colloquium Comput. Complex., 2024

Influences in Mixing Measures.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Product mixing in compact Lie groups.
Electron. Colloquium Comput. Complex., 2023

One Clean Qubit Suffices for Quantum Communication Advantage.
Electron. Colloquium Comput. Complex., 2023

An Analogue of Bonami's Lemma for Functions on Spaces of Linear Maps, and 2-2 Games.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Isoperimetric Inequalities Made Simpler.
CoRR, 2022

Hypercontractivity on high dimensional expanders.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2021
Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for $\epsilon$-Product Spaces.
Electron. Colloquium Comput. Complex., 2021

Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for ε-Product Spaces.
CoRR, 2021

Complexity Measures on the Symmetric Group and Beyond (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

An Invariance Principle for the Multi-slice, with Applications.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
On set systems without a simplex-cluster and the junta method.
J. Comb. Theory A, 2020

Complexity Measures on the Symmetric Group and Beyond.
CoRR, 2020

Hypercontractivity on the symmetric group.
CoRR, 2020

AND testing and robust judgement aggregation.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Towards a Proof of the Fourier-Entropy Conjecture?
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
A Note on Large H-Intersecting Families.
SIAM J. Discret. Math., 2019

On a biased edge isoperimetric inequality for the discrete cube.
J. Comb. Theory A, 2019

On the union of intersecting families.
Comb. Probab. Comput., 2019

Revisiting Bourgain-Kalai and Fourier Entropies.
CoRR, 2019

Noise Sensitivity on the p -Biased Hypercube.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2017
The Junta Method in Extremal Hypergraph Theory and Chvátal's Conjecture.
Electron. Notes Discret. Math., 2017

Approximation of biased Boolean functions of small total influence by DNF's.
CoRR, 2017

2015
Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme.
J. Math. Cryptol., 2015


  Loading...