( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Power of Local Search: Maximum Coverage over a Matroid.

, и . STACS, том 14 из LIPIcs, стр. 601-612. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Yuval Hen

Yuval Marton

Yuval Sanders

Yuval Shavitt

Yuval Shahar

 

Другие публикации лиц с тем же именем

Shapley Values in Weighted Voting Games with Random Weights., , и . CoRR, (2016)Efficient voting via the top-k elicitation scheme: a probabilistic approach., и . EC, стр. 295-312. ACM, (2014)Bounded Indistinguishability for Simple Sources., , , , , и . Electron. Colloquium Comput. Complex., (2021)Approximate polymorphisms., , , , и . CoRR, (2021)Explicit SoS Lower Bounds from High-Dimensional Expanders., , , и . ITCS, том 185 из LIPIcs, стр. 38:1-38:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Query-To-Communication Lifting for BPP Using Inner Product., , , , и . ICALP, том 132 из LIPIcs, стр. 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)A Characterization of Voting Power for Discrete Weight Distributions., , , и . IJCAI, стр. 74-80. IJCAI/AAAI Press, (2016)Lifting Dichotomies., , и . CCC, том 300 из LIPIcs, стр. 9:1-9:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds., , и . ICALP (1), том 6755 из Lecture Notes in Computer Science, стр. 618-629. Springer, (2011)A Log-Sobolev Inequality for the Multislice, with Applications., , и . ITCS, том 124 из LIPIcs, стр. 34:1-34:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)