Yuval Filmus
Orcid: 0000-0002-1739-0872
According to our database1,
Yuval Filmus
authored at least 89 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Special Section on the Sixty-First Annual IEEE Symposium on Foundations of Computer Science (2020).
SIAM J. Comput., 2024
Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint.
CoRR, 2024
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024
2023
Electron. Colloquium Comput. Complex., 2023
Electron. Colloquium Comput. Complex., 2023
Electron. J. Comb., 2023
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023
2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the International Conference on Machine Learning, 2022
2021
Electron. Colloquium Comput. Complex., 2021
CoRR, 2021
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds.
Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021
Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract).
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021
2020
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC<sup>0</sup>.
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020
2019
Theor. Comput. Sci., 2019
Theory Comput. Syst., 2019
J. Comb. Theory A, 2019
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions.
Electron. Colloquium Comput. Complex., 2019
Information Complexity of the AND Function in the Two-Party and Multi-party Settings.
Algorithmica, 2019
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract].
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019
2018
Electron. Colloquium Comput. Complex., 2018
2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Information complexity of the AND function in the two-Party, and multiparty settings.
CoRR, 2017
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
2016
Electron. Colloquium Comput. Complex., 2016
Electron. J. Comb., 2016
Chic. J. Theor. Comput. Sci., 2016
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the 31st Conference on Computational Complexity, 2016
2015
Exponential Lower Bounds for AC<sup>0</sup>-Frege Imply Superpolynomial Frege Lower Bounds.
ACM Trans. Comput. Theory, 2015
Random Struct. Algorithms, 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
2014
ACM Trans. Comput. Theory, 2014
SIAM J. Comput., 2014
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014
CoRR, 2014
Proceedings of the ACM Conference on Economics and Computation, 2014
2013
Electron. Colloquium Comput. Complex., 2013
Proceedings of the IJCAI 2013, 2013
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013
2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2012
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
2010
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010