default search action
Yuval Filmus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j36]Yuval Filmus, Yuval Ishai, Avi Kaplan, Guy Kindler:
Limits of Preprocessing. Comput. Complex. 33(1): 5 (2024) - [j35]Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha:
Boolean Function Analysis on High-Dimensional Expanders. Comb. 44(3): 563-620 (2024) - [j34]Yuval Filmus, Idan Mehalel:
Optimal Sets of Questions for Twenty Questions. SIAM J. Discret. Math. 38(1): 412-452 (2024) - [j33]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Sparse juntas on the biased hypercube. TheoretiCS 3 (2024) - [c42]Yaroslav Alekseev, Yuval Filmus, Alexander Smal:
Lifting Dichotomies. CCC 2024: 9:1-9:18 - [c41]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. ITCS 2024: 48:1-48:20 - [i57]Yuval Filmus, Steve Hanneke, Idan Mehalel, Shay Moran:
Bandit-Feedback Online Multiclass Classification: Variants and Tradeoffs. CoRR abs/2402.07453 (2024) - [i56]Yaroslav Alekseev, Yuval Filmus, Alexander Smal:
Lifting dichotomies. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j32]Yuval Filmus:
Junta Threshold for Low Degree Boolean Functions on the Slice. Electron. J. Comb. 30(1) (2023) - [j31]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Ryazanov, Alexander V. Smal, Marc Vinyals:
Irreducible Subcube Partitions. Electron. J. Comb. 30(3) (2023) - [j30]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. ACM Trans. Comput. Log. 24(1): 8:1-8:27 (2023) - [c40]Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov:
Sampling and Certifying Symmetric Functions. APPROX/RANDOM 2023: 36:1-36:21 - [c39]Yuval Filmus, Steve Hanneke, Idan Mehalel, Shay Moran:
Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension. COLT 2023: 773-836 - [c38]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar:
Bounded Simultaneous Messages. FSTTCS 2023: 23:1-23:17 - [i55]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. CoRR abs/2302.06241 (2023) - [i54]Yuval Filmus, Steve Hanneke, Idan Mehalel, Shay Moran:
Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension. CoRR abs/2302.13849 (2023) - [i53]Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov:
Sampling and Certifying Symmetric Functions. CoRR abs/2305.04363 (2023) - [i52]Gilad Chase, Yuval Filmus:
Generalized Polymorphisms. CoRR abs/2305.10073 (2023) - [i51]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar:
Bounded Simultaneous Messages. CoRR abs/2310.00334 (2023) - [i50]Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals:
Proving Unsatisfiability with Hitting Formulas. Electron. Colloquium Comput. Complex. TR23 (2023) - [i49]Yuval Filmus, Itai Leigh, Artur Riazanov, Dmitry Sokolov:
Sampling and Certifying Symmetric Functions. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j29]Yuval Filmus, Edward A. Hirsch, Sascha Kurz, Ferdinand Ihringer, Artur Riazanov, Alexander Smal, Marc Vinyals:
Irreducible subcube partitions. CoRR abs/2212.14685: 1-38 (2022) - [c37]Yuval Filmus, Idan Mehalel, Shay Moran:
A Resilient Distributed Boosting Algorithm. ICML 2022: 6465-6473 - [c36]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan:
Bounded Indistinguishability for Simple Sources. ITCS 2022: 26:1-26:18 - [c35]Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh:
Approximate polymorphisms. STOC 2022: 195-202 - [i48]Yuval Filmus, Nathan Lindzey:
Simple Algebraic Proofs of Uniqueness for Erdős-Ko-Rado Theorems. CoRR abs/2201.02887 (2022) - [i47]Yuval Filmus:
Junta threshold for low degree Boolean functions on the slice. CoRR abs/2203.04760 (2022) - [i46]Yuval Filmus, Idan Mehalel, Shay Moran:
A Resilient Distributed Boosting Algorithm. CoRR abs/2206.04713 (2022) - 2021
- [j28]Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi, Yutaro Yamaguchi:
Tight Approximation for Unconstrained XOS Maximization. Math. Oper. Res. 46(4): 1599-1610 (2021) - [j27]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. SIAM J. Comput. 50(1): 171-210 (2021) - [c34]Yuval Dagan, Yuval Filmus, Daniel Kane, Shay Moran:
The Entropy of Lies: Playing Twenty Questions with a Liar. ITCS 2021: 1:1-1:16 - [c33]Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani:
Explicit SoS Lower Bounds from High-Dimensional Expanders. ITCS 2021: 38:1-38:16 - [c32]Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals:
Complexity Measures on the Symmetric Group and Beyond (Extended Abstract). ITCS 2021: 87:1-87:5 - [c31]Yuval Filmus, Or Meir, Avishay Tal:
Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0 (Extended Abstract). ITCS 2021: 89:1-89:7 - [c30]Ofir Gordon, Yuval Filmus, Oren Salzman:
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. SOCS 2021: 64-72 - [i45]Ofir Gordon, Yuval Filmus, Oren Salzman:
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. CoRR abs/2104.08759 (2021) - [i44]Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh:
Approximate polymorphisms. CoRR abs/2106.00093 (2021) - [i43]Yuval Filmus, Idan Mehalel:
Optimal sets of questions for Twenty Questions. CoRR abs/2106.01737 (2021) - [i42]Yuval Filmus:
Almost linear Boolean functions on Sn are almost unions of cosets. CoRR abs/2107.07833 (2021) - [i41]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan:
Bounded Indistinguishability for Simple Sources. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j26]Stijn Cambie, Bogdan Chornomaz, Zeev Dvir, Yuval Filmus, Shay Moran:
A Sauer-Shelah-Perles Lemma for Lattices. Electron. J. Comb. 27(4): 4 (2020) - [j25]Yuval Filmus:
FKN theorem for the multislice, with applications. Comb. Probab. Comput. 29(2): 200-212 (2020) - [j24]Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online submodular maximization: beating 1/2 made simple. Math. Program. 183(1): 149-169 (2020) - [j23]Yuval Filmus:
Special Issue: CCC 2019: Guest Editor's Foreword. Theory Comput. 16: 1-5 (2020) - [c29]Yuval Filmus, Yuval Ishai, Avi Kaplan, Guy Kindler:
Limits of Preprocessing. CCC 2020: 17:1-17:22 - [c28]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. SAT 2020: 295-311 - [c27]Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
AND testing and robust judgement aggregation. STOC 2020: 222-233 - [i40]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. CoRR abs/2005.11589 (2020) - [i39]Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani:
Explicit SoS lower bounds from high-dimensional expanders. CoRR abs/2009.05218 (2020) - [i38]Yuval Filmus, Guy Kindler, Noam Lifshitz, Dor Minzer:
Hypercontractivity on the symmetric group. CoRR abs/2009.05503 (2020) - [i37]Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey, Marc Vinyals:
Complexity Measures on the Symmetric Group and Beyond. CoRR abs/2010.07405 (2020) - [i36]Yuval Filmus, Or Meir, Avishay Tal:
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0. CoRR abs/2012.02210 (2020) - [i35]Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani:
Explicit and structured sum of squares lower bounds from high dimensional expanders. Electron. Colloquium Comput. Complex. TR20 (2020) - [i34]Yuval Filmus, Meena Mahajan, Gaurav Sood, Marc Vinyals:
MaxSAT Resolution and Subcube Sums. Electron. Colloquium Comput. Complex. TR20 (2020) - [i33]Yuval Filmus, Or Meir, Avishay Tal:
Shrinkage under Random Projections, and Cubic Formula Lower Bounds for AC0. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j22]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. Algorithmica 81(11-12): 4200-4237 (2019) - [j21]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (Short) Questions. Comb. 39(3): 597-626 (2019) - [j20]Yuval Filmus:
More complete intersection theorems. Discret. Math. 342(1): 128-142 (2019) - [j19]Yuval Filmus, Ferdinand Ihringer:
Boolean constant degree functions on the slice are juntas. Discret. Math. 342(12) (2019) - [j18]Yuval Filmus, Ferdinand Ihringer:
Boolean degree 1 functions on some classical association schemes. J. Comb. Theory A 162: 241-270 (2019) - [j17]Yuval Filmus, Joel Oren, Yair Zick, Yoram Bachrach:
Analyzing Power in Weighted Voting Games with Super-Increasing Weights. Theory Comput. Syst. 63(1): 150-174 (2019) - [j16]Yuval Filmus:
Another look at degree lower bounds for polynomial calculus. Theor. Comput. Sci. 796: 286-293 (2019) - [c26]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-To-Communication Lifting for BPP Using Inner Product. ICALP 2019: 35:1-35:15 - [c25]Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman:
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. ICALP 2019: 58:1-58:13 - [c24]Yuval Filmus, Ryan O'Donnell, Xinyu Wu:
A Log-Sobolev Inequality for the Multislice, with Applications. ITCS 2019: 34:1-34:12 - [c23]Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. IPCO 2019: 101-114 - [c22]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. SODA 2019: 2124-2133 - [i32]Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman:
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. CoRR abs/1902.07426 (2019) - [i31]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-communication lifting for BPP using inner product. CoRR abs/1904.13056 (2019) - [i30]Yuval Filmus, Noam Lifshitz, Dor Minzer, Elchanan Mossel:
AND Testing and Robust Judgement Aggregation. CoRR abs/1911.00159 (2019) - [i29]Yuval Filmus:
Asymptotic performance of the Grimmett-McDiarmid heuristic. CoRR abs/1912.04772 (2019) - [i28]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. Electron. Colloquium Comput. Complex. TR19 (2019) - [i27]Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman:
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j15]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. Theory Comput. 14(1): 1-73 (2018) - [j14]Yuval Filmus, Guy Kindler, Elchanan Mossel, Karl Wimmer:
Invariance Principle on the Slice. ACM Trans. Comput. Theory 10(3): 11:1-11:37 (2018) - [c21]Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha:
Boolean Function Analysis on High-Dimensional Expanders. APPROX-RANDOM 2018: 38:1-38:20 - [i26]Yuval Filmus, Ferdinand Ihringer:
Boolean constant degree functions on the slice are juntas. CoRR abs/1801.06338 (2018) - [i25]Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha:
Boolean functions on high-dimensional expanders. CoRR abs/1804.08155 (2018) - [i24]Yuval Filmus:
FKN theorem for the multislice, with applications. CoRR abs/1809.03089 (2018) - [i23]Yuval Filmus, Ryan O'Donnell, Xinyu Wu:
A log-Sobolev inequality for the multislice, with applications. CoRR abs/1809.03546 (2018) - [i22]Yuval Dagan, Yuval Filmus, Daniel Kane, Shay Moran:
The entropy of lies: playing twenty questions with a liar. CoRR abs/1811.02177 (2018) - [i21]Irit Dinur, Yotam Dikstein, Yuval Filmus, Prahladh Harsha:
Boolean function analysis on high-dimensional expanders. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j13]Yuval Filmus:
The weighted complete intersection theorem. J. Comb. Theory A 151: 84-101 (2017) - [c20]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. CCC 2017: 16:1-16:59 - [c19]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information Complexity of the AND Function in the Two-Party and Multi-party Settings. COCOON 2017: 200-211 - [c18]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (simple) questions. STOC 2017: 9-21 - [i20]Yuval Filmus, Hamed Hatami, Yaqiao Li, Suzin You:
Information complexity of the AND function in the two-Party, and multiparty settings. CoRR abs/1703.07833 (2017) - [i19]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Agreement tests on graphs and hypergraphs. CoRR abs/1711.09426 (2017) - [i18]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Low degree almost Boolean functions are sparse juntas. CoRR abs/1711.09428 (2017) - [i17]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Low degree almost Boolean functions are sparse juntas. Electron. Colloquium Comput. Complex. TR17 (2017) - [i16]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Agreement tests on graphs and hypergraphs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j12]Yuval Filmus:
Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j11]Yuval Filmus:
An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube. Electron. J. Comb. 23(1): 1 (2016) - [c17]Yuval Filmus, Guy Kindler, Elchanan Mossel, Karl Wimmer:
Invariance Principle on the Slice. CCC 2016: 15:1-15:10 - [c16]Yuval Filmus, Elchanan Mossel:
Harmonicity and Invariance on Slices of the Boolean Cube. CCC 2016: 16:1-16:13 - [c15]Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick:
A Characterization of Voting Power for Discrete Weight Distributions. IJCAI 2016: 74-80 - [c14]Yoram Bachrach, Yuval Filmus, Joel Oren, Yair Zick:
Analyzing Power in Weighted Voting Games with Super-Increasing Weights. SAGT 2016: 169-181 - [c13]Yuval Filmus, Pavel Hrubes, Massimo Lauria:
Semantic Versus Syntactic Cutting Planes. STACS 2016: 35:1-35:13 - [i15]Yuval Filmus, Joel Oren, Kannan Soundararajan:
Shapley Values in Weighted Voting Games with Random Weights. CoRR abs/1601.06223 (2016) - [i14]Yuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran:
Twenty (simple) questions. CoRR abs/1611.01655 (2016) - [i13]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading information complexity for error. CoRR abs/1611.06650 (2016) - [i12]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading information complexity for error. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j10]David Ellis, Yuval Filmus, Ehud Friedgut:
A quasi-stability result for dictatorships in S n. Comb. 35(5): 573-618 (2015) - [j9]David Ellis, Yuval Filmus, Ehud Friedgut:
A stability result for balanced dictatorships in Sn. Random Struct. Algorithms 46(3): 494-530 (2015) - [j8]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. SIAM J. Comput. 44(4): 1119-1153 (2015) - [j7]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. ACM Trans. Comput. Log. 16(4): 28:1-28:15 (2015) - [j6]Yuval Filmus, Toniann Pitassi, Rahul Santhanam:
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. ACM Trans. Comput. Theory 7(2): 5:1-5:16 (2015) - [c12]Andris Ambainis, Yuval Filmus, François Le Gall:
Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method. STOC 2015: 585-593 - 2014
- [b1]Yuval Filmus:
Spectral Methods in Extremal Combinatorics. University of Toronto, Canada, 2014 - [j5]Yuval Filmus, Justin Ward:
Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search. SIAM J. Comput. 43(2): 514-542 (2014) - [j4]Stephen A. Cook, Yuval Filmus, Dai Tri Man Le:
The complexity of the comparator circuit value problem. ACM Trans. Comput. Theory 6(4): 15:1-15:44 (2014) - [c11]Yuval Filmus, Joel Oren:
Efficient voting via the top-k elicitation scheme: a probabilistic approach. EC 2014: 295-312 - [c10]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. STACS 2014: 300-311 - [i11]Edinah K. Gnang, Ori Parzanchevski, Yuval Filmus:
A SageTeX Hypermatrix Algebra Package. CoRR abs/1403.2630 (2014) - [i10]Yuval Filmus, Hamed Hatami:
Bounds on the sum of L1 influences. CoRR abs/1404.3396 (2014) - [i9]Joel Oren, Yuval Filmus, Yair Zick, Yoram Bachrach:
Power Distribution in Randomized Weighted Voting: the Effects of the Quota. CoRR abs/1408.0442 (2014) - [i8]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. CoRR abs/1409.2978 (2014) - [i7]Andris Ambainis, Yuval Filmus, François Le Gall:
Fast Matrix Multiplication: Limitations of the Laser Method. CoRR abs/1411.5414 (2014) - [i6]Andris Ambainis, Yuval Filmus, François Le Gall:
Fast Matrix Multiplication: Limitations of the Laser Method. Electron. Colloquium Comput. Complex. TR14 (2014) - [i5]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j3]Yuval Filmus:
Universal codes of the natural numbers. Log. Methods Comput. Sci. 9(3) (2013) - [j2]Yuval Filmus:
Inequalities on submodular functions via term rewriting. Inf. Process. Lett. 113(13): 457-464 (2013) - [c9]Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook:
Average Case Lower Bounds for Monotone Switching Networks. FOCS 2013: 598-607 - [c8]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds - (Extended Abstract). ICALP (1) 2013: 437-448 - [c7]Joel Oren, Yuval Filmus, Craig Boutilier:
Efficient Vote Elicitation under Candidate Uncertainty. IJCAI 2013: 309-316 - [i4]Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook:
Average Case Lower Bounds for Monotone Switching Networks. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c6]Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi:
Space Complexity in Polynomial Calculus. CCC 2012: 334-344 - [c5]