Alessandro Panconesi

Pubblicazioni

Titolo Pubblicato in Anno
Approximating a RUM from distributions on k-slates Proceedings of The 26th International Conference on Artificial Intelligence and Statistics 2023
k-Clustering with Fair Outliers WSDM '22: Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining 2022
OLIVAW: Mastering Othello without Human Knowledge, nor a Penny IEEE TRANSACTIONS ON GAMES 2022
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models Proceedings of The 25th International Conference on Artificial Intelligence and Statistics 2022
RUMs from Head-to-Head Contests International Conference on Machine Learning, {ICML} 2022, 17-23 July 2022, Baltimore, Maryland, {USA} 2022
Errare humanum est? A pilot study to evaluate the human-likeness of a ai othello playing agent IVA 2022 - Proceedings of the 22nd ACM International Conference on Intelligent Virtual Agents 2022
Twin Peaks, a Model for Recurring Cascades WWW '21: Proceedings of the Web Conference 2021 2021
Online Facility Location with Multiple Advice Advances in Neural Information Processing Systems 2021
Tracks from hell — When finding a proof may be easier than checking it THEORETICAL COMPUTER SCIENCE 2020
On the distortion of locality sensitive hashing SIAM JOURNAL ON COMPUTING 2019
Rumor spreading via coupling special volume is honor of Vladas Sidoravicius 2019
Motivo: fast motif counting via succinct color coding and adaptive sampling PROCEEDINGS OF THE VLDB ENDOWMENT 2019
Motif counting beyond five nodes ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA 2018
Together We Buy, Alone I Quit. Some Experimental Studies of Online Persuaders DTUC '18 Proceedings of the 1st International Conference on Digital Tools & Uses Congress 2018
Rumor spreading and conductance JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY 2018
Songs of a Future Past - An Experimental Study of Online Persuaders Proceedings of the Twelfth International AAAI Conference on Web and Social Media 2018
Trainyard is NP-Hard THEORETICAL COMPUTER SCIENCE 2018
Tracks from hell - when finding a proof may be easier than checking it Leibniz International Proceedings in Informatics, LIPIcs 2018
A reduction for efficient LDA topic reconstruction Advances in Neural Information Processing Systems 31 (NIPS 2018) 2018
Counting graphlets: space vs time WSDM 2017 - Proceedings of the 10th ACM International Conference on Web Search and Data Mining 2017

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma