PublicationsPapers

Highlights

Yuval Dagan, Yuval Filmus, Ariel Gabizon and Shay Moran, Twenty (simple) questions, STOC 2017, Invited to HALG 2018
detailsabstractBibTeX

BibTeX

@inproceedings{DFGM2017,
 author = {Yuval Dagan and Yuval Filmus and Ariel Gabizon and Shay Moran},
 title = {Twenty (simple) questions},
 booktitle = {49th ACM Symposium on Theory of Computing (STOC 2017)},
 year = {2017}
}
copy to clipboard
arXivconferencetalksfull version
Yuval Filmus, An orthogonal basis for functions over a slice of the Boolean cube, Electronic Journal of Combinatorics
detailsabstractBibTeX

BibTeX

@article{Filmus2016a,
 author = {Yuval Filmus},
 title = {Orthogonal basis for functions over a slice of the
 {B}oolean hypercube},
 journal = {Electronic Journal of Combinatorics},
 volume = {23},
 number = {1},
 year = {2016},
 pages = {P1.23}
}
copy to clipboard
arXivjournal
Yuval Filmus and Justin Ward, A tight combinatorial algorithm for submodular maximization subject to a matroid constraint, FOCS 2012, SICOMP
detailsabstractBibTeX

BibTeX

@inproceedings{FW2012b,
 author = {Yuval Filmus and Justin Ward},
 title = {A tight combinatorial algorithm for submodular maximization
 subject to a matroid constraint},
 booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science ({FOCS} 2012)},
 year = {2012},
 pages = {659--668}
}

@article{FW2014,
 author = {Yuval Filmus and Justin Ward},
 title = {Monotone submodular maximization over a matroid via non-oblivious local search},
 journal = {SIAM Journal on Computing},
 volume = {43},
 issue = {2},
 year = {2014},
 pages = {514--542}
}
copy to clipboard
arXivjournaltalksextended versionexposition

Theses

Yuval Filmus, Spectral methods in extremal combinatorics, PhD thesis, CMS Doctoral Prize
detailsabstractBibTeX

BibTeX

@phdthesis{Filmus2013,
 author = {Yuval Filmus},
 title = {Spectral methods in extremal combinatorics},
 school = {University of Toronto},
 year = {2013}
}
copy to clipboard
slides
Yuval Filmus, Spectral methods for intersection problems, Depth oral paper
Yuval Filmus, Bandwidth approximation of a restricted family of trees, Master's thesis
detailsabstractBibTeX

BibTeX

@mastersthesis{Filmus2002,
 author = {Yuval Filmus},
 title = {Bandwidth approximation of a restricted family of trees},
 school = {Weizmann institute of science},
 year = {2002}
}
copy to clipboard
slides

Boolean Function Analysis

Yuval Filmus, Guy Kindler, Noam Lifshitz and Dor Minzer, Hypercontractivity on the symmetric group
detailsabstractBibTeX

BibTeX

@misc{FKLM,
 author = {Yuval Filmus and Guy Kindler and Noam Lifshitz and Dor Mintzer},
 title = {Hypercontractivity on the symmetric group},
 year = {2020}
}
copy to clipboard
arXiv
Neta Dafni, Yuval Filmus, Noam Lifshitz, Nathan Lindzey and Marc Vinyals, Complexity measures on symmetric group and beyond, ITCS 2021
detailsabstractBibTeX

BibTeX

@inproceedings{DFLLV2021,
author = {Neta Dafni and Yuval Filmus and Noam Lifshitz and Nathan Lindzey and Marc Vinyals},
title = {Complexity measures on symmetric group and beyond},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
year = {2021}}
copy to clipboard
arXivconferencetalk
Irit Dinur, Yuval Filmus and Prahladh Harsha, Low degree almost Boolean functions are sparse juntas, Preliminary version in SODA'19
detailsabstractBibTeX

BibTeX

@inproceedings{DFH2019,
 author = {Irit Dinur and Yuval Filmus and Prahladh Harsha},
 title = {Analyzing boolean functions on the biased hypercube via higher-dimensional agreement tests},
 booktitle = {ACM-SIAM Symposium on Discrete Algorithms (SODA19)},
 year = {2019}
}

@misc{DFH2020+,
 author = {Irit Dinur and Yuval Filmus and Prahladh Harsha},
 title = {Low degree almost {B}oolean functions are sparse juntas},
 year = {2020+}
}
copy to clipboard
arXiveccc
Yuval Filmus, Noam Lifshitz, Dor Minzer and Elchanan Mossel, AND testing and robust judgement aggregation, STOC 2020
detailsabstractBibTeX

BibTeX

