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

    • 2019

      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

    • 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

    • 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

    • Information Complexity of the AND Function in the Two-Party and Multi-party Settings

      Filmus, Y., Hatami, H., Li, Y. & You, S., 1 Nov 2019, In: Algorithmica. 81, 11-12, p. 4200-4237 38 p.

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

    • More complete intersection theorems

      Filmus, Y., Jan 2019, In: Discrete Mathematics. 342, 1, p. 128-142 15 p.

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

      Open Access
      2 Scopus citations

    • Online Submodular Maximization: Beating 1/2 Made Simple

      Buchbinder, N., Feldman, M., Filmus, Y. & Garg, M., 2019, INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2019. Lodi, A. & Nagarajan, V. (eds.). Vol. 11480. p. 101-114 14 p. (Lecture Notes in Computer Science).

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

      4 Scopus citations

    • Query-to-communication lifting for BPP using inner product

      Chattopadhyay, A., Filmus, Y., Koroth, S., Meir, O. & Pitassi, T., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). 35. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

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

      9 Scopus citations

    • Twenty (Short) Questions

      Dagan, Y., Filmus, Y., Gabizon, A. & Moran, S., 1 Jun 2019, In: Combinatorica. 39, 3, p. 597-626 30 p.

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

      4 Scopus citations
    • 2018

      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

    • Invariance principle on the slice

      Filmus, Y., Kindler, G., Mossel, E. & Wimmer, K., Jun 2018, In: ACM Transactions on Computation Theory. 10, 3, 11.

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

      Open Access
      9 Scopus citations

    • Trading information complexity for error

      Dagan, Y., Filmus, Y., Hatami, H. & Li, Y., 2018, In: Theory of Computing. 14, 6, p. 1-73 73 p.

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

      Open Access
      4 Scopus citations
    • 2017

      A comment on Intersecting Families of Permutations

      Filmus, Y., 2017

      Research output: Other contribution

    • Information complexity of the AND function in the two-party and multi-party settings

      Filmus, Y., Hatami, H., Li, Y. & You, S., 2017, Computing and Combinatorics - 23rd International Conference, COCOON 2017, Proceedings. Cao, Y. & Chen, J. (eds.). p. 200-211 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10392 LNCS).

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

      Open Access
      3 Scopus citations

    • Low degree almost Boolean functions are sparse juntas

      Dinur, I., Filmus, Y. & Harsha, P., 2017

      Research output: Other contribution

    • Low-degree boolean functions on Sn, with an application to isoperimetry

      Ellis, D., Filmus, Y. & Friedgut, E., 2017, In: Forum of Mathematics, Sigma. 5

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

      Open Access
      6 Scopus citations

    • On the spectra of hypermatrix direct sum and Kronecker products constructions

      Gnang, E. K. & Filmus, Y., 15 Apr 2017, In: Linear Algebra and Its Applications. 519, p. 238-277 40 p.

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

      Open Access
      6 Scopus citations

    • The weighted complete intersection theorem

      Filmus, Y., 1 Oct 2017, In: Journal of Combinatorial Theory. Series A. 151, p. 84-101 18 p.

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

      10 Scopus citations

    • Trading information complexity for error

      Dagan, Y., Filmus, Y., Hatami, H. & Li, Y., 1 Jul 2017, 32nd Computational Complexity Conference, CCC 2017. O'Donnell, R. (ed.). 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 79).

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

      2 Scopus citations

    • Twenty (Simple) questions

      Dagan, Y., Filmus, Y., Gabizon, A. & Moran, S., 19 Jun 2017, STOC 2017 - Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. McKenzie, P., King, V. & Hatami, H. (eds.). p. 9-21 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F128415).

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

      7 Scopus citations
    • 2016

      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

    • 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

    • 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

    • 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

    • 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

    • Invariance principle on the slice

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

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

      5 Scopus citations

    • On the sum of the L 1 influences of bounded functions

      Filmus, Y., Hatami, H., Keller, N. & Lifshitz, N., 1 Jul 2016, In: Israel Journal of Mathematics. 214, 1, p. 167-192 26 p.

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

      Open Access
      5 Scopus citations

    • Semantic versus syntactic cutting planes

      Filmus, Y., Hrubeš, P. & Lauria, M., 1 Feb 2016, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. Vollmer, H. & Ollinger, N. (eds.). 35. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 47).

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

      8 Scopus citations
    • 2015

      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 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

    • 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

    • 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

    • Space complexity in polynomial calculus

      Filmus, Y., Lauria, M., Nordström, J., Ron-Zewi, N. & Thapen, N., 2015, In: SIAM Journal on Computing. 44, 4, p. 1119-1153 35 p.

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

      Open Access
      13 Scopus citations
    • 2014

      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

    • 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

    • Monotone submodular maximization over a matroid via non-oblivious local search

      Filmus, Y. & Ward, J., 2014, In: SIAM Journal on Computing. 43, 2, p. 514-542 29 p.

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

      Open Access
      71 Scopus citations

    • The complexity of the comparator circuit value problem

      Cook, S. A., Filmus, Y. & Lê, D. T. M., Aug 2014, In: ACM Transactions on Computation Theory. 6, 4, 15.

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

      Open Access
      11 Scopus citations
    • 2013

      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

    • 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

    • Inequalities on submodular functions via term rewriting

      Filmus, Y., 2013, In: Information Processing Letters. 113, 13, p. 457-464 8 p.

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

      1 Scopus citations

    • Towards an understanding of polynomial calculus: New separations and lower bounds (extended abstract)

      Filmus, Y., Lauria, M., Mikša, M., Nordström, J. & Vinyals, M., 2013, Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings. PART 1 ed. p. 437-448 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7965 LNCS, no. PART 1).

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

      Open Access
      22 Scopus citations

    • Universal codes of the natural numbers

      Filmus, Y., 29 Aug 2013, In: Logical Methods in Computer Science. 9, 3, 7.

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

      Open Access
      2 Scopus citations
    • 2012

      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

    • Space complexity in polynomial calculus

      Filmus, Y., Lauria, M., Nordström, J., Thapen, N. & Ron-Zewi, N., 2012, Proceedings - 2012 IEEE 27th Conference on Computational Complexity, CCC 2012. p. 334-344 11 p. 6243410. (Proceedings of the Annual IEEE Conference on Computational Complexity).

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

      Open Access
      11 Scopus citations

    • The power of local search: Maximum coverage over a matroid

      Filmus, Y. & Ward, J., 2012, 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012. p. 601-612 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 14).

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

      24 Scopus citations

    • Triangle-intersecting families of graphs

      Ellis, D., Filmus, Y. & Friedgut, E., 2012, In: Journal of the European Mathematical Society. 14, 3, p. 841-885 45 p.

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

      Open Access
      26 Scopus citations
    • 2011

      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