default search action
Gianluca Rossi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Lorenzo Capponi
, Tommaso Tocci
Experimental Investigation on Hardware and Triggering Effect in Tip-Timing Measurement Uncertainty. Sensors 23(3): 1129 (2023) - [j13]Tommaso Tocci
State-Space Model for Arrival Time Simulations and Methodology for Offline Blade Tip-Timing Software Characterization. Sensors 23(5): 2600 (2023) - [c27]Vittorio Cardillo, Alberto Dorizza, Mattia Maglie, Dario Mameli, Gianluca Rossi, Michele Russo, Nicola Ferro:
SEUPD@CLEF: Team Squid on LongEval-Retrieval. CLEF (Working Notes) 2023: 2306-2337 - 2021
- [i3]Alberto Garinei, Emanuele Piccioni, Massimiliano Proietti, Andrea Marini, Stefano Speziali, Marcello Marconi, Raffaella Di Sante, Sara Casaccia, Paolo Castellini, Milena Martarelli, Nicola Paone, Gian Marco Revel, Lorenzo Scalise, Marco Arnesano, Paolo Chiariotti, Roberto Montanini, Antonino Quattrocchi, Sergio Silvestri, Giorgio Ficco, Emanuele Rizzuto, Andrea Scorza, Matteo Lancini, Gianluca Rossi, Roberto Marsili, Emanuele Zappa, Salvatore Andrea Sciuto:
R&D evaluation methodology based on group-AHP with uncertainty. CoRR abs/2108.02595 (2021) - 2020
- [j12]Gloria Allevi, Lorenzo Capponi, Paolo Castellini, Paolo Chiariotti, Franco Docchio, Fabrizio Freni, Roberto Marsili, Milena Martarelli, Roberto Montanini, Simone Pasinetti, Antonino Quattrocchi
Investigating Additive Manufactured Lattice Structures: A Multi-Instrument Approach. IEEE Trans. Instrum. Meas. 69(5): 2459-2467 (2020) - [c26]Roberto Montanini, Gianluca Rossi, Antonino Quattrocchi
Structural Characterization of Complex Lattice Parts by Means of Optical Non-Contact Measurements. I2MTC 2020: 1-6
2010 – 2019
- 2019
- [j11]Giambattista Amati
Influential users in Twitter: detection and evolution analysis. Multim. Tools Appl. 78(3): 3395-3407 (2019) - [c25]Gloria Allevi, Paolo Castellini, Paolo Chiariotti, Franco Docchio, Roberto Marsili, Roberto Montanini, Simone Pasinetti, Antonino Quattrocchi, Roberto Rossetti, Gianluca Rossi, Giovanna Sansoni, Enrico Primo Tomasini:
Qualification of additive manufactured trabecular structures using a multi-instrumental approach. I2MTC 2019: 1-6 - 2018
- [c24]Giambattista Amati
Twitter: temporal events analysis: Extended Abstract. GOODTECHS 2018: 298-303 - 2017
- [j10]Maria Laura D'Angelo, Ferdinando Cannella
An Integrated Approach to Characterize the Behavior of a Human Fingertip in Contact with a Silica Window. IEEE Trans. Haptics 10(1): 123-129 (2017) - [c23]Giambattista Amati
Estimation of distance-based metrics for very large graphs with MinHash Signatures. IEEE BigData 2017: 536-545 - [c22]Giambattista Amati
The Analysis of Influential Users Evolution in Microblogging Social Networks - (Extended Abstract). GOODTECHS 2017: 258-268 - 2016
- [j9]Miriam Di Ianni, Giorgio Gambosi, Gianluca Rossi
Min-max communities in graphs: Complexity and computational properties. Theor. Comput. Sci. 613: 94-114 (2016) - [c21]Giambattista Amati, Simone Angelini, Francesca Capri, Giorgio Gambosi, Gianluca Rossi
On the Retweet Decay of the Evolutionary Retweet Graph. GOODTECHS 2016: 243-253 - 2015
- [j8]Miriam Di Ianni, Luciano Gualà
Reducing the diameter of a unit disk graph via node addition. Inf. Process. Lett. 115(11): 845-850 (2015) - [j7]Pierluigi Crescenzi
Synchronous context-free grammars and optimal linear parsing strategies. J. Comput. Syst. Sci. 81(7): 1333-1356 (2015) - [c20]Giambattista Amati
Moving Beyond the Twitter Follow Graph. KDIR 2015: 612-619 - 2014
- [c19]Giambattista Amati, Simone Angelini, Marco Bianchi, Giorgio Gambosi, Gianluca Rossi:
Time-based Microblog Distillation. SNOW-DC@WWW 2014: 64-69 - 2013
- [i2]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Synchronous Context-Free Grammars and Optimal Linear Parsing Strategies. CoRR abs/1311.6421 (2013) - 2011
- [j6]Pilu Crescenzi
Smooth movement and Manhattan path based Random Waypoint mobility. Inf. Process. Lett. 111(5): 239-246 (2011) - [c18]Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta:
Optimal Head-Driven Parsing Complexity for Linear Context-Free Rewriting Systems. ACL 2011: 450-459
2000 – 2009
- 2009
- [c17]Pilu Crescenzi
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. SIROCCO 2009: 154-166 - 2008
- [c16]Tiziana Calamoneri
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. MSWiM 2008: 354-361 - [c15]Stefano Boschi, Miriam Di Ianni, Pilu Crescenzi
MOMOSE: a mobility model simulation environment for mobile wireless ad-hoc networks. SimuTools 2008: 38 - [c14]Pilu Crescenzi
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. WG 2008: 90-100 - [i1]Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. CoRR abs/0804.3902 (2008) - 2007
- [j5]Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. 384(2-3): 161-167 (2007) - [c13]Miriam Di Ianni, Gianluca Rossi
Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks. AINA Workshops (2) 2007: 121-126 - 2006
- [c12]Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. ADHOC-NOW 2006: 60-72 - 2005
- [j4]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi
On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. 343(1-2): 27-41 (2005) - [c11]Pilu Crescenzi
Equilibria for Broadcast Range Assignment Games in Ad-Hoc Networks. ADHOC-NOW 2005: 4-17 - [c10]Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS 2005 - [c9]Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri:
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. SIROCCO 2005: 89-98 - 2004
- [j3]Pilu Crescenzi
Optimal covering designs: complexity results and new bounds. Discret. Appl. Math. 144(3): 281-290 (2004) - [c8]Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri:
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS 2004 - [c7]Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri:
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS 2004: 418-427 - 2003
- [j2]Pierluigi Crescenzi
Text sparsification via local maxima. Theor. Comput. Sci. 304(1-3): 341-364 (2003) - [c6]Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi
On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. IPDPS 2003: 222 - [c5]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO 2003: 1-16 - [c4]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA 2003: 248-251 - 2002
- [j1]Pierluigi Crescenzi
On the Hamming distance of constraint satisfaction problems. Theor. Comput. Sci. 288(1): 85-100 (2002) - 2001
- [c3]Andrea E. F. Clementi, Pierluigi Crescenzi
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS 2001: 121-131 - 2000
- [c2]Pierluigi Crescenzi
Text Sparsification via Local Maxima. FSTTCS 2000: 290-301
1990 – 1999
- 1999
- [c1]Andrea E. F. Clementi, Pierluigi Crescenzi
On the Complexity of Approximating Colored-Graph Problems. COCOON 1999: 281-290
Coauthor Index
aka: Andrea E. F. Clementi
aka: Pilu Crescenzi
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: