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

    • A characterization of voting power for discrete weight distributions

      Bachrach, Y., Filmus, Y., Oren, J. & Zick, Y., 2016, In: IJCAI International Joint Conference on Artificial Intelligence. 2016-January, p. 74-80 7 p.

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

      6 Scopus citations

    • A comment on Intersecting Families of Permutations

      Filmus, Y., 2017

      Research output: Other contribution

    • 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

    • 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

      Bachrach, Y., Filmus, Y., Oren, J. & Zick, Y., 2016, Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings. Gairing, M. & Savani, R. (eds.). p. 169-181 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9928 LNCS).

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

      5 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

    • 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

    • An orthogonal basis for functions over a slice of the Boolean hypercube

      Filmus, Y., 5 Feb 2016, In: Electronic Journal of Combinatorics. 23, 1, #P1.23.

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

      Open Access
      32 Scopus citations

    • 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

    • 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

    • 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 quasi-stability result for dictatorships in S n

      Ellis, D., Filmus, Y. & Friedgut, E., 1 Oct 2015, In: Combinatorica. 35, 5, p. 573-618 46 p.

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

      Open Access
      10 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

    • 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

    • A stability result for balanced dictatorships in Sn

      Ellis, D., Filmus, Y. & Friedgut, E., 1 May 2015, In: Random Structures and Algorithms. 46, 3, p. 494-530 37 p.

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

      Open Access
      9 Scopus citations

    • A tight combinatorial algorithm for submodular maximization subject to a matroid constraint

      Filmus, Y. & Ward, J., 2012, In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. p. 659-668 10 p., 6375345.

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

      Open Access
      50 Scopus citations

    • Automatic web-scale information extraction

      Bohannon, P., Dalvi, N., Filmus, Y., Jacoby, N., Keerthi, S. & Kirpal, A., 2012, SIGMOD '12 - Proceedings of the International Conference on Management of Data. p. 609-612 4 p. (Proceedings of the ACM SIGMOD International Conference on Management of Data).

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

      14 Scopus citations

    • Average case lower bounds for monotone switching networks

      Filmus, Y., Pitassi, T., Robere, R. & Cook, S. A., 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 598-607 10 p. 6686196. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

      Open Access
      8 Scopus citations

    • Biasing boolean functions and collective coin-flipping protocols over arbitrary product distributions

      Filmus, Y., Hambardzumyan, L., Hatami, H., Hatami, P. & Zuckerman, D., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). 58. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

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

      4 Scopus citations

    • Boolean constant degree functions on the slice are juntas

      Filmus, Y. & Ihringer, F., Dec 2019, In: Discrete Mathematics. 342, 12

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

    • Boolean degree 1 functions on some classical association schemes

      Filmus, Y. & Ihringer, F., Feb 2019, In: Journal of Combinatorial Theory - Series A. 162, p. 241-270 30 p.

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

      24 Scopus citations

    • Boolean function analysis on high-dimensional expanders

      Dikstein, Y., Dinur, I., Filmus, Y. & Harsha, P., 1 Aug 2018, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 21st International Workshop, APPROX 2018, and 22nd International Workshop, RANDOM 2018. Blais, E., Rolim, J. D. P., Steurer, D. & Jansen, K. (eds.). 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 116).

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

      18 Scopus citations

    • 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

    • 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

    • 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

    • 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

    • 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

    • Efficient vote elicitation under candidate uncertainty

      Oren, J., Filmus, Y. & Boutilier, C., 2013, IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. p. 309-316 8 p. (IJCAI International Joint Conference on Artificial Intelligence).

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

      27 Scopus citations

    • Efficient voting via the top-k elicitation scheme: A probabilistic approach

      Filmus, Y. & Oren, J., 2014, EC 2014 - Proceedings of the 15th ACM Conference on Economics and Computation. p. 295-312 18 p. (EC 2014 - Proceedings of the 15th ACM Conference on Economics and Computation).

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

      16 Scopus citations

    • 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

    • Exponential lower bounds for AC0-frege imply superpolynomial frege lower bounds

      Filmus, Y., Pitassi, T. & Santhanam, R., 2011, Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Proceedings. PART 1 ed. p. 618-629 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6755 LNCS, no. PART 1).

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

      Open Access
      5 Scopus citations

    • Exponential lower bounds for AC0-Frege imply superpolynomial Frege lower bounds

      Filmus, Y., Pitassi, T. & Santhanam, R., 1 May 2015, In: ACM Transactions on Computation Theory. 7, 2, 5.

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

      Open Access
      1 Scopus citations

    • Fast matrix multiplication: Limitations of the Coppersmith-Winograd method

      Ambainis, A., Filmus, Y. & Gall, F. L., 14 Jun 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. p. 585-593 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

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

      Open Access
      45 Scopus citations

    • FKN theorem for the multislice, with applications

      Filmus, Y., 1 Jan 2019, In: Combinatorics Probability and Computing.

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

      Open Access
      2 Scopus citations

    • FKN theorems for the biased cube and the slice

      Filmus, Y., 2021

      Research output: Other contribution

    • Friedgut–Kalai–Naor theorem for slices of the Boolean cube

      Filmus, Y., 2016, In: Chicago Journal of Theoretical Computer Science. 17 p., 14.

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

    • From small space to small width in resolution

      Filmus, Y., Lauria, M., Mikša, M., Nordström, J. & Vinyals, M., 1 Aug 2015, In: ACM Transactions on Computational Logic. 16, 4, 28.

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

      Open Access
      10 Scopus citations

    • From small space to small width in resolution

      Filmus, Y., Lauria, M., Mikša, M., Nordström, J. & Vinyals, M., 1 Mar 2014, 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014. Mayr, E. W. & Portier, N. (eds.). Vol. 25. p. 300-311 12 p.

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

      7 Scopus citations

    • Guest editor’s foreword

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

      Research output: Contribution to journal › Editorial

      Open Access

    • Harmonicity and invariance on slices of the boolean cube

      Filmus, Y. & Mossel, E., 1 May 2016, 31st Conference on Computational Complexity, CCC 2016. Raz, R. (ed.). p. 16:1-16:13 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 50).

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

      10 Scopus citations

    • Harmonicity and invariance on slices of the Boolean cube

      Filmus, Y. & Mossel, E., 1 Dec 2019, In: Probability Theory and Related Fields. 175, 3-4, p. 721-782 62 p.

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

      9 Scopus citations

    • 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

    • 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

    • 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

    • Hypercontractivity on the symmetric group

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

      Research output: Other contribution

    • 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