Threshold models for competitive influence in social networks A Borodin, Y Filmus, J Oren Internet and Network Economics: 6th International Workshop, WINE 2010 …, 2010 | 415 | 2010 |
Monotone submodular maximization over a matroid via non-oblivious local search Y Filmus, J Ward SIAM Journal on Computing 43 (2), 514-542, 2014 | 94 | 2014 |
A tight combinatorial algorithm for submodular maximization subject to a matroid constraint Y Filmus, J Ward 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 659-668, 2012 | 91 | 2012 |
Fast matrix multiplication: limitations of the Coppersmith-Winograd method A Ambainis, Y Filmus, F Le Gall Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015 | 81 | 2015 |
Boolean degree 1 functions on some classical association schemes Y Filmus, F Ihringer Journal of Combinatorial Theory, Series A 162, 241-270, 2019 | 63 | 2019 |
Space complexity in polynomial calculus Y Filmus, M Lauria, J Nordstrom, N Ron-Zewi, N Thapen SIAM Journal on Computing 44 (4), 1119-1153, 2015 | 61 | 2015 |
Triangle-intersecting families of graphs. D Ellis, Y Filmus, E Friedgut Journal of the European Mathematical Society (EMS Publishing) 14 (3), 2012 | 59 | 2012 |
Orthogonal basis for functions over a slice of the Boolean hypercube Y Filmus arXiv preprint arXiv:1406.0142, 2014 | 56 | 2014 |
Boolean function analysis on high-dimensional expanders Y Dikstein, I Dinur, Y Filmus, P Harsha Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018 | 50 | 2018 |
Friedgut--Kalai--Naor theorem for slices of the Boolean cube Y Filmus arXiv preprint arXiv:1410.7834, 2014 | 47 | 2014 |
Efficient Vote Elicitation under Candidate Uncertainty. J Oren, Y Filmus, C Boutilier IJCAI, 309-316, 2013 | 45 | 2013 |
The power of local search: Maximum coverage over a matroid Y Filmus, J Ward STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 601-612, 2012 | 40 | 2012 |
Harmonicity and invariance on slices of the Boolean cube Y Filmus, E Mossel Probability Theory and Related Fields 175, 721-782, 2019 | 36 | 2019 |
Invariance principle on the slice Y Filmus, G Kindler, E Mossel, K Wimmer ACM Transactions on Computation Theory (TOCT) 10 (3), 1-37, 2018 | 32 | 2018 |
Towards an understanding of polynomial calculus: New separations and lower bounds Y Filmus, M Lauria, M Mikša, J Nordström, M Vinyals International Colloquium on Automata, Languages, and Programming, 437-448, 2013 | 31 | 2013 |
Log-Sobolev inequality for the multislice, with applications Y Filmus, R O’Donnell, X Wu Electronic Journal of Probability 27, 1-30, 2022 | 30 | 2022 |
Query-to-communication lifting using low-discrepancy gadgets A Chattopadhyay, Y Filmus, S Koroth, O Meir, T Pitassi SIAM Journal on Computing 50 (1), 171-210, 2021 | 29 | 2021 |
Automatic web-scale information extraction P Bohannon, N Dalvi, Y Filmus, N Jacoby, S Keerthi, A Kirpal Proceedings of the 2012 ACM SIGMOD International Conference on Management of …, 2012 | 29 | 2012 |
A quasi-stability result for dictatorships in S n D Ellis, Y Filmus, E Friedgut Combinatorica 35, 573-618, 2015 | 28 | 2015 |
Two proofs of the central limit theorem Y Filmus Recuperado de http://www. cs. toronto. edu/yuvalf/CLT. pdf, 2010 | 28 | 2010 |