Luca Becchetti
Professore Associato
E-mail:
| Titolo | Pubblicato in | Anno |
|---|---|---|
| Average whenever you meet: Opportunistic protocols for community detection | 26th Annual European Symposium on Algorithms (ESA 2018) | 2018 |
| Find your place: Simple distributed algorithms for community detection | Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017 |
| Simple dynamics for plurality consensus | DISTRIBUTED COMPUTING | 2017 |
| Performance improvements for search systems using an integrated cache of lists + intersections | INFORMATION RETRIEVAL | 2017 |
| Tour recommendation for groups | DATA MINING AND KNOWLEDGE DISCOVERY | 2017 |
| Stabilizing consensus with many opinions | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms | 2016 |
| Stochastic Query Covering for Fast Approximate Document Retrieval | ACM TRANSACTIONS ON INFORMATION SYSTEMS | 2015 |
| Inefficiency of Games with Social Context | THEORY OF COMPUTING SYSTEMS | 2015 |
| Plurality consensus in the gossip model | Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2015 |
| Self-Stabilizing Repeated Balls-into-Bins | Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures | 2015 |
| The importance of being expert: Efficient max-finding in crowdsourcing | Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data | 2015 |
© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma