| 2026 | COLT | Optimal Reconstruction from Linear Queries. | Yuval Filmus, Shay Moran, Elizaveta Nesterova |
| 2025 | IPCO | Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint. | Yuval Filmus, Roy Schwartz, Alexander V. Smal |
| 2025 | MFCS | Catalytic Computing and Register Programs Beyond Log-Depth. | Yaroslav Alekseev, Yuval Filmus, Ian Mertz, Alexander Smal, Antoine Vinciguerra |
| 2024 | FOCS | Sparse Graph Counting and Kelley-Meka Bounds for Binary Systems. | Yuval Filmus, Hamed Hatami, Kaave Hosseini, Esty Kelman |
| 2023 | COLT | Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension. | Yuval Filmus, Steve Hanneke, Idan Mehalel, Shay Moran |
| 2022 | ICML | A Resilient Distributed Boosting Algorithm. | Yuval Filmus, Idan Mehalel, Shay Moran |
| 2022 | STOC | Approximate polymorphisms. | Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh |
| 2021 | SoCS | Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. | Ofir Gordon, Yuval Filmus, Oren Salzman |
| 2020 | STOC | AND testing and robust judgement aggregation. | Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel |
| 2020 | SAT | MaxSAT Resolution and Subcube Sums. | Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals |
| 2019 | ICALP | Query-To-Communication Lifting for BPP Using Inner Product. | Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi |
| 2019 | ICALP | Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. | Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman |
| 2019 | IPCO | Online Submodular Maximization: Beating 1/2 Made Simple. | Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg |
| 2019 | SODA | Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. | Irit Dinur, Yuval Filmus, Prahladh Harsha |
| 2017 | COCOON | Information Complexity of the AND Function in the Two-Party and Multi-party Settings. | Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You |
| 2017 | STOC | Twenty (simple) questions. | Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran |
| 2016 | IJCAI | A Characterization of Voting Power for Discrete Weight Distributions. | Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick |
| 2016 | STACS | Semantic Versus Syntactic Cutting Planes. | Yuval Filmus, Pavel Hrubes, Massimo Lauria |
| 2016 | SAGT | Analyzing Power in Weighted Voting Games with Super-Increasing Weights. | Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick |
| 2015 | STOC | Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method. | Andris Ambainis, Yuval Filmus, Franois Le Gall |
| 2014 | STACS | From Small Space to Small Width in Resolution. | Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordstrm, Marc Vinyals |
| 2013 | FOCS | Average Case Lower Bounds for Monotone Switching Networks. | Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook |
| 2013 | ICALP | Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). | Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordstrm, Marc Vinyals |
| 2013 | IJCAI | Efficient Vote Elicitation under Candidate Uncertainty. | Joel Oren, Yuval Filmus, Craig Boutilier |
| 2012 | FOCS | A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint. | Yuval Filmus, Justin Ward |
| 2012 | SIGMOD | Automatic web-scale information extraction. | Philip Bohannon, Nilesh N. Dalvi, Yuval Filmus, Nori Jacoby, S. Sathiya Keerthi, Alok Kirpal |
| 2012 | STACS | The Power of Local Search: Maximum Coverage over a Matroid. | Yuval Filmus, Justin Ward |
| 2011 | ICALP | Exponential Lower Bounds for AC | Yuval Filmus, Toniann Pitassi, Rahul Santhanam |