Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarYuval Filmus
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[i21]Yuval Filmus, Ferdinand Ihringer:
Boolean constant degree functions on the slice are juntas. CoRR abs/1801.06338 (2018)- 2017
- [j13]Yuval Filmus:
The weighted complete intersection theorem. J. Comb. Theory, Ser. A 151: 84-101 (2017) - [c20]Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li:
Trading Information Complexity for Error. Computational Complexity Conference 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]
- [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. Electronic Colloquium on Computational Complexity (ECCC) 24: 180 (2017) - [i16]Irit Dinur, Yuval Filmus, Prahladh Harsha:
Agreement tests on graphs and hypergraphs. Electronic Colloquium on Computational Complexity (ECCC) 24: 181 (2017) - 2016
- [j12]Yuval Filmus:
Friedgut-Kalai-Naor Theorem for Slices of the Boolean Cube. Chicago J. Theor. Comput. Sci. 2016 (2016) - [j11]Yuval Filmus:
An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube. Electr. J. Comb. 23(1): P1.23 (2016) - [c17]Yuval Filmus, Guy Kindler, Elchanan Mossel, Karl Wimmer:
Invariance Principle on the Slice. Conference on Computational Complexity 2016: 15:1-15:10 - [c16]Yuval Filmus, Elchanan Mossel:
Harmonicity and Invariance on Slices of the Boolean Cube. Conference on Computational Complexity 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. Electronic Colloquium on Computational Complexity (ECCC) 23: 190 (2016) - 2015
- [j10]David Ellis, Yuval Filmus, Ehud Friedgut:
A quasi-stability result for dictatorships in S n. Combinatorica 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. TOCT 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
- [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. TOCT 6(4): 15:1-15:44 (2014) - [c11]
- [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]
- [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]Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. Electronic Colloquium on Computational Complexity (ECCC) 21: 81 (2014) - [i5]Andris Ambainis, Yuval Filmus, François Le Gall:
Fast Matrix Multiplication: Limitations of the Laser Method. Electronic Colloquium on Computational Complexity (ECCC) 21: 154 (2014) - 2013
- [j3]Yuval Filmus:
Universal codes of the natural numbers. Logical Methods in Computer Science 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. Electronic Colloquium on Computational Complexity (ECCC) 20: 54 (2013) - 2012
- [c6]Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi:
Space Complexity in Polynomial Calculus. IEEE Conference on Computational Complexity 2012: 334-344 - [c5]Yuval Filmus, Justin Ward:
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint. FOCS 2012: 659-668 - [c4]Philip Bohannon, Nilesh N. Dalvi, Yuval Filmus, Nori Jacoby, S. Sathiya Keerthi, Alok Kirpal:
Automatic web-scale information extraction. SIGMOD Conference 2012: 609-612 - [c3]Yuval Filmus, Justin Ward:
The Power of Local Search: Maximum Coverage over a Matroid. STACS 2012: 601-612 - [i3]Yuval Filmus, Justin Ward:
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint. CoRR abs/1204.4526 (2012) - [i2]Stephen A. Cook, Yuval Filmus, Dai Tri Man Le:
The Complexity of the Comparator Circuit Value Problem. CoRR abs/1208.2721 (2012) - [i1]Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen:
Space Complexity in Polynomial Calculus. Electronic Colloquium on Computational Complexity (ECCC) 19: 132 (2012) - 2011
- [j1]
- [c2]Yuval Filmus, Toniann Pitassi, Rahul Santhanam:
Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds. ICALP (1) 2011: 618-629 - 2010
- [c1]Allan Borodin, Yuval Filmus, Joel Oren:
Threshold Models for Competitive Influence in Social Networks. WINE 2010: 539-550
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-02-03 21:06 CET by the dblp team