On the public citation graph
Boolean Functions With Low Average Sensitivity Depend On Few Coordinates
0 signed · 218 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00535742openalex-snapshot
On the critical percolation probabilities
inferredcites →https://doi.org/10.1007/bf01263419openalex-snapshot
On the degree of boolean functions as real polynomials
inferredcites →https://doi.org/10.1016/0012-365x(83)90044-4openalex-snapshot
A threshold for perfect matchings in random d-pure hypergraphs
inferredcites →https://doi.org/10.1090/s0002-9939-96-03732-xopenalex-snapshot
Every monotone graph property has a sharp threshold
inferredcites →https://doi.org/10.1109/sfcs.1988.21923openalex-snapshot
The influence of variables on Boolean functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.10097openalex-snapshot
On the noise sensitivity of monotone functions
inferred← citeshttps://doi.org/10.1002/rsa.20515openalex-snapshot
A stability result for balanced dictatorships in Sn
inferred← citeshttps://doi.org/10.1002/rsa.20623openalex-snapshot
Juntas in theℓ1-grid and Lipschitz maps between discrete tori
inferred← citeshttps://doi.org/10.1007/978-1-4419-9675-6_12openalex-snapshot
Noise Sensitivity of Boolean Functions and Applications to Percolation
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_709openalex-snapshot
Testing Juntas and Related Properties of Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_28openalex-snapshot
A Generalization of a Theorem of Rothschild and van Lint
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_14openalex-snapshot
Secure Non-interactive Simulation from Arbitrary Joint Distributions
inferred← citeshttps://doi.org/10.1007/978-3-031-42697-1_10openalex-snapshot
Average Sensitivity of Nested Canalizing Multivalued Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_13openalex-snapshot
Average Sensitivity of Breadth-First Search Algorithms on Grids
inferred← citeshttps://doi.org/10.1007/978-3-0346-0425-3_7openalex-snapshot
Combinatorics with a Geometric Flavor
inferred← citeshttps://doi.org/10.1007/978-3-0348-8211-8_30openalex-snapshot
On the Noise Sensitivity of Monotone Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-03886-5_3openalex-snapshot
Superconcentration and Chaos
inferred← citeshttps://doi.org/10.1007/978-3-319-13578-6_4openalex-snapshot
Chaotic Dynamics of Autonomous Boolean Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-77404-6_21openalex-snapshot
Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_19openalex-snapshot
Approximation by DNF: Examples and Counterexamples
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_709-1openalex-snapshot
Testing Juntas and Related Properties of Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_66openalex-snapshot
A Composition Theorem for the Fourier Entropy-Influence Conjecture
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_47openalex-snapshot
On the Average Sensitivity and Density of k-CNF Formulas
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_20openalex-snapshot
On DNF Approximators for Monotone Boolean Functions
inferred← citeshttps://doi.org/10.1007/978-3-662-43948-7_57openalex-snapshot
The Complexity of Somewhat Approximation Resistant Predicates
inferred← citeshttps://doi.org/10.1007/978-3-662-53140-2_19openalex-snapshot
Strong Machine Learning Attack Against PUFs with No Mathematical Model
inferred← citeshttps://doi.org/10.1007/bf02698830openalex-snapshot
Noise sensitivity of boolean functions and applications to percolation
inferred← citeshttps://doi.org/10.1007/bf02773611openalex-snapshot
Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality
inferred← citeshttps://doi.org/10.1007/s00037-006-0210-9openalex-snapshot
ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT
inferred← citeshttps://doi.org/10.1007/s00037-012-0045-5openalex-snapshot
Improved Approximation of Linear Threshold Functions
inferred← citeshttps://doi.org/10.1007/s00037-013-0068-6openalex-snapshot
DNF sparsification and a faster deterministic counting algorithm
inferred← citeshttps://doi.org/10.1007/s00037-015-0110-yopenalex-snapshot
On the Structure of Boolean Functions with Small Spectral Norm
inferred← citeshttps://doi.org/10.1007/s00039-004-0478-3openalex-snapshot
Graph Products, Fourier Analysis and Spectral Techniques
inferred← citeshttps://doi.org/10.1007/s00039-008-0651-1openalex-snapshot
Independent Sets in Graph Powers are Almost Contained in Juntas
inferred← citeshttps://doi.org/10.1007/s00039-020-00544-2openalex-snapshot
Towards a Proof of the Fourier-Entropy Conjecture?
inferred← citeshttps://doi.org/10.1007/s00145-022-09421-7openalex-snapshot
On the Round Complexity of Randomized Byzantine Agreement
inferred← citeshttps://doi.org/10.1007/s00220-024-04981-0openalex-snapshot
Quantum Talagrand, KKL and Friedgut’s Theorems and the Learnability of Quantum Boolean Functions
inferred← citeshttps://doi.org/10.1007/s00222-022-01135-8openalex-snapshot
Concentration on the Boolean hypercube via pathwise stochastic analysis
inferred← citeshttps://doi.org/10.1007/s00222-024-01306-9openalex-snapshot
Dimension-free discretizations of the uniform norm by small product sets
inferred← citeshttps://doi.org/10.1007/s00493-014-3027-1openalex-snapshot
A quasi-stability result for dictatorships in S n
inferred← citeshttps://doi.org/10.1007/s00493-024-00133-zopenalex-snapshot
A New Bound for the Fourier-Entropy-Influence Conjecture
inferred← citeshttps://doi.org/10.1007/s00493-025-00152-4openalex-snapshot
Turán Problems for Expanded Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10559-016-9852-zopenalex-snapshot
On the Efficiency of the Probabilistic Neutral Bits Method in Statistical Cryptanalysis of Synchronous Stream Ciphers
inferred← citeshttps://doi.org/10.1007/s11856-007-0068-9openalex-snapshot
On the Fourier tails of bounded functions over the discrete cube
inferred← citeshttps://doi.org/10.1007/s11856-015-1265-6openalex-snapshot
On the failure of concentration for the ℓ ∞-ball
inferred← citeshttps://doi.org/10.1007/s11856-016-1302-0openalex-snapshot
Bi-Lipschitz bijection between the Boolean cube and the Hamming ball
inferred← citeshttps://doi.org/10.1007/s11856-020-2062-4openalex-snapshot
A structure theorem for almost low-degree functions on the slice
inferred← citeshttps://doi.org/10.1007/s13389-017-0159-4openalex-snapshot
Having no mathematical model may not secure PUFs
inferred← citeshttps://doi.org/10.1016/j.aim.2021.107991openalex-snapshot
The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.05.003openalex-snapshot
Randomly colouring graphs (a combinatorial view)
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.003openalex-snapshot
Interplay between resiliency and polynomial degree — Recursive amplification, higher order sensitivity and beyond
inferred← citeshttps://doi.org/10.1016/j.disc.2008.12.018openalex-snapshot
Linear transformations of monotone functions on the discrete cube
inferred← citeshttps://doi.org/10.1016/j.disc.2012.07.031openalex-snapshot
A note on the Entropy/Influence conjecture
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.06.003openalex-snapshot
A simple reduction from a biased measure on the discrete cube to the uniform measure
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.12.006openalex-snapshot
Sensitivity of Boolean formulas
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.019openalex-snapshot
Vertex cover might be hard to approximate to within 2−ε
inferred← citeshttps://doi.org/10.1016/j.jcta.2017.11.005openalex-snapshot
A stability result for the cube edge isoperimetric inequality
inferred← citeshttps://doi.org/10.1016/j.jcta.2018.12.001openalex-snapshot
On a biased edge isoperimetric inequality for the discrete cube
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105139openalex-snapshot
On set systems without a simplex-cluster and the junta method
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105186openalex-snapshot
Vertex-isoperimetric stability in the hypercube
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.06.003openalex-snapshot
Fourier analysis and large independent sets in powers of complete graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.04.009openalex-snapshot
Stability for vertex isoperimetry in the cube
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.013openalex-snapshot
Tight bounds on ℓ1 approximation and learning of self-bounding functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113802openalex-snapshot
A generalization of a theorem of Rothschild and van Lint
inferred← citeshttps://doi.org/10.1016/s0196-8858(02)00024-6openalex-snapshot
Boolean functions whose Fourier transform is concentrated on the first two levels
inferred← citeshttps://doi.org/10.1017/cbo9781139814782openalex-snapshot
Analysis of Boolean Functions
inferred← citeshttps://doi.org/10.1017/cbo9781139924160openalex-snapshot
Noise Sensitivity of Boolean Functions and Percolation
inferred← citeshttps://doi.org/10.1017/fms.2023.118openalex-snapshot
Hypercontractivity on the symmetric group
inferred← citeshttps://doi.org/10.1017/s0963548303005832openalex-snapshot
Influences in Product Spaces: KKL and BKKKL Revisited
inferred← citeshttps://doi.org/10.1017/s0963548306008340openalex-snapshot
Edge-Isoperimetric Inequalities and Influences
inferred← citeshttps://doi.org/10.1017/s0963548308009309openalex-snapshot
Intersecting Families are Essentially Contained in Juntas
inferred← citeshttps://doi.org/10.1017/s0963548309009833openalex-snapshot
Decision Trees and Influences of Variables Over Product Probability Spaces
inferred← citeshttps://doi.org/10.1017/s0963548310000234openalex-snapshot
On the Influences of Variables on Boolean Functions in Product Spaces
inferred← citeshttps://doi.org/10.1017/s0963548311000083openalex-snapshot
Almost Isoperimetric Subsets of the Discrete Cube
inferred← citeshttps://doi.org/10.1017/s0963548318000044openalex-snapshot
On Quantitative Noise Stability and Influences for Discrete and Continuous Models
inferred← citeshttps://doi.org/10.1063/1.3225563openalex-snapshot
On the sensitivity to noise of a Boolean function
inferred← citeshttps://doi.org/10.1090/jams/1027openalex-snapshot
Hypercontractivity for global functions and sharp thresholds
inferred← citeshttps://doi.org/10.1090/proc/14153openalex-snapshot
On regular 3-wise intersecting families
inferred← citeshttps://doi.org/10.1090/s0894-0347-2011-00690-5openalex-snapshot
Intersecting families of permutations
inferred← citeshttps://doi.org/10.1090/s0894-0347-99-00305-7openalex-snapshot
Sharp thresholds of graph properties, and the $k$-sat problem
inferred← citeshttps://doi.org/10.1109/allerton.2015.7447063openalex-snapshot
Reverse hypercontractivity using information measures
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214437openalex-snapshot
Vertex cover might be hard to approximate to within 2-ε
inferred← citeshttps://doi.org/10.1109/ccc.2005.20openalex-snapshot
On the Hardness of Approximating Multicut and Sparsest-Cut
inferred← citeshttps://doi.org/10.1109/ccc.2006.25openalex-snapshot
Learning Monotone Decision Trees in Polynomial Time
inferred← citeshttps://doi.org/10.1109/ccc.2006.5openalex-snapshot
A 3-Query Non-Adaptive PCP with Perfect Completeness
inferred← citeshttps://doi.org/10.1109/ccc.2009.8openalex-snapshot
Improved Approximation of Linear Threshold Functions
inferred← citeshttps://doi.org/10.1109/ccc.2010.19openalex-snapshot
On the Unique Games Conjecture (Invited Survey)
inferred← citeshttps://doi.org/10.1109/ccc.2012.38openalex-snapshot
DNF Sparsification and a Faster Deterministic Counting Algorithm
inferred← citeshttps://doi.org/10.1109/ccc.2013.30openalex-snapshot
Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover
inferred← citeshttps://doi.org/10.1109/ccc.2014.20openalex-snapshot
Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates
inferred← citeshttps://doi.org/10.1109/focs.2004.49openalex-snapshot
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
inferred← citeshttps://doi.org/10.1109/focs.2009.23openalex-snapshot
Optimal Long Code Test with One Free Bit
inferred← citeshttps://doi.org/10.1109/focs.2009.78openalex-snapshot
KKL, Kruskal-Katona, and Monotone Nets
inferred← citeshttps://doi.org/10.1109/focs.2010.84openalex-snapshot
Hardness of Finding Independent Sets in Almost 3-Colorable Graphs
inferred← citeshttps://doi.org/10.1109/focs.2012.75openalex-snapshot
Hardness of Finding Independent Sets in Almost q-Colorable Graphs
inferred← citeshttps://doi.org/10.1109/focs.2013.32openalex-snapshot
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
inferred← citeshttps://doi.org/10.1109/focs.2014.17openalex-snapshot
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball
inferred← citeshttps://doi.org/10.1109/focs.2015.61openalex-snapshot
Tight Bounds on Low-Degree Spectral Concentration of Submodular and XOS Functions
inferred← citeshttps://doi.org/10.1109/focs.2018.00062openalex-snapshot
Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion
inferred← citeshttps://doi.org/10.1109/focs.2019.00075openalex-snapshot
Noise Sensitivity on the p -Biased Hypercube
inferred← citeshttps://doi.org/10.1109/ita.2014.6804263openalex-snapshot
Optimal bounds on approximation of submodular and XOS functions by juntas
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181887openalex-snapshot
Testing juntas [combinatorial property testing]
inferred← citeshttps://doi.org/10.1109/sfcs.2005.53openalex-snapshot
Noise stability of functions with low in.uences invariance and optimality
inferred← citeshttps://doi.org/10.1109/sfcs.2005.54openalex-snapshot
Nonembeddability theorems via Fourier analysis
inferred← citeshttps://doi.org/10.1109/tit.2016.2553672openalex-snapshot
On Non-Interactive Simulation of Joint Distributions
inferred← citeshttps://doi.org/10.1109/tvlsi.2021.3111588openalex-snapshot
Design and Evaluation of a Hybrid Chaotic-Bistable Ring PUF
inferred← citeshttps://doi.org/10.1111/j.1468-0262.2004.00543.xopenalex-snapshot
Social Indeterminacy
inferred← citeshttps://doi.org/10.1112/blms.12167openalex-snapshot
Approximation of biased Boolean functions of small total influence by DNFs
inferred← citeshttps://doi.org/10.1137/060660126openalex-snapshot
Improved Lower Bounds for Embeddings into $L_1$
inferred← citeshttps://doi.org/10.1137/060669309openalex-snapshot
Learning Monotone Decision Trees in Polynomial Time
inferred← citeshttps://doi.org/10.1137/1.9781611973402.117openalex-snapshot
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611975505.14openalex-snapshot
Arithmetic Progression Hypergraphs: Examining the Second Moment Method
inferred← citeshttps://doi.org/10.1137/100787325openalex-snapshot
KKL, Kruskal--Katona, and Monotone Nets
inferred← citeshttps://doi.org/10.1137/110855223openalex-snapshot
Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions
inferred← citeshttps://doi.org/10.1137/140958207openalex-snapshot
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
inferred← citeshttps://doi.org/10.1137/s0097539705447372openalex-snapshot
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
inferred← citeshttps://doi.org/10.1142/9789814324359_0013openalex-snapshot
Probabilistically Checkable Proofs and Codes
inferred← citeshttps://doi.org/10.1142/9789814324359_0163openalex-snapshot
Inapproximability of NP-complete Problems, Discrete Fourier Analysis, and Geometry
inferred← citeshttps://doi.org/10.1145/1067309.1067318openalex-snapshot
Guest column: inapproximability results via Long Code based PCPs
inferred← citeshttps://doi.org/10.1145/1132516.1132580openalex-snapshot
On the fourier tails of bounded functions over the discrete cube
inferred← citeshttps://doi.org/10.1145/1374376.1374458openalex-snapshot
Some topics in analysis of boolean functions
inferred← citeshttps://doi.org/10.1145/1806689.1806763openalex-snapshot
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
inferred← citeshttps://doi.org/10.1145/2382559.2382562openalex-snapshot
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity
inferred← citeshttps://doi.org/10.1145/2488608.2488644openalex-snapshot
Sparsest cut on bounded treewidth graphs
inferred← citeshttps://doi.org/10.1145/2554797.2554803openalex-snapshot
On the structure of boolean functions with small spectral norm
inferred← citeshttps://doi.org/10.1145/2692359.2692371openalex-snapshot
Structure and learning of valuation functions
inferred← citeshttps://doi.org/10.1145/2746539.2746595openalex-snapshot
A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds
inferred← citeshttps://doi.org/10.1145/3313276.3316323openalex-snapshot
DNF sparsification beyond sunflowers
inferred← citeshttps://doi.org/10.1145/3357713.3384241openalex-snapshot
Decision List Compression by Mild Random Restrictions
inferred← citeshttps://doi.org/10.1145/3519935.3520040openalex-snapshot
Hypercontractivity on high dimensional expanders
inferred← citeshttps://doi.org/10.1145/3564246.3585116openalex-snapshot
An Analogue of Bonami’s Lemma for Functions on Spaces of Linear Maps, and 2-2 Games
inferred← citeshttps://doi.org/10.1145/3564246.3585205openalex-snapshot
An Optimal “It Ain’t Over Till It’s Over” Theorem
inferred← citeshttps://doi.org/10.1145/3568031openalex-snapshot
On Monotonicity Testing and the 2-to-2 Games Conjecture
inferred← citeshttps://doi.org/10.1145/3568031.3568034openalex-snapshot
Monotonicity Testing and Directed Isoperimetric Inequalities
inferred← citeshttps://doi.org/10.1145/3568031.3568036openalex-snapshot
Pseudo-random Sets in the Grassmann Graph Have Near-Perfect Expansion
inferred← citeshttps://doi.org/10.1145/3568031.3568037openalex-snapshot
The Biased Long Code and Hardness of Vertex Cover
inferred← citeshttps://doi.org/10.1145/3568031.3568038openalex-snapshot
Conclusions and Open Problems
inferred← citeshttps://doi.org/10.1145/3717823.3718187openalex-snapshot
Hypercontractivity on HDX II: Symmetrization and 𝑞-Norms
inferred← citeshttps://doi.org/10.1184/r1/6604301openalex-snapshot
Computational Applications Of Noise Sensitivity
inferred← citeshttps://doi.org/10.1186/1687-4153-2013-1openalex-snapshot
Properties of Boolean networks and methods for their tests
inferred← citeshttps://doi.org/10.1214/21-aop1511openalex-snapshot
Sharp threshold for the Ising perceptron model
inferred← citeshttps://doi.org/10.1214/22-ejp749openalex-snapshot
Log-Sobolev inequality for the multislice, with applications
inferred← citeshttps://doi.org/10.1214/24-aap2120openalex-snapshot
Sharp thresholds in inference of planted subgraphs
inferred← citeshttps://doi.org/10.1214/ecp.v18-1961openalex-snapshot
Sharpness of KKL on Schreier graphs
inferred← citeshttps://doi.org/10.19086/da.3668openalex-snapshot
On the structure of subsets of the discrete cube with small edge boundary
inferred← citeshttps://doi.org/10.19086/da.784openalex-snapshot
Geometric stability via information theory
inferred← citeshttps://doi.org/10.2140/memocs.2018.6.69openalex-snapshot
Around two theorems and a lemma by Lucio Russo
inferred← citeshttps://doi.org/10.25148/etd.fidc010235openalex-snapshot
A Study of Sparse Representation of Boolean Functions
inferred← citeshttps://doi.org/10.26053/0h-00mq-z7g0openalex-snapshot
Bounds for nearest neighbor algorithms and embeddings
inferred← citeshttps://doi.org/10.3390/math8061035openalex-snapshot
On the Lyapunov Exponent of Monotone Boolean Networks †
inferred← citeshttps://doi.org/10.4007/annals.2005.162.439openalex-snapshot
On the hardness of approximating vertex cover
inferred← citeshttps://doi.org/10.4007/annals.2010.171.295openalex-snapshot
Noise stability of functions with low influences: Invariance and optimality
inferred← citeshttps://doi.org/10.4007/annals.2012.176.1.9openalex-snapshot
A structure theorem for Boolean functions with small total influences
inferred← citeshttps://doi.org/10.4171/jems/1441openalex-snapshot
Stability for the complete intersection theorem, and the forbidden intersection problem of Erdős and Sós
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2015.341openalex-snapshot
Improved NP-Inapproximability for 2-Variable Linear Equations
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.13openalex-snapshot
Degree and Sensitivity: Tails of Two Distributions
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2016.24openalex-snapshot
Polynomial Bounds for Decoupling, with Applications
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.45openalex-snapshot
Improved Bounds on Fourier Entropy and Min-Entropy
inferred← citeshttps://doi.org/10.4310/cdm.2019.v2019.n1.a2openalex-snapshot
On the proof of the 2-to-2 Games Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.0909.5011openalex-snapshot
Average sensitivity and noise sensitivity of polynomial threshold functions
inferred← citeshttps://doi.org/10.48550/arxiv.0910.3719openalex-snapshot
Improved Approximation of Linear Threshold Functions
inferred← citeshttps://doi.org/10.48550/arxiv.1101.2913openalex-snapshot
Hypercontractivity and its applications
inferred← citeshttps://doi.org/10.48550/arxiv.1101.5345openalex-snapshot
Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1105.3383openalex-snapshot
Cuts in Cartesian Products of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1202.6680openalex-snapshot
On the Distribution of the Fourier Spectrum of Halfspaces
inferred← citeshttps://doi.org/10.48550/arxiv.1206.6541openalex-snapshot
A Low-Depth Monotone Function that is not an Approximate Junta
inferred← citeshttps://doi.org/10.48550/arxiv.1210.3989openalex-snapshot
A stability result for balanced dictatorships in $S_{n}$
inferred← citeshttps://doi.org/10.48550/arxiv.1307.3301openalex-snapshot
Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas
inferred← citeshttps://doi.org/10.48550/arxiv.1309.3315openalex-snapshot
On the failure of concentration for the \ell_\infty-ball
inferred← citeshttps://doi.org/10.48550/arxiv.1310.8179openalex-snapshot
Almost isoperimetric subsets of the discrete cube
inferred← citeshttps://doi.org/10.48550/arxiv.1311.6958openalex-snapshot
Juntas in the $\ell^{1}$-grid and Lipschitz maps between discrete tori
inferred← citeshttps://doi.org/10.48550/arxiv.1410.7834openalex-snapshot
Friedgut--Kalai--Naor theorem for slices of the Boolean cube
inferred← citeshttps://doi.org/10.48550/arxiv.1702.00753openalex-snapshot
An unified approach to the Junta theorem for discrete and continuous models
inferred← citeshttps://doi.org/10.48550/arxiv.1804.00328openalex-snapshot
Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08522openalex-snapshot
Deep learning generalizes because the parameter-function map is biased towards simple functions
inferred← citeshttps://doi.org/10.48550/arxiv.1911.03748openalex-snapshot
Quantum speedups need structure
inferred← citeshttps://doi.org/10.48550/arxiv.1911.07375openalex-snapshot
Top-down induction of decision trees: rigorous guarantees and inherent limitations
inferred← citeshttps://doi.org/10.48550/arxiv.2103.04604openalex-snapshot
Global hypercontractivity and its applications
inferred← citeshttps://doi.org/10.48550/arxiv.2103.16811openalex-snapshot
A Generalization of a Theorem of Rothschild and van Lint
showing the first 200 of 211 · page through all 211
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.