ROSSI, GIANLUCA
ROSSI, GIANLUCA
Dipartimento di Ingegneria dell'Impresa "Mario Lucertini"
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks
2006-01-01 Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Rossi, G; Silvestri, R
Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances
2005-01-01 Clementi, A; DI IANNI, M; Monti, A; Lauria, M; Rossi, G; Silvestri, R
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks
2004-01-01 Ambhl, C; Clementi, A; DI IANNI, M; Lev Tov, N; Monti, A; Peleg, D; Rossi, G; Silvestri, R
Equilibria for broadcast range assignment games in ad-hoc networks
2005-01-01 Crescenzi, P; DI IANNI, M; Lazzoni, A; Penna, P; Rossi, G; Vocca, P
Estimation of distance-based metrics for very large graphs with MinHash Signatures
2017-01-01 Amati, G; Angelini, S; Gambosi, G; Rossi, G; Vocca, P
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks
2005-01-01 Clementi, A; DI IANNI, M; Monti, A; Rossi, G; Silvestri, R
Influential users in Twitter: detection and evolution analysis
2019-02-12 Amati, G; Angelini, S; Gambosi, G; Rossi, G; Vocca, P
Introduzione alla programmazione con Python: dal pensiero computazionale al machine learning
2021-09-01 Rossi, G
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
2008-01-01 Crescenzi, P; DI IANNI, M; Greco, F; Rossi, G; Vocca, P
Min-max communities in graphs: Complexity and computational properties
2016-01-01 DI IANNI, M; Gambosi, G; Rossi, G; Vocca, P
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms
2008-01-01 Calamoneri, T; Clementi, A; Monti, A; Rossi, G; Silvestri, R
Modelling the temporal evolution of the retweet graph.
2016-01-01 Amati, G; Angelini, S; Capri, F; Gambosi, G; Rossi, G; Vocca, P
MOMOSE: A Mobility Model Simulation Environment for Mobile Wireless Ad-hoc Networks
2008-01-01 Boschi, S; Crescenzi, P; DI IANNI, M; Rossi, G; Vocca, P
Moving beyond the twitter follow graph
2015-01-01 Amati, G; Angelini, S; Bianchi, M; Fusco, G; Gambosi, G; Gaudino, G; Marcone, G; Rossi, G; Vocca, P
On the approximability of the range assignment problem on radio networks in presence of selfish agents
2005-10-10 Ambuhel, C; Clementi, A; Penna, P; Rossi, G; Silvestri, R
On the bounded-hop MST problem on random Euclidean instances
2007-01-01 Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Rossi, G; Silvestri, R
On the retweet decay of the evolutionary retweet graph
2017-01-01 Amati, G; Angelini, S; Capri, F; Gambosi, G; Rossi, G; Vocca, P
Optimal covering designs: complexity results and new bounds
2004-01-01 Crescenzi, P; Montecalvo, F; Rossi, G
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems
2011-01-01 Crescenzi, P; Gildea, D; Marino, A; Rossi, G; Satta, G
Programmazione in Python: esercizi
2022-10-01 Rossi, G
Data di pubblicazione | Titolo | Autore(i) | Tipo | File |
---|---|---|---|---|
1-gen-2006 | A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks | Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Rossi, G; Silvestri, R | Intervento a convegno | |
1-gen-2005 | Divide and conquer is almost optimal for the bounded-hop MST problem on random Euclidean instances | Clementi, A; DI IANNI, M; Monti, A; Lauria, M; Rossi, G; Silvestri, R | Intervento a convegno | |
1-gen-2004 | Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks | Ambhl, C; Clementi, A; DI IANNI, M; Lev Tov, N; Monti, A; Peleg, D; Rossi, G; Silvestri, R | Intervento a convegno | |
1-gen-2005 | Equilibria for broadcast range assignment games in ad-hoc networks | Crescenzi, P; DI IANNI, M; Lazzoni, A; Penna, P; Rossi, G; Vocca, P | Intervento a convegno | |
1-gen-2017 | Estimation of distance-based metrics for very large graphs with MinHash Signatures | Amati, G; Angelini, S; Gambosi, G; Rossi, G; Vocca, P | Intervento a convegno | |
1-gen-2005 | Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks | Clementi, A; DI IANNI, M; Monti, A; Rossi, G; Silvestri, R | Intervento a convegno | |
12-feb-2019 | Influential users in Twitter: detection and evolution analysis | Amati, G; Angelini, S; Gambosi, G; Rossi, G; Vocca, P | Articolo su rivista | |
1-set-2021 | Introduzione alla programmazione con Python: dal pensiero computazionale al machine learning | Rossi, G | Curatele | |
1-gen-2008 | Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings | Crescenzi, P; DI IANNI, M; Greco, F; Rossi, G; Vocca, P | Intervento a convegno | |
1-gen-2016 | Min-max communities in graphs: Complexity and computational properties | DI IANNI, M; Gambosi, G; Rossi, G; Vocca, P | Articolo su rivista | |
1-gen-2008 | Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms | Calamoneri, T; Clementi, A; Monti, A; Rossi, G; Silvestri, R | Intervento a convegno | |
1-gen-2016 | Modelling the temporal evolution of the retweet graph. | Amati, G; Angelini, S; Capri, F; Gambosi, G; Rossi, G; Vocca, P | Articolo su rivista | |
1-gen-2008 | MOMOSE: A Mobility Model Simulation Environment for Mobile Wireless Ad-hoc Networks | Boschi, S; Crescenzi, P; DI IANNI, M; Rossi, G; Vocca, P | Intervento a convegno | |
1-gen-2015 | Moving beyond the twitter follow graph | Amati, G; Angelini, S; Bianchi, M; Fusco, G; Gambosi, G; Gaudino, G; Marcone, G; Rossi, G; Vocca, P | Intervento a convegno | |
10-ott-2005 | On the approximability of the range assignment problem on radio networks in presence of selfish agents | Ambuhel, C; Clementi, A; Penna, P; Rossi, G; Silvestri, R | Articolo su rivista | |
1-gen-2007 | On the bounded-hop MST problem on random Euclidean instances | Clementi, A; DI IANNI, M; Lauria, M; Monti, A; Rossi, G; Silvestri, R | Articolo su rivista | |
1-gen-2017 | On the retweet decay of the evolutionary retweet graph | Amati, G; Angelini, S; Capri, F; Gambosi, G; Rossi, G; Vocca, P | Intervento a convegno | |
1-gen-2004 | Optimal covering designs: complexity results and new bounds | Crescenzi, P; Montecalvo, F; Rossi, G | Articolo su rivista | |
1-gen-2011 | Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems | Crescenzi, P; Gildea, D; Marino, A; Rossi, G; Satta, G | Intervento a convegno | |
1-ott-2022 | Programmazione in Python: esercizi | Rossi, G | Monografia |