| Publication | Date of Publication | Type |
|---|
Sampling and certifying symmetric functions
| 2025-01-14 | Paper |
Sparse juntas on the biased hypercube
TheoretiCS | 2024-08-13 | Paper |
Limits of preprocessing
Computational Complexity | 2024-08-01 | Paper |
Boolean function analysis on high-dimensional expanders
Combinatorica | 2024-05-31 | Paper |
A note on “Largest independent sets of certain regular subgraphs of the derangement graph”
Journal of Algebraic Combinatorics | 2024-04-24 | Paper |
scientific article; zbMATH DE number 7829258 (Why is no real title available?)
| 2024-04-09 | Paper |
Irreducible subcube partitions
The Electronic Journal of Combinatorics | 2024-02-23 | Paper |
Optimal Sets of Questions for Twenty Questions
SIAM Journal on Discrete Mathematics | 2024-01-23 | Paper |
Hypercontractivity on the symmetric group
Forum of Mathematics, Sigma | 2024-01-18 | Paper |
scientific article; zbMATH DE number 7789147 (Why is no real title available?)
Theory of Computing | 2024-01-16 | Paper |
Approximate polymorphisms
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
MC-finiteness of restricted set partition functions
| 2023-08-28 | Paper |
Harmonic polynomials on perfect matchings
Séminaire Lotharingien de Combinatoire | 2023-06-05 | Paper |
Generalized polymorphisms
| 2023-05-17 | Paper |
High dimensional Hoffman bound and applications in extremal combinatorics
Algebraic Combinatorics | 2023-04-20 | Paper |
Junta threshold for low degree Boolean functions on the slice
The Electronic Journal of Combinatorics | 2023-04-19 | Paper |
Proving Unsatisfiability with Hitting Formulas
| 2023-02-13 | Paper |
MaxSAT Resolution and Subcube Sums
ACM Transactions on Computational Logic | 2023-02-07 | Paper |
Affine vector space partitions
| 2022-11-29 | Paper |
Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings
| 2022-10-01 | Paper |
scientific article; zbMATH DE number 7561551 (Why is no real title available?)
| 2022-07-21 | Paper |
Query-to-communication lifting for BPP using inner product
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561745 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559077 (Why is no real title available?)
| 2022-07-18 | Paper |
Log-Sobolev inequality for the multislice, with applications
Electronic Journal of Probability | 2022-03-30 | Paper |
Junta threshold for low degree Boolean functions on the slice
| 2022-03-09 | Paper |
Boolean functions on \(S_n\) which are nearly linear
discrete Analysis | 2022-02-10 | Paper |
Tight approximation for unconstrained XOS maximization
Mathematics of Operations Research | 2022-02-08 | Paper |
Simple Algebraic Proofs of Uniqueness for Erd\H{o}s-Ko-Rado Theorems
| 2022-01-08 | Paper |
Boolean function analysis on high-dimensional expanders
| 2021-08-04 | Paper |
FKN theorem for the multislice, with applications
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
MaxSAT resolution and subcube sums
| 2021-04-07 | Paper |
Query-to-communication lifting using low-discrepancy gadgets
SIAM Journal on Computing | 2021-03-24 | Paper |
AND testing and robust judgement aggregation
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A Sauer-Shelah-Perles lemma for lattices
The Electronic Journal of Combinatorics | 2020-11-05 | Paper |
Complexity Measures on the Symmetric Group and Beyond
| 2020-10-14 | Paper |
Explicit SoS lower bounds from high-dimensional expanders
| 2020-09-10 | Paper |
Online submodular maximization: beating 1/2 made simple
Mathematical Programming. Series A. Series B | 2020-08-28 | Paper |
scientific article; zbMATH DE number 7204267 (Why is no real title available?)
| 2020-05-26 | Paper |
On the Bhattacharya-Mesner rank of third order hypermatrices
Linear Algebra and its Applications | 2020-04-21 | Paper |
Online submodular maximization: beating 1/2 made simple
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Asymptotic performance of the Grimmett-McDiarmid heuristic
| 2019-12-10 | Paper |
Invariance principle on the slice
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Another look at degree lower bounds for polynomial calculus
Theoretical Computer Science | 2019-11-13 | Paper |
Harmonicity and invariance on slices of the Boolean cube
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2019-11-07 | Paper |
High dimensional Hoffman bound and applications in extremal combinatorics
| 2019-11-06 | Paper |
AND Testing and Robust Judgement Aggregation
| 2019-10-31 | Paper |
Boolean constant degree functions on the slice are juntas
Discrete Mathematics | 2019-10-17 | Paper |
Information complexity of the AND function in the two-party and multi-party settings
Algorithmica | 2019-10-17 | Paper |
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Twenty (short) questions
Combinatorica | 2019-09-04 | Paper |
Analyzing power in weighted voting games with super-increasing weights
Theory of Computing Systems | 2019-03-21 | Paper |
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions
| 2019-02-20 | Paper |
Boolean degree 1 functions on some classical association schemes
Journal of Combinatorial Theory. Series A | 2018-12-19 | Paper |
More complete intersection theorems
Discrete Mathematics | 2018-11-13 | Paper |
The entropy of lies: playing twenty questions with a liar
| 2018-11-06 | Paper |
Trading information complexity for error
Theory of Computing | 2018-06-15 | Paper |
LOW-DEGREE BOOLEAN FUNCTIONS ON , WITH AN APPLICATION TO ISOPERIMETRY
Forum of Mathematics, Sigma | 2018-04-23 | Paper |
Semantic versus syntactic cutting planes
| 2018-01-24 | Paper |
Information complexity of the AND function in the two-party and multi-party settings
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Invariance principle on the slice
| 2017-10-10 | Paper |
Harmonicity and invariance on slices of the Boolean cube
| 2017-10-10 | Paper |
Twenty (simple) questions
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
The weighted complete intersection theorem
Journal of Combinatorial Theory. Series A | 2017-07-13 | Paper |
From small space to small width in resolution
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
A comment on Intersecting Families of Permutations
| 2017-06-30 | Paper |
A quasi-stability result for dictatorships in \(S_n\)
Combinatorica | 2017-03-31 | Paper |
From small space to small width in resolution
| 2017-03-03 | Paper |
On the spectra of hypermatrix direct sum and Kronecker products constructions
Linear Algebra and its Applications | 2017-02-23 | Paper |
Friedgut-Kalai-Naor theorem for slices of the Boolean cube
Chicago Journal of Theoretical Computer Science | 2016-12-21 | Paper |
The complexity of the comparator circuit value problem
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Exponential lower bounds for \(\mathrm{AC}^0\)-Frege imply superpolynomial Frege lower bounds
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Ahlswede-Khachatrian Theorems: Weighted, Infinite, and Hamming
| 2016-10-03 | Paper |
Analyzing power in weighted voting games with super-increasing weights
Algorithmic Game Theory | 2016-09-29 | Paper |
On the sum of the \(L_1\) influences of bounded functions
Israel Journal of Mathematics | 2016-09-15 | Paper |
An orthogonal basis for functions over a slice of the Boolean hypercube
The Electronic Journal of Combinatorics | 2016-02-11 | Paper |
Space Complexity in Polynomial Calculus
SIAM Journal on Computing | 2015-09-02 | Paper |
Fast matrix multiplication: limitations of the Coppersmith-Winograd method (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
A stability result for balanced dictatorships in \(S_n\)
Random Structures & Algorithms | 2015-05-29 | Paper |
Monotone submodular maximization over a matroid via non-oblivious local search
SIAM Journal on Computing | 2014-07-30 | Paper |
Inequalities on submodular functions via term rewriting
Information Processing Letters | 2014-04-11 | Paper |
A SageTeX Hypermatrix Algebra Package
| 2014-03-11 | Paper |
Universal codes of the natural numbers
Logical Methods in Computer Science | 2013-09-06 | Paper |
Towards an understanding of polynomial calculus: new separations and lower bounds (extended abstract)
Automata, Languages, and Programming | 2013-08-06 | Paper |
Lower bounds for context-free grammars
Information Processing Letters | 2013-04-04 | Paper |
A stability result for balanced dictatorships in $S_{n}$
| 2012-10-15 | Paper |
The power of local search: maximum coverage over a matroid
| 2012-08-23 | Paper |
Triangle-intersecting families of graphs
Journal of the European Mathematical Society (JEMS) | 2012-04-20 | Paper |
Exponential lower bounds for \(\mathrm{AC}^{0}\)-Frege imply superpolynomial Frege lower bounds
Automata, Languages and Programming | 2011-07-06 | Paper |
Triangle-intersecting families on eight vertices
| 2011-02-08 | Paper |
Boolean functions on high-dimensional expanders
| N/A | Paper |
Sparse juntas on the biased hypercube
| N/A | Paper |
Sparse graph counting and Kelley-Meka bounds for binary systems
| N/A | Paper |
