Yuval Filmus

Orcid: 0000-0002-1739-0872

According to our database1, Yuval Filmus authored at least 85 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Boolean Function Analysis on High-Dimensional Expanders.
Comb., June, 2024

Limits of Preprocessing.
Comput. Complex., June, 2024

Optimal Sets of Questions for Twenty Questions.
SIAM J. Discret. Math., March, 2024

Lifting dichotomies.
Electron. Colloquium Comput. Complex., 2024

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs.
CoRR, 2024

2023
MaxSAT Resolution and Subcube Sums.
ACM Trans. Comput. Log., January, 2023

Sampling and Certifying Symmetric Functions.
Electron. Colloquium Comput. Complex., 2023

Proving Unsatisfiability with Hitting Formulas.
Electron. Colloquium Comput. Complex., 2023

Generalized Polymorphisms.
CoRR, 2023

Irreducible Subcube Partitions.
Electron. J. Comb., 2023

Junta Threshold for Low Degree Boolean Functions on the Slice.
Electron. J. Comb., 2023

Bounded Simultaneous Messages.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Irreducible subcube partitions.
CoRR, 2022

Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems.
CoRR, 2022

Approximate polymorphisms.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

A Resilient Distributed Boosting Algorithm.
Proceedings of the International Conference on Machine Learning, 2022

2021
Tight Approximation for Unconstrained XOS Maximization.
Math. Oper. Res., 2021

Bounded Indistinguishability for Simple Sources.
Electron. Colloquium Comput. Complex., 2021

Almost linear Boolean functions on S<sub>n</sub> are almost unions of cosets.
CoRR, 2021

Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Explicit SoS Lower Bounds from High-Dimensional Expanders.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

The Entropy of Lies: Playing Twenty Questions with a Liar.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

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

2020
Special Issue: CCC 2019: Guest Editor's Foreword.
Theory Comput., 2020

Online submodular maximization: beating 1/2 made simple.
Math. Program., 2020

Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC<sup>0</sup>.
Electron. Colloquium Comput. Complex., 2020

Explicit and structured sum of squares lower bounds from high dimensional expanders.
Electron. Colloquium Comput. Complex., 2020

FKN theorem for the multislice, with applications.
Comb. Probab. Comput., 2020

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

Hypercontractivity on the symmetric group.
CoRR, 2020

A Sauer-Shelah-Perles Lemma for Lattices.
Electron. J. Comb., 2020

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

2019
Another look at degree lower bounds for polynomial calculus.
Theor. Comput. Sci., 2019

Analyzing Power in Weighted Voting Games with Super-Increasing Weights.
Theory Comput. Syst., 2019

Boolean degree 1 functions on some classical association schemes.
J. Comb. Theory A, 2019

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions.
Electron. Colloquium Comput. Complex., 2019

Query-to-Communication Lifting Using Low-Discrepancy Gadgets.
Electron. Colloquium Comput. Complex., 2019

Boolean constant degree functions on the slice are juntas.
Discret. Math., 2019

More complete intersection theorems.
Discret. Math., 2019

Asymptotic performance of the Grimmett-McDiarmid heuristic.
CoRR, 2019

Twenty (Short) Questions.
Comb., 2019

Information Complexity of the AND Function in the Two-Party and Multi-party Settings.
Algorithmica, 2019

Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract].
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Log-Sobolev Inequality for the Multislice, with Applications.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Query-To-Communication Lifting for BPP Using Inner Product.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Invariance Principle on the Slice.
ACM Trans. Comput. Theory, 2018

Trading Information Complexity for Error.
Theory Comput., 2018

Boolean functions on high-dimensional expanders.
CoRR, 2018

2017
The weighted complete intersection theorem.
J. Comb. Theory A, 2017

Agreement tests on graphs and hypergraphs.
Electron. Colloquium Comput. Complex., 2017

Low degree almost Boolean functions are sparse juntas.
Electron. Colloquium Comput. Complex., 2017

Information complexity of the AND function in the two-Party, and multiparty settings.
CoRR, 2017

Twenty (simple) questions.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016
Shapley Values in Weighted Voting Games with Random Weights.
CoRR, 2016

An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube.
Electron. J. Comb., 2016

Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube.
Chic. J. Theor. Comput. Sci., 2016

Semantic Versus Syntactic Cutting Planes.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

A Characterization of Voting Power for Discrete Weight Distributions.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Harmonicity and Invariance on Slices of the Boolean Cube.
Proceedings of the 31st Conference on Computational Complexity, 2016

2015
Exponential Lower Bounds for AC<sup>0</sup>-Frege Imply Superpolynomial Frege Lower Bounds.
ACM Trans. Comput. Theory, 2015

From Small Space to Small Width in Resolution.
ACM Trans. Comput. Log., 2015

A stability result for balanced dictatorships in S<sub>n</sub>.
Random Struct. Algorithms, 2015

A quasi-stability result for dictatorships in S n.
Comb., 2015

Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Spectral Methods in Extremal Combinatorics.
PhD thesis, 2014

The complexity of the comparator circuit value problem.
ACM Trans. Comput. Theory, 2014

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search.
SIAM J. Comput., 2014

Fast Matrix Multiplication: Limitations of the Laser Method.
Electron. Colloquium Comput. Complex., 2014

Power Distribution in Randomized Weighted Voting: the Effects of the Quota.
CoRR, 2014

A SageTeX Hypermatrix Algebra Package.
CoRR, 2014

Bounds on the sum of L1 influences.
CoRR, 2014

Efficient voting via the top-k elicitation scheme: a probabilistic approach.
Proceedings of the ACM Conference on Economics and Computation, 2014

2013
Inequalities on submodular functions via term rewriting.
Inf. Process. Lett., 2013

Average Case Lower Bounds for Monotone Switching Networks.
Electron. Colloquium Comput. Complex., 2013

Universal codes of the natural numbers.
Log. Methods Comput. Sci., 2013

Efficient Vote Elicitation under Candidate Uncertainty.
Proceedings of the IJCAI 2013, 2013

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Space Complexity in Polynomial Calculus.
Electron. Colloquium Comput. Complex., 2012

The Power of Local Search: Maximum Coverage over a Matroid.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

Automatic web-scale information extraction.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011
Lower bounds for context-free grammars.
Inf. Process. Lett., 2011

2010
Threshold Models for Competitive Influence in Social Networks.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010


  Loading...