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

    Filter
    Conference contribution

    Search results

    • 2024

      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

      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

    • 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

    • 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

    • 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

    • 2021

      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

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

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

    • 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

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

      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

    • 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

      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

    • 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

    • 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

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

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

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

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

      Threshold models for competitive influence in social networks

      Borodin, A., Filmus, Y. & Oren, J., 2010, Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings. p. 539-550 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6484 LNCS).

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

      252 Scopus citations