Threshold Models for Competitive Influence in Social Networks. - Allan Borodin; Yuval Filmus; Joel Oren (WINE, 2010)

Lower bounds for context-free grammars. - Yuval Filmus (Inf. Process. Lett., 2011)

A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint. - Yuval Filmus; Justin Ward (FOCS, 2012)

Automatic web-scale information extraction. - Philip Bohannon; Nilesh N. Dalvi; Yuval Filmus; Nori Jacoby; S. Sathiya Keerthi; Alok Kirpal (SIGMOD Conference, 2012)

The Power of Local Search: Maximum Coverage over a Matroid. - Yuval Filmus; Justin Ward (STACS, 2012)

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). - Yuval Filmus; Massimo Lauria; Mladen Miksa; Jakob Nordström; Marc Vinyals (ICALP (1), 2013)

Efficient Vote Elicitation under Candidate Uncertainty. - Joel Oren; Yuval Filmus; Craig Boutilier (IJCAI, 2013)

Universal codes of the natural numbers. - Yuval Filmus (Log. Methods Comput. Sci., 2013)

Average Case Lower Bounds for Monotone Switching Networks. - Yuval Filmus; Toniann Pitassi; Robert Robere; Stephen A. Cook (Electron. Colloquium Comput. Complex., 2013)

Inequalities on submodular functions via term rewriting. - Yuval Filmus (Inf. Process. Lett., 2013)

Efficient voting via the top-k elicitation scheme: a probabilistic approach. - Yuval Filmus; Joel Oren (EC, 2014)

Bounds on the sum of L1 influences. - Yuval Filmus; Hamed Hatami (CoRR, 2014)

A SageTeX Hypermatrix Algebra Package. - Edinah K. Gnang; Ori Parzanchevski; Yuval Filmus (CoRR, 2014)

Power Distribution in Randomized Weighted Voting: the Effects of the Quota. - Joel Oren; Yuval Filmus; Yair Zick; Yoram Bachrach (CoRR, 2014)

Fast Matrix Multiplication: Limitations of the Laser Method. - Andris Ambainis; Yuval Filmus; François Le Gall (Electron. Colloquium Comput. Complex., 2014)

From Small Space to Small Width in Resolution. - Yuval Filmus; Massimo Lauria; Mladen Miksa; Jakob Nordström; Marc Vinyals (Electron. Colloquium Comput. Complex., 2014)

Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search. - Yuval Filmus; Justin Ward (SIAM J. Comput., 2014)

The complexity of the comparator circuit value problem. - Stephen A. Cook; Yuval Filmus; Dai Tri Man Le (ACM Trans. Comput. Theory, 2014)

Spectral Methods in Extremal Combinatorics. - Yuval Filmus (2014)

Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method. - Andris Ambainis; Yuval Filmus; François Le Gall (STOC, 2015)

A quasi-stability result for dictatorships in S n. - David Ellis; Yuval Filmus; Ehud Friedgut (Comb., 2015)

A stability result for balanced dictatorships in Sn. - David Ellis; Yuval Filmus; Ehud Friedgut (Random Struct. Algorithms, 2015)

Space Complexity in Polynomial Calculus. - Yuval Filmus; Massimo Lauria; Jakob Nordström; Noga Ron-Zewi; Neil Thapen (SIAM J. Comput., 2015)

Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. - Yuval Filmus; Toniann Pitassi; Rahul Santhanam (ACM Trans. Comput. Theory, 2015)

Harmonicity and Invariance on Slices of the Boolean Cube. - Yuval Filmus; Elchanan Mossel (CCC, 2016)

A Characterization of Voting Power for Discrete Weight Distributions. - Yoram Bachrach; Yuval Filmus; Joel Oren; Yair Zick (IJCAI, 2016)

Semantic Versus Syntactic Cutting Planes. - Yuval Filmus; Pavel Hrubes; Massimo Lauria (STACS, 2016)

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

An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube. - Yuval Filmus (Electron. J. Comb., 2016)

Shapley Values in Weighted Voting Games with Random Weights. - Yuval Filmus; Joel Oren; Kannan Soundararajan (CoRR, 2016)

Trading information complexity for error. - Yuval Dagan; Yuval Filmus; Hamed Hatami; Yaqiao Li (Electron. Colloquium Comput. Complex., 2016)

Twenty (simple) questions. - Yuval Dagan; Yuval Filmus; Ariel Gabizon; Shay Moran (STOC, 2017)

Information complexity of the AND function in the two-Party, and multiparty settings. - Yuval Filmus; Hamed Hatami; Yaqiao Li; Suzin You (CoRR, 2017)

Low degree almost Boolean functions are sparse juntas. - Irit Dinur; Yuval Filmus; Prahladh Harsha (Electron. Colloquium Comput. Complex., 2017)

