( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems.

, , , и . ICALP, том 229 из LIPIcs, стр. 7:1-7:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

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.

Walter Pasinato

Enrico Pasin

Marcia Pasin

Attila Pasinli

Samuele Pasini

 

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

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard., , , , , и . CoRR, (2017)Improved Lower Bound for Differentially Private Facility Location.. CoRR, (2024)Almost-Polynomial Ratio ETH-Hardness of Approximating Densest k-Subgraph.. Electron. Colloquium Comput. Complex., (2016)Nearly Optimal Robust Secret Sharing Against Rushing Adversaries., , и . CRYPTO (3), том 12172 из Lecture Notes in Computer Science, стр. 156-185. Springer, (2020)Differentially Private Aggregation in the Shuffle Model: Almost Central Accuracy in Almost a Single Message., , , , и . ICML, том 139 из Proceedings of Machine Learning Research, стр. 3692-3701. PMLR, (2021)On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic., и . ITCS, том 124 из LIPIcs, стр. 17:1-17:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Differentially Private Ad Conversion Measurement., , , , , , , , и . CoRR, (2024)The Price of Justified Representation., , , , , и . AAAI, стр. 4983-4990. AAAI Press, (2022)Deep Learning with Label Differential Privacy., , , , и . NeurIPS, стр. 27131-27145. (2021)Cryptographic Hardness of Learning Halfspaces with Massart Noise., , , и . NeurIPS, (2022)