Luca Becchetti

From MaRDI portal
Person:235656

Available identifiers

zbMath Open becchetti.lucaWikidataQ111128087 ScholiaQ111128087MaRDI QIDQ235656

List of research outcomes





PublicationDate of PublicationType
The minority dynamics and the power of synchronicity2024-11-28Paper
Bond percolation in small-world graphs with power-law distribution2024-08-21Paper
Biased opinion dynamics: when the devil is in the details2024-02-05Paper
Expansion and flooding in dynamic random networks with node churn2023-10-12Paper
Percolation and epidemic processes in one-dimensional small-world networks (extended abstract)2023-07-26Paper
Step-By-Step Community Detection in Volume-Regular Graphs2023-02-03Paper
Bond Percolation in Small-World Graphs with Power-Law Distribution2022-05-18Paper
https://portal.mardi4nfdi.de/entity/Q50095642021-08-04Paper
Finding a Bounded-Degree Expander Inside a Dense One2021-02-02Paper
Step-by-step community detection in volume-regular graphs2020-11-06Paper
Find Your Place: Simple Distributed Algorithms for Community Detection2020-08-18Paper
Oblivious dimension reduction for k -means: beyond subspaces and the Johnson-Lindenstrauss lemma2020-01-30Paper
Tour recommendation for groups2019-05-03Paper
Self-stabilizing repeated balls-into-bins2019-03-21Paper
Stabilizing Consensus with Many Opinions2018-07-16Paper
Find Your Place: Simple Distributed Algorithms for Community Detection2018-07-16Paper
Plurality Consensus in the Gossip Model2017-10-05Paper
Simple dynamics for plurality consensus2017-09-04Paper
Inefficiency of games with social context2016-01-13Paper
Sharing the cost more efficiently2015-09-02Paper
Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines2015-02-27Paper
Latency-constrained aggregation in sensor networks2014-11-18Paper
Streaming techniques and data aggregation in networks of tiny artefacts2014-10-24Paper
Sharing the cost more efficiently, improved approximation for multicommodity rent-or-buy2014-10-13Paper
Inefficiency of Games with Social Context2013-10-23Paper
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds2013-08-07Paper
Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines2011-02-01Paper
https://portal.mardi4nfdi.de/entity/Q30593232010-12-08Paper
Algorithms - ESA 20032010-03-03Paper
Competitive Analysis of Aggregate Max in Windowed Streaming2009-07-14Paper
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm2008-05-27Paper
Latency Constrained Aggregation in Sensor Networks2008-03-11Paper
Approximating call-scheduling makespan in all-optical networks2007-04-26Paper
Online weighted flow time and deadline scheduling2006-10-31Paper
Algorithms – ESA 20042005-08-18Paper
Semi-clairvoyant scheduling2004-11-23Paper
Approximation algorithms for routing and call scheduling in all-optical chains and rings.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q47807812002-11-21Paper
https://portal.mardi4nfdi.de/entity/Q27666652002-08-11Paper
On the design of efficient ATM routing schemes2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q45016722000-09-04Paper

Research outcomes over time

This page was built for person: Luca Becchetti