@inproceedings{FLMM2020,
 author = {Yuval Filmus and Noam Lifshitz and Dor Minzer and Elchanan Mossel},
 title = {{AND} testing and robust judgement aggregation},
 booktitle = {52nd ACM Symposium on Theory of Computing (STOC'20)},
 year = {2020}
}
copy to clipboard
arXivtalksvideoslidessimplified version
Yuval Filmus and Ferdinand Ihringer, Boolean constant degree functions on the slice are juntas, Discrete Mathematics
detailsabstractBibTeX

BibTeX

@article{FI2019b,
 author = {Yuval Filmus and Ferdinand Ihringer},
 title = {Boolean constant degree functions on the slice are juntas},
 journal = {Discrete Mathematics},
 volume = {342},
 number = {12},
 pages = {111614},
 year = {2019}
}
copy to clipboard
arXivjournal
Yuval Filmus, FKN theorem for the multislice, with applications, CPC
detailsabstractBibTeX

BibTeX

@article{Filmus2020,
 author = {Yuval Filmus},
 title = {{FKN} theorem for the multislice, with applications},
 journal = {Combinatorics, Probability and Counting},
 volume = {29},
 number = {2},
 year = {2020},
 pages = {200--212}
}
copy to clipboard
arXivjournal
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami and David Zuckerman, Biasing Boolean functions and collective coin-flipping protocols over arbitrary product distributions, ICALP 2019
detailsabstractBibTeX

BibTeX

@inproceedings{FHHHZ2019,
 author = {Yuval Filmus and Lianna Hambardzumyan and Hamed Hatami and Pooya Hatami and David Zuckerman},
 title = {Biasing {B}oolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions},
 booktitle = {46th International Colloquium on Automata, Languages and Programming (ICALP'19)},
 year = {2019}
}
copy to clipboard
arXivecccconference
Irit Dinur, Yotam Dikstein, Yuval Filmus and Prahladh Harsha, Boolean function analysis on high-dimensional expanders, Preliminary version in RANDOM'18
detailsabstractBibTeX

BibTeX

@inproceedings{DDFH2018,
 author = {Yotam Dikstein and Irit Dinur and Yuval Filmus and Prahladh Harsha},
 title = {Boolean function analysis on high-dimensional expanders},
 booktitle = {22nd International Conference on Randomization and Computation (RANDOM'2018)},
 year = {2018}
}
copy to clipboard
arXiveccc
Yuval Filmus and Elchanan Mossel, Harmonicity and invariance on slices of the Boolean cube, CCC 2016, PTRF
detailsabstractBibTeX

BibTeX

@inproceedings{FM2016,
 author = {Yuval Filmus and Elchanan Mossel},
 title = {Harmonicity and invariance on slices of the {B}oolean cube},
 booktitle = {31st Computational Complexity Conference},
 year = {2016}
}

@article{FM2019,
 author = {Yuval Filmus and Elchanan Mossel},
 title = {Harmonicity and invariance on slices of the {B}oolean cube},
 journal = {Probability Theory and Related Fields},
 volume = {175},
 number = {3--4},
 pages = {721--782},
 year = {2019}
}
copy to clipboard
arXivjournal
Yuval Filmus, Ryan O'Donnell and Xinyu Wu, A log-Sobolev inequality for the multislice, with applications, ITCS 2019
detailsabstractBibTeX

BibTeX

@inproceedings{FOW2019,
 author = {Yuval Filmus and Ryan O'Donnell and Xinyu Wu},
 title = {A log-{S}obolev inequality for the multislice, with applications},
 booktitle = {Proceedings of the 10th Innovations in Theoretical Computer Science conference (ITCS'19)},
 year = {2019}
}
copy to clipboard
arXiv
Yuval Filmus and Ferdinand Ihringer, Boolean degree 1 functions on some classical association schemes, JCTA
detailsabstractBibTeX

BibTeX

@article{FI2019a,
 author = {Yuval Filmus and Ferdinand Ihringer},
 title = {Boolean degree 1 functions on some classical association schemes},
 journal = {Journal of Combinatorial Theory, Series A},
 volume = {162},
 pages = {241--270},
 year = {2019}
}
copy to clipboard
arXivjournal
Yuval Filmus, Guy Kindler, Elchanan Mossel and Karl Wimmer, Invariance principle on the slice, CCC 2016, TOCT
detailsabstractBibTeX

BibTeX

@inproceedings{FKMW2016,
 author = {Yuval Filmus and Guy Kindler and Elchanan Mossel and Karl Wimmer},
 title = {Invariance principle on the slice},
 booktitle = {31st Computational Complexity Conference},
 year = {2016}
}

@article{FKMW2018,
 author = {Yuval Filmus and Guy Kindler and Elchanan Mossel and Karl Wimmer},
 title = {Invariance principle on the slice},
 journal = {ACM Transactions on Computation Theory},
 volume = {10},
 number = {3},
 year = {2018},
 pages = {11}
}
copy to clipboard
arXiv
Yuval Filmus, Friedgut–Kalai–Naor theorem for slices of the Boolean cube, Chicago Journal of Theoretical Computer Science
detailsabstractBibTeX

BibTeX

@article{Filmus2016b,
 author = {Yuval Filmus},
 title = {Friedgut--{K}alai--{N}aor theorem for slices of the {B}oolean cube},
 journal = {Chicago Journal of Theoretical Computer Science},
 year = {2016},
 pages = {14:1--14:17}
}
copy to clipboard
arXivjournal
Yuval Filmus, An orthogonal basis for functions over a slice of the Boolean cube, Electronic Journal of Combinatorics
detailsabstractBibTeX

BibTeX

@article{Filmus2016a,
 author = {Yuval Filmus},
 title = {Orthogonal basis for functions over a slice of the
 {B}oolean hypercube},
 journal = {Electronic Journal of Combinatorics},
 volume = {23},
 number = {1},
 year = {2016},
 pages = {P1.23}
}
copy to clipboard
arXivjournal
David Ellis, Yuval Filmus and Ehud Friedgut, Low-degree Boolean functions on $S_n$, with an application to isoperimetry, Forum of Mathematics, Sigma, Volume 5, 2017
detailsabstractBibTeX

BibTeX

@article{EFF3,
 author = {David Ellis and Yuval Filmus and Ehud Friedgut},
 title = {Low-degree {B}oolean functions on {$S_n$}, with an application to isoperimetry},
 journal = {Forum of Mathematics, Sigma},
 volume = {5},
 publisher = {Cambridge University Press},
 DOI = {10.1017/fms.2017.24},
 year = {2017}
}
copy to clipboard
arXivjournal
Yuval Filmus, Hamed Hatami, Nathan Keller and Noam Lifshitz, On the sum of $L_1$ influences of bounded functions, Israel Journal of Mathematics, Volume 214, Issue 1, 2016, pp. 167–192
detailsabstractBibTeX

BibTeX

@article{FHKL2016,
 author = {Yuval Filmus and Hamed Hatami and Nathan Keller and Noam Lifshitz},
 title = {Bounds on the sum of {L1} influences},
 journal = {Israel Journal of Matematics},
 volume = {214},
 number = {1},
 year = {2016},
 pages = {167--192}
}
copy to clipboard
arXivjournal
David Ellis, Yuval Filmus and Ehud Friedgut, A stability result for balanced dictatorships in $S_n$, Random Structures and Algorithms, Volume 46, Issue 3, 2015, pp. 494–530
detailsabstractBibTeX

BibTeX

@article{EFF2,
 author = {David Ellis and Yuval Filmus and Ehud Friedgut},
 title = {A stability result for balanced dictatorships in {$S_n$}},
 journal = {Random Structures and Algorithms},
 volume = {46},
 number = {3},
 year = {2015},
 pages = {494--530}
}
copy to clipboard
arXivjournaltalk
David Ellis, Yuval Filmus and Ehud Friedgut, A quasi-stability result for dictatorships in $S_n$, Combinatorica, Volume 35, Issue 5, 2015, pages 573–618
detailsabstractBibTeX

BibTeX

@article{EFF1,
 author = {David Ellis and Yuval Filmus and Ehud Friedgut},
 title = {A quasi-stability result for dictatorships in {$S_n$}},
 journal = {Combinatorica},
 volume = {35},
 number = {5},
 pages = {573--618},
 year = {2015}
}
copy to clipboard
arXivjournal

Combinatorics

Yuval Filmus, Konstantin Golubev and Noam Lifshitz, High-dimensional Hoffman bound and extremal combinatorics, Submitted
detailsabstractBibTeX

BibTeX

@unpublished{FGL2019,
 author = {Yuval Filmus and Konstantin Golubev and Noam Lifshitz},
 title = {High dimensional Hoffman bound and applications in extremal combinatorics},
 year = {2019}
}
copy to clipboard
arXivtalk
Yuval Dagan, Yuval Filmus, Daniel Kane and Shay Moran, The entropy of lies: playing twenty questions with a liar, ITCS 2021
detailsabstractBibTeX

BibTeX

@inproceedings{DFKM2018,
 author = {Yuval Dagan and Yuval Filmus Daniel Kane and Shay Moran},
 title = {The entropy of lies: playing twenty questions with a liar},
 booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
 year = {2021}
}
copy to clipboard
arXivconference
Yuval Filmus, More complete intersection theorems, Disc. Math. vol. 342(10), 128–142, 2019
detailsabstractBibTeX

BibTeX

@article{Filmus2019,
 author = {Yuval Filmus},
 title = {More complete intersection theorems},
 journal = {Discrete Mathematics},
 year = {2019},
 month = 1,
 volume = {342},
 number = {1},
 pages = {128--142}
}
copy to clipboard
journal
Yuval Dagan, Yuval Filmus, Ariel Gabizon and Shay Moran, Twenty (short) questions, Combinatorica
detailsabstractBibTeX

BibTeX

@article{DFGM2019,
 author = {Yuval Dagan and Yuval Filmus and Ariel Gabizon and Shay Moran},
 title = {Twenty (short) questions},
 journal = {Combinatorica},
 volume = {39},
 number = {3},
 pages = {597--626},
 year = {2019}
}
copy to clipboard
journal
Stijn Cambie, Bogdan Chronomaz, Zeev Dvir, Yuval Filmus and Shay Moran, A Sauer–Shelah–Perles lemma for lattices, Electronic Journal of Combinatorics
detailsabstractBibTeX

BibTeX

@article{CCDFM2020,
 author = {Stijn Cambie and Bogdan Chornomaz and Zeev Dvir and Yuval Filmus and Shay Moran},
 title = {A {S}auer--{S}helah--{P}erles Lemma for Lattices},
 journal = {Electronic Journal of Combinatorics},
 volume = {27},
 number = {4},
 pages = {P4.19},
 year = {2020}
}
copy to clipboard
arXivjournaltalk
Yuval Filmus, A comment on Intersecting families of permutations, Manuscript
detailsabstractBibTeX

BibTeX

@misc{Filmus2017,
 author = {Yuval Filmus},
 title = {A comment on Intersecting Families of Permutations},
 howpublished = {arXiv:1706.10146},
 year = {2017}
}
copy to clipboard
arXiv
Yuval Filmus, The weighted complete intersection theorem, JCTA, Volume 151, 2017, pp. 84–101
detailsabstractBibTeX

BibTeX

@article{Filmus2017,
 author = {Yuval Filmus},
 title = {The weighted complete intersection theorem},
 journal = {Journal of Combinatorial Theory, Series A},
 volume = {151},
 pages = {84--101},
 year = {2017}
}
copy to clipboard
arXivjournalfull version
Yuval Dagan, Yuval Filmus and Shay Moran, Comparison and equality queries achieve optimal redundancy, Manuscript
Yuval Dagan, Yuval Filmus and Shay Moran, Asymptotic redundancy and prolixity, Manuscript
Yuval Dagan, Yuval Filmus, Ariel Gabizon and Shay Moran, Twenty (simple) questions, STOC 2017, Invited to HALG 2018
detailsabstractBibTeX

BibTeX

@inproceedings{DFGM2017,
 author = {Yuval Dagan and Yuval Filmus and Ariel Gabizon and Shay Moran},
 title = {Twenty (simple) questions},
 booktitle = {49th ACM Symposium on Theory of Computing (STOC 2017)},
 year = {2017}
}
copy to clipboard
arXivconferencetalksfull version
David Ellis, Yuval Filmus and Ehud Friedgut, Triangle-intersecting families of graphs, Journal of the European Mathematical Society, Volume 14, Issue 3, 2012, pp. 841–885
detailsabstractBibTeX

BibTeX

@article{EFF2012,
 author = {David Ellis and Yuval Filmus and Ehud Friedgut},
 title = {Triangle-intersecting families of graphs},
 journal = {Journal of the European Mathematical Society},
 volume = {14},
 number = {3},
 year = {2012},
 pages = {841--885}
}
copy to clipboard
arXivjournaltalks
Yuval Filmus, The carromboard problem, Manuscript

Property Testing

Yuval Filmus, Noam Lifshitz, Dor Minzer and Elchanan Mossel, AND testing and robust judgement aggregation, STOC 2020
detailsabstractBibTeX

BibTeX

@inproceedings{FLMM2020,
 author = {Yuval Filmus and Noam Lifshitz and Dor Minzer and Elchanan Mossel},
 title = {{AND} testing and robust judgement aggregation},
 booktitle = {52nd ACM Symposium on Theory of Computing (STOC'20)},
 year = {2020}
}
copy to clipboard
arXivtalksvideoslidessimplified version
Irit Dinur, Yuval Filmus and Prahladh Harsha, Agreement tests on graphs and hypergraphs, Preliminary version in SODA'19
detailsabstractBibTeX

BibTeX

@misc{DFH2020+,
 author = {Irit Dinur and Yuval Filmus and Prahladh Harsha},
 title = {Agreement tests on graphs and hypergraphs},
 year = {2020+},
}

@inproceedings{DFH2019,
 author = {Irit Dinur and Yuval Filmus and Prahladh Harsha},
 title = {Analyzing boolean functions on the biased hypercube via higher-dimensional agreement tests},
 booktitle = {ACM-SIAM Symposium on Discrete Algorithms (SODA19)},
 year = {2019}
}
copy to clipboard
arXivecccconference

Computational Complexity

Yuval Filmus, Or Meir and Avishay Tal, Shrinkage under random projections and cubic formula lower bounds for AC^0, ITCS 2021
detailsabstractBibTeX

BibTeX

@inproceedings{FMT2021,
title = {Shrinkage under random projections and cubic formula lower bounds for {$mathit{AC}^0$}},
author = {Yuval Filmus and Or Meir and Avishay Tal},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
year = {2021}}
copy to clipboard
arXivecccconference
Irit Dinur, Yuval Filmus, Prahladh Harsha and Madhur Tulsiani, Explicit and structured sum of squares lower bounds from high-dimensional expanders, ITCS 2021
detailsabstractBibTeX

BibTeX

@inproceedings{DFHT2021,
 title = {Explicit and structured sum of squares lower bounds from high-dimensional expanders},
 author = {Irit Dinur and Yuval Filmus and Prahladh Harsha and Madhur Tulsiani},
 booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
 year = {2021}
}
copy to clipboard
arXivecccconference
Yuval Filmus, Yuval Ishai, Avi Kaplan and Guy Kindler, Limits of preprocessing, CCC 2020
detailsabstractBibTeX

BibTeX

@InProceedings{FIKK2020,
 author = {Yuval Filmus and Yuval Ishai and Avi Kaplan and Guy Kindler},
 title = {{Limits of Preprocessing}},
 booktitle = {35th Computational Complexity Conference (CCC 2020)},
 pages = {17:1--17:22},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 ISBN = {978-3-95977-156-6},
 ISSN = {1868-8969},
 year = {2020},
 volume = {169},
 editor = {Shubhangi Saraf},
 publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
 address = {Dagstuhl, Germany},
 URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12569},
 URN = {urn:nbn:de:0030-drops-125697},
 doi = {10.4230/LIPIcs.CCC.2020.17},
 annote = {Keywords: circuit, communication complexity, IPPP, preprocessing, PRF, simultaneous messages}
}
copy to clipboard
conference
Andris Ambainis, Yuval Filmus and François Le Gall, Fast matrix multiplication: limitations of the Coppersmith–Winograd method, STOC 2015
detailsabstractBibTeX

BibTeX

@inproceedings{AFLG2015,
 author = {Ambainis, Andris and Filmus, Yuval and Le Gall, Franc{c}ois},
 title = {Fast matrix multiplication: limitations of the {C}oppersmith--{W}inograd method},
 booktitle = {47th Annual Symposium on the Theory of Computing ({STOC} 2015)},
 year = {2015},
 pages = {585--593}
}
copy to clipboard
arXiveccctalksslides
Yuval Filmus, Toniann Pitassi, Robert Robere and Stephen A. Cook, Average case lower bounds for monotone switching networks, FOCS 2013
detailsabstractBibTeX

BibTeX

@inproceedings{FPRC2013,
 author = {Yuval Filmus and Toniann Pitassi and Robert Robere and
 Stephen A. Cook},
 title = {Average case lower bounds for monotone switching networks},
 booktitle = {The 54th Annual Symposium on Foundations of Computer
 Science ({FOCS} 2013)},
 pages = {598--607},
 year = {2013}
}
copy to clipboard
ecccextended abstract
Stephen A. Cook, Yuval Filmus and Dai Lê, The complexity of the comparator circuit value problem, TOCT
detailsabstractBibTeX

BibTeX

@article{CFL2014,
 author = {Stephen A. Cook and Yuval Filmus and Dai L\^e},
 title = {The complexity of the comparator circuit value problem},
 journal = {ACM Transactions on Computation Theory},
 volume = {6},
 number = {4},
 articleno = {15},
 pages = {15:1--15:44},
 year = {2014}
}
copy to clipboard
arXivposter

Communication Complexity

Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir and Toni Pitassi, Query-to-communication lifting for BPP using inner product, ICALP'19, SICOMP
detailsabstractBibTeX

BibTeX

@inproceedings{CFKMP2019,
 title = {Query-to-communication lifting for {BPP} using inner product},
 author = {Arkadev Chattopadhyay and Yuval Filmus and Sajin Koroth and Or Meir and Toniann Pitassi},
 booktitle = {46th International Colloquium on Automata, Languages and Programming (ICALP'19)},
 year = {2019}
}

@article{CFKMP2021,
 title = {Query-to-communication lifting for {BPP} using inner product},
 author = {Arkadev Chattopadhyay and Yuval Filmus and Sajin Koroth and Or Meir and Toniann Pitassi},
 journal = {SIAM J. Comp.},
 volume = {50},
 number = {1},
 pages = {171--210},
 year = {2021}
}
copy to clipboard
arXivecccjournalconference
Yuval Dagan, Yuval Filmus, Hamed Hatami and Yaqiao Li, Trading information complexity for error, CCC 2017, Theory of Computing
detailsabstractBibTeX

BibTeX

@inproceedings{DFHL2017,
 author = {Yuval Dagan and Yuval Filmus and Hamed Hatami and Yaqiao Li},
 title = {Trading information complexity for error},
 booktitle = {32nd Conference on Computational Complexity (CCC 2017)},
 year = {2017}
}
@article{DFHL2018,
 author = {Yuval Dagan and Yuval Filmus and Hamed Hatami and Yaqiao Li},
 title = {Trading information complexity for error},
 journal = {Theory of Computing},
 volume = {14},
 pages = {6:1--73},
 year = {2018}
}
copy to clipboard
arXivecccjournal
Yuval Filmus, Hamed Hatami, Yaqiao Li and Suzin You, Information complexity of the AND function in the two-party and multiparty settings, COCOON'17, Algorithmica
detailsabstractBibTeX

BibTeX

@inproceedings{FHLY2017,
 author = {Yuval Filmus and Hamed Hatami and Yaqiao Li and Suzin You},
 title = {Information complexity of the {AND} function in the two-party, and multiparty settings},
 booktitle = {23rd annual international computing and combinatorics conference (COCOON'17)},
 year = {2017}
}
@article{FHLY2019,
 author = {Yuval Filmus and Hamed Hatami and Yaqiao Li and Suzin You},
 title = {Information complexity of the {AND} function in the two-party, and multiparty settings},
 journal = {Algorithmica},
 volume = {81},
 number = {11--12},
 pages = {4200--4237},
 year = {2019}
}
copy to clipboard
arXiv

Proof Complexity

Yuval Filmus, Meena Mahajan, Gaurav Sood and Marc Vinyals, MaxSAT Resolution and Subcube Sums, SAT 2020
detailsabstractBibTeX

BibTeX

@inproceedings{FMSV2020,
 author = {Yuval Filmus and Meena Mahajan and Gaurav Sood and Marc Vinyals},
 title = {{MaxSAT} Resolution and Subcube Sums},
 booktitle = {SAT'20},
 year = {2020}
}
copy to clipboard
arXiveccc
Yuval Filmus, Another look at degree lower bounds for polynomial calculus, Theoretical Computer Science
detailsabstractBibTeX

BibTeX

@article{Filmus2019,
 author = {Yuval Filmus},
 title = {Another look at degree lower bounds for polynomial calculus},
 journal = {Theoretical Computer Science},
 volume = {796},
 pages = {286--293},
 year = {2019}
}
copy to clipboard
journal
Yuval Filmus, Massimo Lauria, Mladen Mikša, Jakob Nordström and Marc Vinyals, From small space to small width in resolution, STACS 2014, TOCL
detailsabstractBibTeX

BibTeX

@inproceedings{FLMNV2014,
 author = {Yuval Filmus and Massimo Lauria and Mladen Mik\v{s}a and
 Jakob Nordstr\"om and Marc Vinyals},
 title = {From small space to small width in resolution},
 booktitle = {The 31st Symposium on Theoretical Aspects of Computer
 Science ({STACS} 2014)},
 year = {2014},
 pages = {300--311}
}

@article{FLMNV2015,
 author = {Yuval Filmus and Massimo Lauria and Mladen Mikv{s}a and
 Jakob Nordstr"om and Marc Vinyals},
 title = {From small space to small width in resolution},
 journal = {ACM Transactions on Computational Logic},
 volume = {16},
 number = {4},
 year = {2015},
 pages = {28}
}
copy to clipboard
journal
Yuval Filmus, Pavel Hrubeš and Massimo Lauria, Semantic versus syntactic cutting planes, STACS 2016
detailsabstractBibTeX

BibTeX

@inproceedings{FHL2016,
 author = {Yuval Filmus and Pavel Hrube\v{s} and Massimo Lauria},
 title = {Semantic versus syntactic cutting planes},
 booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
 year = {2016}
}
copy to clipboard
talk
Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen and Noga Zewi, Space complexity in polynomial calculus, CCC 2012, SICOMP
detailsabstractBibTeX

BibTeX

@inproceedings{FLNTZ2012,
 author = {Yuval Filmus and Massimo Lauria and Jakob Nordstr\"om and
 Neil Thapen and Noga Zewi},
 title = {Space complexity in polynomial calculus},
 booktitle = {The 27th Annual Conference on Computational Complexity ({CCC} 2012)},
 year = {2012}
}
@article{FLNTZ2015,
 author = {Yuval Filmus and Massimo Lauria and Jakob Nordstr\"om and
 Neil Thapen and Noga Zewi},
 title = {Space complexity in polynomial calculus},
 journal = {SIAM J. Comput.},
 volume = {44},
 number = {4},
 pages = {1119--1153},
 year = {2015}
}
copy to clipboard
ecccjournal
Yuval Filmus, Toniann Pitassi and Rahul Santhanam, Exponential lower bounds for $\mathsf{AC^0}$-Frege imply superpolynomial Frege lower bounds, ICALP 2011, ToCT
detailsabstractBibTeX

BibTeX

@inproceedings{FPS2011,
 author = {Yuval Filmus and Toniann Pitassi and Rahul Santhanam},
 title = {Exponential lower bounds for {AC$^0$}-{F}rege imply
 superpolynomial {F}rege lower bounds},
 booktitle = {The 38th International Colloquium on Automata,
 Languages and Programming ({ICALP} 2011)},
 year = {2011},
 pages = {618--629}
}

@article{FPS2015,
 author = {Yuval Filmus and Toniann Pitassi and Rahul Santhanam},
 title = {Exponential lower bounds for {AC$^0$}-{F}rege imply
 superpolynomial {F}rege lower bounds},
 journal = {ACM Trans. Comput. Th.},
 volume = {7},
 number = {2},
 year = {2015},
 pages = {article 5}
}  
copy to clipboard
conferenceslides

Approximation Algorithms

Yuval Filmus, Yasushi Kawase, Yusuke Kobayashi and Yutaro Yamaguchi, Tight Approximation for Unconstrained XOS Maximization, Accepted to Math of OR
detailsabstractBibTeX

BibTeX

@article{FKKY2020+,
 title = {Tight Approximation for Unconstrained {XOS} Maximization},
 author = {Yuval Filmus and Yasushi Kawase and Yusuke Kobayashi and Yutaro Yamaguchi},
 journal = {Mathematics of Operations Research},
 year = {Accepted},
}
copy to clipboard
arXivjournal
Niv Buchbinder, Moran Feldman, Yuval Filmus and Mohit Garg, Online submodular maximization: beating 1/2 made simple, IPCO 2019, Math Prog
detailsabstractBibTeX

BibTeX

@inproceedings{BFFG2019,
 title = {Online submodular maximization: beating 1/2 made simple},
 author = {Niv Buchbinder and Moran Feldman and Yuval Filmus and Mohit Garg},
 booktitle = {20th Conference on Integer Programming and Combinatorial Optimization (IPCO'19)},
 year = {2019}
}

@journal{BFFG2020,
 title = {Online submodular maximization: beating 1/2 made simple},
 author = {Niv Buchbinder and Moran Feldman and Yuval Filmus and Mohit Garg},
 journal = {Mathematical Programming},
 volume = {183},
 pages = {149--169},
 year = {2020}
}
copy to clipboard
arXivjournal
Yuval Filmus, Random order greedy up to 4 parts, Manuscript
detailsabstractBibTeX

BibTeX

@unpublished{Filmus2018,
 title = {Random order greedy up to 4 parts},
 author = {Yuval Filmus},
 howpublished = {Manuscript},
 year = {2018}
}
copy to clipboard
Yuval Filmus and Justin Ward, A tight combinatorial algorithm for submodular maximization subject to a matroid constraint, FOCS 2012, SICOMP
detailsabstractBibTeX

BibTeX

@inproceedings{FW2012b,
 author = {Yuval Filmus and Justin Ward},
 title = {A tight combinatorial algorithm for submodular maximization
 subject to a matroid constraint},
 booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science ({FOCS} 2012)},
 year = {2012},
 pages = {659--668}
}

@article{FW2014,
 author = {Yuval Filmus and Justin Ward},
 title = {Monotone submodular maximization over a matroid via non-oblivious local search},
 journal = {SIAM Journal on Computing},
 volume = {43},
 issue = {2},
 year = {2014},
 pages = {514--542}
}
copy to clipboard
arXivjournaltalksextended versionexposition
Yuval Filmus and Justin Ward, Maximum coverage over a matroid, STACS 2012
detailsabstractBibTeX

BibTeX

@inproceedings{FW2012a,
 author = {Yuval Filmus and Justin Ward},
 title = {Maximum coverage over a matroid},
 booktitle = {29th Symposium on Theoretical Aspects of Computer
 Science ({STACS} 2012)},
 year = {2012},
 pages = {601--612}
}
copy to clipboard
slides
Yuval Filmus, Bandwidth approximation of a restricted family of trees, Master's thesis
detailsabstractBibTeX

BibTeX

@mastersthesis{Filmus2002,
 author = {Yuval Filmus},
 title = {Bandwidth approximation of a restricted family of trees},
 school = {Weizmann institute of science},
 year = {2002}
}
copy to clipboard
slides

Social Choice Theory

Yuval Filmus, Joel Oren and Kannan Soundararajan, Shapley values in random weighted voting games, Manuscript
detailsabstractBibTeX

BibTeX

@unpublished{FOS2017,
 author = {Yuval Filmus and Joel Oren and Kannan Soundararajan},
 title = {Shapley values in weighted voting games with random weights},
 note = {Manuscript},
 year = {2017}
}
copy to clipboard
Yuval Filmus, Joel Oren, Yair Zick and Yoram Bachrach, Power distribution in randomized weighted voting: the effects of the quota, IJCAI 2016 (first half), SAGT 2016, TOCS (second half)
detailsabstractBibTeX

BibTeX

@inproceedings{BFOZ2016a,
   author = {Yoram Bachrach and Yuval Filmus and Joel Oren and Yair Zick},
   title = {A Characterization of Voting Power for Discrete Weight Distributions},
   booktitle = {Proceedings of the 26th International Joint Conference on Artificial Intelligence ({IJCAI} 2016)},
   year = {2016}
}

@inproceedings{BFOZ2016b,
   author = {Yoram Bachrach and Yuval Filmus and Joel Oren and Yair Zick},
   title = {Analyzing Power in Weighted Voting Games With Super-Increasing Weights},
   booktitle = {Proceedings of the 9th International Symposium on Algorithmic Game Theory ({SAGT} 2016)},
   year = {2016}
}
@article{BFOZ2019,
   author = {Yoram Bachrach and Yuval Filmus and Joel Oren and Yair Zick},
   title = {Analyzing Power in Weighted Voting Games With Super-Increasing Weights},
   journal = {Theory of Computing Systems},
   volume = {63},
   number = {1},
   pages = {150--174},
   year = {2019}
}
copy to clipboard
Yuval Filmus and Joel Oren, Efficient voting via the top-$k$ elicitation scheme: a probabilistic approach, EC 2014
detailsabstractBibTeX

BibTeX

@inproceedings{FO2014,
 author = {Yuval Filmus and Joel Oren},
 title = {Efficient voting via the top-$k$ elicitation scheme: a
 probabilistic approach},
 booktitle = {Electronic Commerce (EC)},
 year = {2014},
 pages = {295--312}
}
copy to clipboard
Craig Boutilier, Yuval Filmus and Joel Oren, Efficient vote elicitation under candidate uncertainty, IJCAI 2013
detailsabstractBibTeX

BibTeX

@inproceedings{BFO2013,
 author = {Craig Boutilier and Yuval Filmus and Joel Oren},
 title = {Efficient vote elicitation under candidate uncertainty},
 booktitle = {23rd International Joint Conference on Artificial Intelligence
 ({IJCAI} 2013)},
 year = {2013},
 pages = {309--316}
}
copy to clipboard
conference version
Allan Borodin, Yuval Filmus and Joel Oren, Threshold models for competitive influence in social networks, WINE 2010
detailsabstractBibTeX

BibTeX

@inproceedings{BFO2010,
 author = {Allan Borodin and Yuval Filmus and Joel Oren},
 title = {Threshold models for competitive influence in social networks},
 booktitle = {The 6th Workshop on Internet and Network Economics
 ({WINE} 2010)},
 year = {2010},
 pages = {539--550}
}
copy to clipboard

Miscellaneous

Ofir Gordon, Yuval Filmus, Oren Salzman, Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds, SOCS 2021
detailsabstractBibTeX

BibTeX

@inproceedings{GFS21,
title = {Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds},
author = {Ofir Gordon and Yuval Filmus and Oren Salzman},
booktitle = {SOCS'21},
year = {2021}
}
copy to clipboard
arXiv
Yuval Filmus, Asymptotic performance of the Grimmett–McDiarmid heuristic, Manuscript
detailsabstractBibTeX

BibTeX

@article{Filmus2020+,
 author = {Yuval Filmus},
 title = {Asymptotic performance of the {G}rimmett--{M}c{D}iarmid heuristic},
 journal = {Manuscript}
}
copy to clipboard
arXiv
Edinah K. Gnang and Yuval Filmus, On the Bhattacharya–Mesner rank of third order hypermatrices, Linear Algebra and its Applications, Volume 588, 2020, pp. 391–418
detailsabstractBibTeX

BibTeX

@article{GF2020,
 author = {Edinah K. Gnang and Yuval Filmus},
 title = {On the {B}hattacharya--{M}esner rank of third order hypermatrices},
 journal = {Linear Algebra and its Applications},
 volume = {588},
 year = {2020},
 pages = {391--418}
}
copy to clipboard
journal
Edinah K. Gnang and Yuval Filmus, On the spectra of direct sums and Kronecker product constructions, Linear Algebra and its Applications, Volume 519, 2017, pp. 238–277
detailsabstractBibTeX

BibTeX

@article{GF2017,
 author = {Edinah K. Gnang and Yuval Filmus},
 title = {On the spectra of direct sums and {K}ronecker product constructions},
 journal = {Linear Algebra and its Applications},
 volume = {519},
 pages = {238--277},
 year = {2017}
}
copy to clipboard
arXivjournal
Yuval Filmus, Lower bounds for context-free grammars, Information Processing Letters, Volume 111, Issue 18, 2011, pp. 895–898
detailsabstractBibTeX

BibTeX

@article{Filmus2011,
 author = {Yuval Filmus},
 title = {Lower bounds for context-free grammars},
 journal = {Information Processing Letters},
 volume = {111},
 issue = {18},
 year = {2011},
 pages = {895--898}
}
copy to clipboard
journal
Yuval Filmus, Universal codes of the natural numbers, Logical Methods in Computer Science, Volume 9, Issue 3, 2013, Paper 7
detailsabstractBibTeX

BibTeX

@article{Filmus2013,
 author = {Yuval Filmus},
 title = {Universal codes of the natural numbers},
 journal = {Logical Methods in Computer Science},
 volume = {9},
 issue = {3},
 year = {2013},
 pages = {paper 7}
}
copy to clipboard
arXivjournal
Yuval Filmus, Inequalities on submodular functions via term rewriting, Information Processing Letters, Volume 113, Issue 13, 2013, pp. 457–464
detailsabstractBibTeX

BibTeX

@article{Filmus2013,
 author = {Yuval Filmus},
 title = {Inequalities on submodular functions via term rewriting},
 journal = {Information Processing Letters},
 volume = {113},
 issue = {13},
 year = {2013},
 pages = {457--464}
}
copy to clipboard
Philip Bohannon, Nilesh Dalvi, Yuval Filmus, Nori Jacoby, Sathiya Keerthi and Alok Kirpal, Automatic web-scale information extraction, SIGMOD 2012
detailsabstractBibTeX

BibTeX

@inproceedings{BDFJKK2012,
 author = {Philip Bohannon and Nilesh Dalvi and Yuval Filmus and Nori
 Jacoby and Sathiya Keerthi and Alok Kirpal},
 title = {Automatic web-scale information extraction},
 booktitle = {Proceedings of the 2012 {ACM} {SIGMOD} International Conference on Management of Data},
 year = {2012},
 pages = {609--612}
}
copy to clipboard
conference