Yuval Filmus

View Scopus Profile

Yuval Filmus

Assoc. Prof.

Former affiliation
 https://orcid.org/0000-0002-1739-0872

    Accepting PhD Students

    Calculated based on number of publications stored in Pure and citations from Scopus
    20102024

    Research activity per year

    Search results

    • 2024

      A note on “Largest independent sets of certain regular subgraphs of the derangement graph”

      Filmus, Y. & Lindzey, N., 2024, (Accepted/In press) In: Journal of Algebraic Combinatorics.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Boolean Function Analysis on High-Dimensional Expanders

      Dikstein, Y., Dinur, I., Filmus, Y. & Harsha, P., 2024, (Accepted/In press) In: Combinatorica.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Hypercontractivity on the symmetric group

      Filmus, Y., Kindler, G., Lifshitz, N. & Minzer, D., 8 Jan 2024, In: Forum of Mathematics, Sigma. 12, e6.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • OPTIMAL SETS OF QUESTIONS FOR TWENTY QUESTIONS

      Filmus, Y. & Mehalel, I., 2024, In: SIAM Journal on Discrete Mathematics. 38, 1, p. 412-452 41 p.

      Research output: Contribution to journal › Article › peer-review

    • Proving Unsatisfiability with Hitting Formulas

      Filmus, Y., Hirsch, E. A., Riazanov, A., Smal, A. & Vinyals, M., Jan 2024, 15th Innovations in Theoretical Computer Science Conference, ITCS 2024. Guruswami, V. (ed.). 48. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 287).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2023

      Affine vector space partitions

      Bamberg, J., Filmus, Y., Ihringer, F. & Kurz, S., 2023, (Accepted/In press) In: Designs, Codes, and Cryptography.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      1 Scopus citations

    • Bounded Simultaneous Messages

      Bogdanov, A., Dinesh, K., Filmus, Y., Ishai, Y., Kaplan, A. & Sekar, S., Dec 2023, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023. Bouyer, P., Srinivasan, S. & Srinivasan, S. (eds.). 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 284).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Irreducible Subcube Partitions

      Filmus, Y., Hirsch, E. A., Kurz, S., Ihringer, F., Riazanov, A., Smal, A. & Vinyals, M., 8 Sep 2023, In: Electronic Journal of Combinatorics. 30, 3, 3.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      1 Scopus citations

    • Junta threshold for low degree Boolean functions on the slice

      Filmus, Y., 2023, In: Electronic Journal of Combinatorics. 30, 1, p. 1-55 55 p., P1.55.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • MaxSAT Resolution and Subcube Sums

      Filmus, Y., Mahajan, M., Sood, G. & Vinyals, M., 18 Jan 2023, In: ACM Transactions on Computational Logic. 24, 1, 3565363.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      2 Scopus citations

    • MC-Finiteness of Restricted Set Partition Functions

      Filmus, Y., Fischer, E., Makowsky, J. A. & Rakita, V., 2023, In: Journal of Integer Sequences. 26, 7, 23.7.4.

      Research output: Contribution to journal › Article › peer-review

      1 Scopus citations

    • Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension

      Filmus, Y., Hanneke, S., Mehalel, I. & Moran, S., 2023, In: Proceedings of Machine Learning Research. 195, p. 773-836 64 p.

      Research output: Contribution to journal › Conference article › peer-review

    • Proving Unsatisfiability with Hitting Formulas

      Filmus, Y., Hirsch, E. A., Riazanov, A., Smal, A. & Vinyals, M., 2023

      Research output: Book/Report › Report

    • Sampling and Certifying Symmetric Functions

      Filmus, Y., Leigh, I., Riazanov, A. & Sokolov, D., Sep 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Megow, N. & Smith, A. (eds.). 36. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 275).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      1 Scopus citations
    • 2022

      Approximate polymorphisms

      Chase, G., Filmus, Y., Minzer, D., Mossel, E. & Saurabh, N., 6 Sep 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). p. 195-202 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      2 Scopus citations

    • A Resilient Distributed Boosting Algorithm

      Filmus, Y., Mehalel, I. & Moran, S., 2022, In: Proceedings of Machine Learning Research. 162, p. 6465-6473 9 p.

      Research output: Contribution to journal › Conference article › peer-review

    • Bounded indistinguishability for simple sources

      Filmus, Y., Ishai, Y., Bogdanov, A., Srinivasan, A., Dinesh, K. & Kaplan, A., 2022, ITCS 2022.

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Bounded Indistinguishability for Simple Sources

      Bogdanov, A., Dinesh, K., Filmus, Y., Ishai, Y., Kaplan, A. & Srinivasan, A., 1 Jan 2022, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022. Braverman, M. (ed.). 26. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 215).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations

    • Characterizing the extremal families in Erdos–Ko–Rado theorems

      Chase, G., Dafni, N., Filmus, Y. & Lindzey, N., 2022, In: Discrete Mathematics Days 2022. 263, p. 84 1 p.

      Research output: Contribution to journal › Article › peer-review

    • Harmonic polynomials on perfect matchings

      Filmus, Y. & Lindzey, N., 2022, The 34th international conference on. Formal Power Series and Algebraic Combinatorics (FPSAC'22).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Harmonic Polynomials on Perfect Matchings

      Filmus, Y. & Lindzey, N., 2022, In: Seminaire Lotharingien de Combinatoire. 86, #59.

      Research output: Contribution to journal › Article › peer-review

    • Irreducible subcube partitions

      Filmus, Y., Hirsch, E. A., Kurz, S., Ihringer, F., Riazanov, A., Smal, A. & Vinyals, M., 2022, In: CoRR. abs/2212.14685, p. 1-38 38 p.

      Research output: Contribution to journal › Article

    • Log-Sobolev inequality for the multislice, with applications

      Filmus, Y., O’Donnell, R. & Wu, X., 2022, In: Electronic Journal of Probability. 27, 33.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      2 Scopus citations

    • Simple Algebraic Proofs of Uniqueness for Erd$H $$o$$ s-Ko-Rado Theorems

      Filmus, Y. & Lindzey, N., 2022

      Research output: Other contribution

    • Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings

      Chase, G., Dafni, N., Filmus, Y. & Lindzey, N., 2022, In: arXiv preprint arXiv:2210.00245.

      Research output: Contribution to journal › Article › peer-review

    • 2021

      Boolean functions on Sn which are nearly linear

      Filmus, Y., 13 Dec 2021, In: Discrete Analysis. 27 p., 25.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Boolean Functions on Sn Which Are Nearly Linear

      Filmus, Y., 2021, In: Discrete Analysis. 2021, 25.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • Explicit SoS lower bounds from high-dimensional expanders

      Dinur, I., Filmus, Y., Harsha, P. & Tulsiani, M., 1 Feb 2021, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Lee, J. R. (ed.). 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      3 Scopus citations

    • FKN theorems for the biased cube and the slice

      Filmus, Y., 2021

      Research output: Other contribution

    • High dimensional Hoffman bound and applications in extremal combinatorics

      Filmus, Y., Lifshitz, N. & Golubev, K., 2021, In: Algebraic Combinatorics. 4, 6, p. 1005 1026 p., 190.

      Research output: Contribution to journal › Article › peer-review

      Open Access

    • High dimensional Hoffman bound and applications in extremal combinatorics

      Filmus, Y., Golubev, K. & Lifshitz, N., 2021, In: Algebraic Combinatorics. 4, 6, p. 1005-1026 22 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      5 Scopus citations

    • Optimal sets of questions for Twenty Questions

      Filmus, Y. & Mehalel, I., 2021

      Research output: Other contribution

    • Query-to-communication lifting using low-discrepancy gadgets

      Chattopadhyay, A., Filmus, Y., Koroth, S., Meir & Pitassi, T., 2021, In: SIAM Journal on Computing. 50, 1, p. 171-210 40 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      9 Scopus citations

    • Revisiting the complexity analysis of conflict-based search: New computational techniques and improved bounds

      Filmus, Y., Salzman, O. & Gordon, O., 2021, SOCS 2021.

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds

      Gordon, O., Filmus, Y. & Salzman, O., 2021, 14th International Symposium on Combinatorial Search, SoCS 2021. Ma, H. & Serina, I. (eds.). p. 64-72 9 p. (14th International Symposium on Combinatorial Search, SoCS 2021).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      7 Scopus citations

    • Shrinkage under random projections, and cubic formula lower bounds for AC0

      Filmus, Y., Meir, O. & Tal, A., 1 Feb 2021, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Lee, J. R. (ed.). 89. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      4 Scopus citations

    • The entropy of lies: Playing twenty questions with a liar

      Dagan, Y., Filmus, Y., Kane, D. & Moran, S., 1 Feb 2021, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Lee, J. R. (ed.). 1. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations

    • Tight approximation for unconstrained xos maximization

      Filmus, Y., Kawase, Y., Kobayashi, Y. & Yamaguchi, Y., Nov 2021, In: Mathematics of Operations Research. 46, 4, p. 1599-1610 12 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
    • 2020

      AND testing and robust judgement aggregation

      Filmus, Y., Lifshitz, N., Minzer, D. & Mossel, E., 8 Jun 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). p. 222-233 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      5 Scopus citations

    • A sauer–shelah–perles lemma for lattices

      Cambie, S., Chornomaz, B., Dvir, Z., Filmus, Y. & Moran, S., 2020, In: Electronic Journal of Combinatorics. 27, 4, p. 1-21 21 p., P4.19.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      2 Scopus citations

    • Guest editor’s foreword

      Filmus, Y., 2020, In: Theory of Computing. 16, 19.

      Research output: Contribution to journal › Editorial

      Open Access

    • Hypercontractivity on the symmetric group

      Filmus, Y., Kindler, G., Lifshitz, N. & Minzer, D., 2020

      Research output: Other contribution

    • Limits of preprocessing

      Filmus, Y., Ishai, Y., Kaplan, A. & Kindler, G., 1 Jul 2020, 35th Computational Complexity Conference, CCC 2020. Saraf, S. (ed.). 17. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 169).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      3 Scopus citations

    • MaxSAT Resolution and Subcube Sums

      Filmus, Y., Mahajan, M., Sood, G. & Vinyals, M., 2020, Theory and Applications of Satisfiability Testing – SAT 2020 - 23rd International Conference, Proceedings. Pulina, L. & Seidl, M. (eds.). p. 295-311 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12178 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      9 Scopus citations

    • Online submodular maximization: beating 1/2 made simple

      Buchbinder, N., Feldman, M., Filmus, Y. & Garg, M., 1 Sep 2020, In: Mathematical Programming. 183, 1-2, p. 149-169 21 p.

      Research output: Contribution to journal › Article › peer-review

      Open Access
      10 Scopus citations

    • On the Bhattacharya-Mesner rank of third order hypermatrices

      Gnang, E. K. & Filmus, Y., 1 Mar 2020, In: Linear Algebra and Its Applications. 588, p. 391-418 28 p.

      Research output: Contribution to journal › Article › peer-review

      5 Scopus citations
    • 2019

      A log-sobolev inequality for the multislice, with applications

      Filmus, Y., O’Donnell, R. & Wu, X., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). 34. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      5 Scopus citations

    • Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests

      Dinur, I., Filmus, Y. & Harsha, P., 2019, p. 2124-2133. 10 p.

      Research output: Contribution to conference › Paper › peer-review

      8 Scopus citations

    • Analyzing Power in Weighted Voting Games with Super-Increasing Weights

      Filmus, Y., Oren, J., Zick, Y. & Bachrach, Y., 15 Jan 2019, In: Theory of Computing Systems. 63, 1, p. 150-174 25 p.

      Research output: Contribution to journal › Article › peer-review

      3 Scopus citations

    • Another look at degree lower bounds for polynomial calculus

      Filmus, Y., 3 Dec 2019, In: Theoretical Computer Science. 796, p. 286-293 8 p.

      Research output: Contribution to journal › Article › peer-review