The weighted complete intersection theorem. - Yuval Filmus (J. Comb. Theory A, 2017)

Boolean functions on high-dimensional expanders. - Yotam Dikstein; Irit Dinur; Yuval Filmus; Prahladh Harsha (CoRR, 2018)

Boolean function analysis on high-dimensional expanders. - Irit Dinur; Yotam Dikstein; Yuval Filmus; Prahladh Harsha (Electron. Colloquium Comput. Complex., 2018)

Invariance Principle on the Slice. - Yuval Filmus; Guy Kindler; Elchanan Mossel; Karl Wimmer (ACM Trans. Comput. Theory, 2018)

Query-To-Communication Lifting for BPP Using Inner Product. - Arkadev Chattopadhyay; Yuval Filmus; Sajin Koroth; Or Meir; Toniann Pitassi (ICALP, 2019)

A Log-Sobolev Inequality for the Multislice, with Applications. - Yuval Filmus; Ryan O'Donnell; Xinyu Wu (ITCS, 2019)

Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. - Irit Dinur; Yuval Filmus; Prahladh Harsha (SODA, 2019)

Information Complexity of the AND Function in the Two-Party and Multi-party Settings. - Yuval Filmus; Hamed Hatami; Yaqiao Li; Suzin You (Algorithmica, 2019)

Twenty (Short) Questions. - Yuval Dagan; Yuval Filmus; Ariel Gabizon; Shay Moran (Comb., 2019)

Asymptotic performance of the Grimmett-McDiarmid heuristic. - Yuval Filmus (CoRR, 2019)

More complete intersection theorems. - Yuval Filmus (Discret. Math., 2019)

Boolean constant degree functions on the slice are juntas. - Yuval Filmus; Ferdinand Ihringer (Discret. Math., 2019)

Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. - Yuval Filmus; Lianna Hambardzumyan; Hamed Hatami; Pooya Hatami; David Zuckerman (Electron. Colloquium Comput. Complex., 2019)

Boolean degree 1 functions on some classical association schemes. - Yuval Filmus; Ferdinand Ihringer (J. Comb. Theory A, 2019)

Analyzing Power in Weighted Voting Games with Super-Increasing Weights. - Yuval Filmus; Joel Oren; Yair Zick; Yoram Bachrach (Theory Comput. Syst., 2019)

Another look at degree lower bounds for polynomial calculus. - Yuval Filmus (Theor. Comput. Sci., 2019)

AND testing and robust judgement aggregation. - Yuval Filmus; Noam Lifshitz; Dor Minzer; Elchanan Mossel (STOC, 2020)

A Sauer-Shelah-Perles Lemma for Lattices. - Stijn Cambie; Bogdan Chornomaz; Zeev Dvir; Yuval Filmus; Shay Moran (Electron. J. Comb., 2020)

Hypercontractivity on the symmetric group. - Yuval Filmus; Guy Kindler; Noam Lifshitz; Dor Minzer (CoRR, 2020)

Complexity Measures on the Symmetric Group and Beyond. - Neta Dafni; Yuval Filmus; Noam Lifshitz; Nathan Lindzey; Marc Vinyals (CoRR, 2020)

FKN theorem for the multislice, with applications. - Yuval Filmus (Comb. Probab. Comput., 2020)

Explicit and structured sum of squares lower bounds from high dimensional expanders. - Irit Dinur; Yuval Filmus; Prahladh Harsha; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2020)

MaxSAT Resolution and Subcube Sums. - Yuval Filmus; Meena Mahajan; Gaurav Sood 001; Marc Vinyals (Electron. Colloquium Comput. Complex., 2020)

Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0. - Yuval Filmus; Or Meir; Avishay Tal (Electron. Colloquium Comput. Complex., 2020)

Online submodular maximization: beating 1/2 made simple. - Niv Buchbinder; Moran Feldman; Yuval Filmus; Mohit Garg 003 (Math. Program., 2020)

Special Issue: CCC 2019: Guest Editor's Foreword. - Yuval Filmus (Theory Comput., 2020)

Complexity Measures on the Symmetric Group and Beyond (Extended Abstract). - Neta Dafni; Yuval Filmus; Noam Lifshitz; Nathan Lindzey; Marc Vinyals (ITCS, 2021)

The Entropy of Lies: Playing Twenty Questions with a Liar. - Yuval Dagan; Yuval Filmus; Daniel Kane 001; Shay Moran (ITCS, 2021)

Explicit SoS Lower Bounds from High-Dimensional Expanders. - Irit Dinur; Yuval Filmus; Prahladh Harsha; Madhur Tulsiani (ITCS, 2021)

Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract). - Yuval Filmus; Or Meir; Avishay Tal (ITCS, 2021)

Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. - Ofir Gordon; Yuval Filmus; Oren Salzman (SOCS, 2021)

Almost linear Boolean functions on Sn are almost unions of cosets. - Yuval Filmus (CoRR, 2021)

