Luca Becchetti

Orcid: 0000-0002-4941-0532

Affiliations:
  • Sapienza University of Rome, Italy


According to our database1, Luca Becchetti authored at least 80 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The Minority Dynamics and the Power of Synchronicity.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Expansion and flooding in dynamic random networks with node churn.
Random Struct. Algorithms, August, 2023

Bond Percolation in Small-World Graphs with Power-Law Distribution.
Proceedings of the 2nd Symposium on Algorithmic Foundations of Dynamic Networks, 2023

On the Role of Memory in Robust Opinion Dynamics.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

On a Voter Model with Context-Dependent Opinion Adoption.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Biased opinion dynamics: when the devil is in the details.
Inf. Sci., 2022

On the Multidimensional Random Subset Sum Problem.
CoRR, 2022

Biological Random Walks: multi-omics integration for disease gene prioritization.
Bioinform., 2022

Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract).
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
Network and Sequence-Based Prediction of Protein-Protein Interactions.
CoRR, 2021

Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks.
CoRR, 2021

2020
Step-by-step community detection in volume-regular graphs.
Theor. Comput. Sci., 2020

Consensus Dynamics: An Overview.
SIGACT News, 2020

Find Your Place: Simple Distributed Algorithms for Community Detection.
SIAM J. Comput., 2020

Finding a Bounded-Degree Expander Inside a Dense One.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Spectral Relaxations and Fair Densest Subgraphs.
Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

2019
Self-stabilizing repeated balls-into-bins.
Distributed Comput., 2019

Principal Fairness: \\ Removing Bias via Projections.
CoRR, 2019

Oblivious dimension reduction for <i>k</i>-means: beyond subspaces and the Johnson-Lindenstrauss lemma.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Biological Random Walks: Integrating heterogeneous data in disease gene prioritization.
Proceedings of the IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology, 2019

2018
Average Whenever You Meet: Opportunistic Protocols for Community Detection.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018

2017
Performance improvements for search systems using an integrated cache of lists + intersections.
Inf. Retr. J., 2017

Simple dynamics for plurality consensus.
Distributed Comput., 2017

Tour recommendation for groups.
Data Min. Knowl. Discov., 2017

Friend or Foe? Population Protocols can perform Community Detection.
CoRR, 2017

2016
Flow Time Minimization.
Encyclopedia of Algorithms, 2016

Stabilizing Consensus with Many Opinions.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015
Stochastic Query Covering for Fast Approximate Document Retrieval.
ACM Trans. Inf. Syst., 2015

Inefficiency of Games with Social Context.
Theory Comput. Syst., 2015

Probabilistic Self-Stabilization.
CoRR, 2015

Plurality Consensus in the Gossip Model.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

The Importance of Being Expert: Efficient Max-Finding in Crowdsourcing.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

P. polycephalum Can Compute Shortest Paths.
Proceedings of the BICT 2015, 2015

2014
Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times.
IEEE Trans. Parallel Distributed Syst., 2014

A lightweight privacy preserving SMS-based recommendation system for mobile users.
Knowl. Inf. Syst., 2014

2013
Simple Dynamics for Majority Consensus.
CoRR, 2013

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Privacy support in people-centric sensing.
J. Commun., 2012

Online team formation in social networks.
Proceedings of the 21st World Wide Web Conference 2012, 2012

Population protocols on real social networks.
Proceedings of the 9th ACM Symposium on Performance evaluation of wireless ad hoc, 2012

First Experiences with the Implementation and Evaluation of Population Protocols on Physical Devices.
Proceedings of the 2012 IEEE International Conference on Green Computing and Communications, 2012

2011
Recommending items in pervasive scenarios: models and experimental analysis.
Knowl. Inf. Syst., 2011

Streaming techniques and data aggregation in networks of tiny artefacts.
Comput. Sci. Rev., 2011

Information Spreading in Opportunistic Networks is Fast
CoRR, 2011

Stochastic query covering.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Privacy-Preserving Environment Monitoring in Networks of Mobile Devices.
Proceedings of the NETWORKING 2011 Workshops - International IFIP TC 6 Workshops, PE-CRN, 2011

2010
Efficient algorithms for large-scale local triangle counting.
ACM Trans. Knowl. Discov. Data, 2010

Fully decentralized computation of aggregates over data streams.
SIGKDD Explor., 2010

An optimization framework for query recommendation.
Proceedings of the Third International Conference on Web Search and Web Data Mining, 2010

A lightweight privacy preserving SMS-based recommendation system for mobile users.
Proceedings of the 2010 ACM Conference on Recommender Systems, 2010

Power in unity: forming teams in large-scale community systems.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Latency-constrained aggregation in sensor networks.
ACM Trans. Algorithms, 2009

Competitive Analysis of Aggregate Max in Windowed Streaming.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008
Flow Time Minimization.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Link analysis for Web spam detection.
ACM Trans. Web, 2008

Self-Adaptive Recommendation Systems: Models and Experimental Analysis.
Proceedings of the Second IEEE International Conference on Self-Adaptive and Self-Organizing Systems, 2008

Efficient semi-streaming algorithms for local triangle counting in massive graphs.
Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2008

2007
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy.
ACM Trans. Algorithms, 2007

2006
A reference collection for web spam.
SIGIR Forum, 2006

Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm.
Math. Oper. Res., 2006

Online weighted flow time and deadline scheduling.
J. Discrete Algorithms, 2006

The distribution of pageRank follows a power-law only for particular values of the damping factor.
Proceedings of the 15th international conference on World Wide Web, 2006

Link-Based Characterization and Detection of Web Spam.
Proceedings of the AIRWeb 2006, 2006

2005
Parallel scheduling problems in next generation wireless networks.
Networks, 2005

Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

2004
Semi-clairvoyant scheduling.
Theor. Comput. Sci., 2004

Approximating call-scheduling makespan in all-optical networks.
J. Discrete Algorithms, 2004

Average stretch without migration.
J. Comput. Syst. Sci., 2004

Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines.
J. ACM, 2004

Modeling Locality: A Probabilistic Analysis of LRU and FWF.
Proceedings of the Algorithms, 2004

2003
Scheduling to Minimize Flow Time Metrics.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002
Approximation algorithms for routing and call scheduling in all-optical chains and rings.
Theor. Comput. Sci., 2002

On the design of efficient ATM routing schemes.
Theor. Comput. Sci., 2002

2001
Enhancing IP service provision over heterogeneous wireless networks: a path toward 4G.
IEEE Commun. Mag., 2001

Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A Java Implementation of a Reliable Multicast File Transfer Protocol: Design and Evaluation.
Proceedings of the Fifth IASTED International Conference Internet and Multimedia Systems and Applications (IMSA 2001), 2001

2000
Scheduling to minimize average stretch without migration.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1997
Lower Bounds for the Virtual Path Layout Problem in ATM Networks.
Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

On the Embedding of Refinements of 2-dimensional Grids.
Proceedings of the Euro-Par '97 Parallel Processing, 1997


  Loading...