The following pages link to Luca Becchetti (Q235656):
Displaying 40 items.
- Streaming techniques and data aggregation in networks of tiny artefacts (Q465668) (← links)
- Online weighted flow time and deadline scheduling (Q849627) (← links)
- Approximating call-scheduling makespan in all-optical networks (Q876731) (← links)
- Inefficiency of games with social context (Q904696) (← links)
- (Q1733390) (redirect page) (← links)
- Self-stabilizing repeated balls-into-bins (Q1733393) (← links)
- Tour recommendation for groups (Q1741326) (← links)
- Approximation algorithms for routing and call scheduling in all-optical chains and rings. (Q1853488) (← links)
- Semi-clairvoyant scheduling (Q1887092) (← links)
- Step-by-step community detection in volume-regular graphs (Q2210514) (← links)
- Simple dynamics for plurality consensus (Q2401681) (← links)
- (Q2766665) (← links)
- Inefficiency of Games with Social Context (Q2856146) (← links)
- Sharing the cost more efficiently, improved approximation for multicommodity rent-or-buy (Q2921692) (← links)
- Latency-constrained aggregation in sensor networks (Q2930288) (← links)
- Sharing the cost more efficiently (Q2944561) (← links)
- (Q3059323) (← links)
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines (Q3069900) (← links)
- Competitive Analysis of Aggregate Max in Windowed Streaming (Q3638032) (← links)
- (Q4501672) (← links)
- Stabilizing Consensus with Many Opinions (Q4575624) (← links)
- Find Your Place: Simple Distributed Algorithms for Community Detection (Q4575798) (← links)
- (Q4780781) (← links)
- Average whenever you meet: opportunistic protocols for community detection (Q5009564) (← links)
- Find Your Place: Simple Distributed Algorithms for Community Detection (Q5115703) (← links)
- Finding a Bounded-Degree Expander Inside a Dense One (Q5146853) (← links)
- Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines (Q5175957) (← links)
- Oblivious dimension reduction for <i>k</i> -means: beyond subspaces and the Johnson-Lindenstrauss lemma (Q5212844) (← links)
- Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (Q5327457) (← links)
- Plurality Consensus in the Gossip Model (Q5362981) (← links)
- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm (Q5387966) (← links)
- Latency Constrained Aggregation in Sensor Networks (Q5449519) (← links)
- Algorithms – ESA 2004 (Q5464570) (← links)
- Step-By-Step Community Detection in Volume-Regular Graphs (Q5875581) (← links)
- Algorithms - ESA 2003 (Q5897235) (← links)
- On the design of efficient ATM routing schemes (Q5958312) (← links)
- Expansion and flooding in dynamic random networks with node churn (Q6051059) (← links)
- Biased opinion dynamics: when the devil is in the details (Q6149529) (← links)
- Bond percolation in small-world graphs with power-law distribution (Q6590083) (← links)
- The minority dynamics and the power of synchronicity (Q6645513) (← links)