Bounded Indistinguishability for Simple Sources. - Andrej Bogdanov; Krishnamoorthy Dinesh 001; Yuval Filmus; Yuval Ishai; Avi Kaplan; Akshayaram Srinivasan (Electron. Colloquium Comput. Complex., 2021)

Tight Approximation for Unconstrained XOS Maximization. - Yuval Filmus; Yasushi Kawase; Yusuke Kobayashi 001; Yutaro Yamaguchi 001 (Math. Oper. Res., 2021)

Query-to-Communication Lifting Using Low-Discrepancy Gadgets. - Arkadev Chattopadhyay; Yuval Filmus; Sajin Koroth; Or Meir; Toniann Pitassi (SIAM J. Comput., 2021)

A Resilient Distributed Boosting Algorithm. - Yuval Filmus; Idan Mehalel; Shay Moran (ICML, 2022)

Approximate polymorphisms. - Gilad Chase; Yuval Filmus; Dor Minzer; Elchanan Mossel; Nitin Saurabh (STOC, 2022)

Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems. - Yuval Filmus; Nathan Lindzey (CoRR, 2022)

Irreducible subcube partitions. - Yuval Filmus; Edward A. Hirsch; Sascha Kurz; Ferdinand Ihringer; Artur Riazanov; Alexander Smal; Marc Vinyals (CoRR, 2022)

Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension. - Yuval Filmus; Steve Hanneke; Idan Mehalel; Shay Moran (COLT, 2023)

Bounded Simultaneous Messages. - Andrej Bogdanov; Krishnamoorthy Dinesh 001; Yuval Filmus; Yuval Ishai; Avi Kaplan; Sruthi Sekar (FSTTCS, 2023)

Junta Threshold for Low Degree Boolean Functions on the Slice. - Yuval Filmus (Electron. J. Comb., 2023)

Irreducible Subcube Partitions. - Yuval Filmus; Edward A. Hirsch; Sascha Kurz; Ferdinand Ihringer; Artur Ryazanov; Alexander V. Smal; Marc Vinyals (Electron. J. Comb., 2023)

Generalized Polymorphisms. - Gilad Chase; Yuval Filmus (CoRR, 2023)

Proving Unsatisfiability with Hitting Formulas. - Yuval Filmus; Edward A. Hirsch; Artur Riazanov; Alexander Smal; Marc Vinyals (Electron. Colloquium Comput. Complex., 2023)

Sampling and Certifying Symmetric Functions. - Yuval Filmus; Itai Leigh; Artur Riazanov; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2023)

Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems. - Yuval Filmus; Hamed Hatami; Kaave Hosseini; Esty Kelman (FOCS, 2024)

Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs. - Yuval Filmus; Steve Hanneke; Idan Mehalel; Shay Moran (NeurIPS, 2024)

Lifting dichotomies. - Yaroslav Alekseev; Yuval Filmus; Alexander Smal (Electron. Colloquium Comput. Complex., 2024)

Special Section on the Sixty-First Annual IEEE Symposium on Foundations of Computer Science (2020). - Yuval Filmus; Elena Grigorescu; Sungjin Im; Yi Li (SIAM J. Comput., 2024)

Sparse juntas on the biased hypercube. - Irit Dinur; Yuval Filmus; Prahladh Harsha (TheoretiCS, 2024)

Optimal Sets of Questions for Twenty Questions. - Yuval Filmus; Idan Mehalel (SIAM J. Discret. Math., 2024)

Limits of Preprocessing. - Yuval Filmus; Yuval Ishai; Avi Kaplan; Guy Kindler (Comput. Complex., 2024)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint. - Yuval Filmus; Roy Schwartz 002; Alexander V. Smal (IPCO, 2025)

Approximate polymorphisms of predicates. - Yaroslav Alekseev; Yuval Filmus (Electron. Colloquium Comput. Complex., 2025)

Catalytic Computing and Register Programs Beyond Log-Depth. - Yaroslav Alekseev; Yuval Filmus; Ian Mertz; Alexander Smal; Antoine Vinciguerra (Electron. Colloquium Comput. Complex., 2025)

Agreement Tests on Graphs and Hypergraphs. - Irit Dinur; Yuval Filmus; Prahladh Harsha (SIAM J. Comput., 2025)

Aggregation of evaluations without unanimity. - Yuval Filmus (CoRR, 2025)

Affine vector space partitions. - John Bamberg; Yuval Filmus; Ferdinand Ihringer; Sascha Kurz (Des. Codes Cryptogr., 2025)

Courcelle's Theorem Without Logic. - Yuval Filmus; Johann A. Makowsky (CoRR, 2025)

Sensitivity and Hamming graphs. - Sara Asensio; Yuval Filmus; Ignacio García-Marco; Kolja Knauer (CoRR, 2025)