Flavio Chierichetti
| Titolo | Pubblicato in | Anno |
|---|---|---|
| Instance-optimal information-based voting | THEORETICAL COMPUTER SCIENCE | 2024 |
| Approximating a RUM from distributions on k-slates | Proceedings of The 26th International Conference on Artificial Intelligence and Statistics | 2023 |
| Information foraging with an oracle | 2023 | |
| Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models | Proceedings of The 25th International Conference on Artificial Intelligence and Statistics | 2022 |
| On additive approximate submodularity | THEORETICAL COMPUTER SCIENCE | 2022 |
| On the number of trials needed to distinguish similar alternatives | PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA | 2022 |
| The Gibbs-Rand Model | Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems | 2022 |
| RUMs from Head-to-Head Contests | International Conference on Machine Learning, {ICML} 2022, 17-23 July 2022, Baltimore, Maryland, {USA} | 2022 |
| Light RUMs | Proceedings of the 38th International Conference on Machine Learning | 2021 |
| Online Facility Location with Multiple Advice | Advances in Neural Information Processing Systems | 2021 |
| Asymptotic Behavior of Sequence Models | The Web Conference 2020 - Proceedings of the World Wide Web Conference, WWW 2020 | 2020 |
| On the distortion of locality sensitive hashing | SIAM JOURNAL ON COMPUTING | 2019 |
| Matroids, Matchings, and Fairness | AISTATS | 2019 |
| Locality sensitive hashing schemes, similarities, and distortion (invited talk) | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2019 |
| Motif counting beyond five nodes | ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA | 2018 |
| Discrete choice, permutations, and reconstruction | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2018 |
| Rumor spreading and conductance | JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY | 2018 |
| On the complexity of sampling vertices uniformly from a graph | Leibniz International Proceedings in Informatics, LIPIcs | 2018 |
| Learning a mixture of two multinomial logits | Proceedings of the 35th International Conference on Machine Learning | 2018 |
| A reduction for efficient LDA topic reconstruction | Advances in Neural Information Processing Systems 31 (NIPS 2018) | 2018 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma