Gianluca Rossi

Orcid: 0000-0002-6440-8203

According to our database1, Gianluca Rossi authored at least 40 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
State-Space Model for Arrival Time Simulations and Methodology for Offline Blade Tip-Timing Software Characterization.
Sensors, March, 2023

Experimental Investigation on Hardware and Triggering Effect in Tip-Timing Measurement Uncertainty.
Sensors, February, 2023

SEUPD@CLEF: Team Squid on LongEval-Retrieval.
Proceedings of the Working Notes of the Conference and Labs of the Evaluation Forum (CLEF 2023), 2023

2021
R&D evaluation methodology based on group-AHP with uncertainty.
CoRR, 2021

2020
Investigating Additive Manufactured Lattice Structures: A Multi-Instrument Approach.
IEEE Trans. Instrum. Meas., 2020

Structural Characterization of Complex Lattice Parts by Means of Optical Non-Contact Measurements.
Proceedings of the 2020 IEEE International Instrumentation and Measurement Technology Conference, 2020

2019
Influential users in Twitter: detection and evolution analysis.
Multim. Tools Appl., 2019

Qualification of additive manufactured trabecular structures using a multi-instrumental approach.
Proceedings of the IEEE International Instrumentation and Measurement Technology Conference, 2019

2018
Twitter: temporal events analysis: Extended Abstract.
Proceedings of the 4th EAI International Conference on Smart Objects and Technologies for Social Good, 2018

2017
An Integrated Approach to Characterize the Behavior of a Human Fingertip in Contact with a Silica Window.
IEEE Trans. Haptics, 2017

The Analysis of Influential Users Evolution in Microblogging Social Networks - (Extended Abstract).
Proceedings of the Smart Objects and Technologies for Social Good, 2017

Estimation of distance-based metrics for very large graphs with MinHash Signatures.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

2016
Min-max communities in graphs: Complexity and computational properties.
Theor. Comput. Sci., 2016

On the Retweet Decay of the Evolutionary Retweet Graph.
Proceedings of the Smart Objects and Technologies for Social Good, 2016

2015
Synchronous context-free grammars and optimal linear parsing strategies.
J. Comput. Syst. Sci., 2015

Reducing the diameter of a unit disk graph via node addition.
Inf. Process. Lett., 2015


2014
Time-based Microblog Distillation.
Proceedings of the SNOW 2014 Data Challenge co-located with 23rd International World Wide Web Conference (WWW 2014), 2014

2011
Smooth movement and Manhattan path based Random Waypoint mobility.
Inf. Process. Lett., 2011

Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems.
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

2009
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications.
Proceedings of the Structural Information and Communication Complexity, 2009

2008
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks.
Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, 2008

Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms.
Proceedings of the 11th International Symposium on Modeling Analysis and Simulation of Wireless and Mobile Systems, 2008

2007
On the bounded-hop MST problem on random Euclidean instances.
Theor. Comput. Sci., 2007

Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks.
Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 5th International Conference, 2006

2005
On the approximability of the range assignment problem on radio networks in presence of selfish agents.
Theor. Comput. Sci., 2005

Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances.
Proceedings of the Structural Information and Communication Complexity, 2005

Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks.
Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), 2005

Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005

2004
Optimal covering designs: complexity results and new bounds.
Discret. Appl. Math., 2004

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks.
Proceedings of the STACS 2004, 2004

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
Text sparsification via local maxima.
Theor. Comput. Sci., 2003

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002
On the Hamming distance of constraint satisfaction problems.
Theor. Comput. Sci., 2002

2001
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs.
Proceedings of the STACS 2001, 2001

1999
On the Complexity of Approximating Colored-Graph Problems.
Proceedings of the Computing and Combinatorics, 5th Annual International Conference, 1999


  Loading...