Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. - Pierluigi Crescenzi; Riccardo Silvestri (Inf. Process. Lett., 1990)

A Note on the Approximation of the MAX CLIQUE Problem. - Pierluigi Crescenzi; C. Fiorini; Riccardo Silvestri (Inf. Process. Lett., 1991)

Reductions to Sets of Low Information Content. - Vikraman Arvind; Yenjo Han; Lane A. Hemachandra; Johannes Köbler; Antoni Lozano; Martin Mundhenk; Mitsunori Ogiwara; Uwe Schöning; Riccardo Silvestri; Thomas Thierauf (ICALP, 1992)

A Uniform Approach to Define Complexity Classes. - Daniel P. Bovet; Pierluigi Crescenzi; Riccardo Silvestri (Theor. Comput. Sci., 1992)

Easity Checked Self-Reducibility (Extended Abstract). - Lane A. Hemachandra; Riccardo Silvestri (FCT, 1993)

Average Measure, Descriptive Complexity and Approximation of Maximization Problems. - Pierluigi Crescenzi; Riccardo Silvestri (Int. J. Found. Comput. Sci., 1993)

A Note on the Descriptive Complexity of Maximization. - Pierluigi Crescenzi; Riccardo Silvestri (Inf. Process. Lett., 1993)

Structure in Approximation Classes (Extended Abstract). - Pierluigi Crescenzi; Viggo Kann; Riccardo Silvestri; Luca Trevisan 001 (COCOON, 1995)

Complexity Classes and Sparse Oracles. - Daniel P. Bovet; Pierluigi Crescenzi; Riccardo Silvestri (J. Comput. Syst. Sci., 1995)

Easily Checked Generalized Self-Reducibility. - Lane A. Hemaspaandra; Riccardo Silvestri (SIAM J. Comput., 1995)

To Weight or Not to Weight: Where is the Question? - Pierluigi Crescenzi; Riccardo Silvestri; Luca Trevisan 001 (ISTCS, 1996)

Parallel approximation of optimization problems. - Daniel P. Bovet; Andrea Clementi; Pierluigi Crescenzi; Riccardo Silvestri (Solving Combinatorial Optimization Problems in Parallel, 1996)

The General Notion of a Dot-Operator. - Bernd Borchert; Riccardo Silvestri (CCC, 1997)

A Worst-Case Analysis of the LZ2 Compression Algorithm. - Sergio De Agostino; Riccardo Silvestri (Inf. Comput., 1997)

A Characterization of the Leaf Language Classes. - Bernd Borchert; Riccardo Silvestri (Inf. Process. Lett., 1997)

Revisiting a Result of Ko. - Patrizio Cintioli; Riccardo Silvestri (Inf. Process. Lett., 1997)

Helping by Unambiguous Computation and Probabilistic Computation. - Patrizio Cintioli; Riccardo Silvestri (Theory Comput. Syst., 1997)

On Compact Representations of Propositional Circumscription. - Marco Cadoli; Francesco M. Donini; Marco Schaerf; Riccardo Silvestri (Theor. Comput. Sci., 1997)

Sperner's Lemma and Robust Machines. - Pierluigi Crescenzi; Riccardo Silvestri (Comput. Complex., 1998)

Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (RANDOM-APPROX, 1999)

Structure in Approximation Classes. - Pierluigi Crescenzi; Viggo Kann; Riccardo Silvestri; Luca Trevisan 001 (SIAM J. Comput., 1999)

The Power Range Assignment Problem in Radio Networks on the Plane. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (STACS, 2000)

Distributed multi-broadcast in unknown radio networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (PODC, 2001)

On Computing Ad-hoc Selective Families. - Andrea E. F. Clementi; Pierluigi Crescenzi; Angelo Monti; Paolo Penna; Riccardo Silvestri (RANDOM-APPROX, 2001)

Selective families, superimposed codes, and broadcasting on unknown radio networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (SODA, 2001)

Distributed Broadcast in Wireless Networks with Unknown Topology - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (CoRR, 2001)

On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. - Pierluigi Crescenzi; Riccardo Silvestri; Luca Trevisan 001 (Inf. Comput., 2001)

The Helping Hierarchy. - Patrizio Cintioli; Riccardo Silvestri (RAIRO Theor. Informatics Appl., 2001)

Dot operators. - Bernd Borchert; Riccardo Silvestri (Theor. Comput. Sci., 2001)

Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (ISAAC, 2002)

Experimental analysis of simple, distributed vertex coloring algorithms. - Irene Finocchi; Alessandro Panconesi; Riccardo Silvestri (SODA, 2002)

A note on the spatiality degree of graphs. - Pierluigi Crescenzi; Sergio De Agostino; Riccardo Silvestri (Ars Comb., 2002)

Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. - Christoph Ambühl; Andrea E. F. Clementi; Paolo Penna; Gianluca Rossi; Riccardo Silvestri (WAOA, 2003)

The Minimum Range Assignment Problem on Linear Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Afonso Ferreira; Stephane Perennes; Riccardo Silvestri (Algorithmica, 2003)

Bounded size dictionary compression: SCk-completeness and NC algorithms. - Sergio De Agostino; Riccardo Silvestri (Inf. Comput., 2003)

Polynomial Time Introreducibility. - Patrizio Cintioli; Riccardo Silvestri (Theory Comput. Syst., 2003)

The minimum broadcast range assignment problem on linear multi-hop wireless networks. - Andrea E. F. Clementi; Miriam Di Ianni; Riccardo Silvestri (Theor. Comput. Sci., 2003)

Distributed broadcast in radio networks of unknown topology. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (Theor. Comput. Sci., 2003)

The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Gianluca Rossi; Angelo Monti; Riccardo Silvestri (IPDPS, 2004)

Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. - Christoph Ambühl; Andrea E. F. Clementi; Miriam Di Ianni; Nissan Lev-Tov; Angelo Monti; David Peleg; Gianluca Rossi; Riccardo Silvestri (STACS, 2004)

Round Robin is optimal for fault-tolerant broadcasting on wireless networks. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (J. Parallel Distributed Comput., 2004)

On the Power Assignment Problem in Radio Networks. - Andrea E. F. Clementi; Paolo Penna; Riccardo Silvestri (Mob. Networks Appl., 2004)

Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. - Andrea E. F. Clementi; Miriam Di Ianni; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (IPDPS, 2005)

Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. - Andrea E. F. Clementi; Miriam Di Ianni; Angelo Monti; Massimo Lauria; Gianluca Rossi; Riccardo Silvestri (SIROCCO, 2005)

An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. - Irene Finocchi; Alessandro Panconesi; Riccardo Silvestri (Algorithmica, 2005)

On the approximability of the range assignment problem on radio networks in presence of selfish agents. - Christoph Ambühl; Andrea E. F. Clementi; Paolo Penna; Gianluca Rossi; Riccardo Silvestri (Theor. Comput. Sci., 2005)

A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. - Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (ADHOC-NOW, 2006)

On the importance of having an identity or, is consensus really universal?. - Harry Buhrman; Alessandro Panconesi; Riccardo Silvestri; Paul M. B. Vitányi (Distributed Comput., 2006)

Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. - Andrea E. F. Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (MFCS, 2007)

Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. - Tiziana Calamoneri; Andrea E. F. Clementi; Emanuele G. Fusco; Riccardo Silvestri (OPODIS, 2007)

Communication in dynamic radio networks. - Andrea E. F. Clementi; Francesco Pasquale; Angelo Monti; Riccardo Silvestri (PODC, 2007)

An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. - Angelo Monti; Paolo Penna; Riccardo Silvestri (WG, 2007)

On the bounded-hop MST problem on random Euclidean instances. - Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (Theor. Comput. Sci., 2007)

Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. - Tiziana Calamoneri; Andrea E. F. Clementi; Angelo Monti; Gianluca Rossi; Riccardo Silvestri (MSWiM, 2008)

Flooding time in edge-Markovian dynamic graphs. - Andrea E. F. Clementi; Claudio Macci; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (PODC, 2008)

Minimum-Energy Broadcast and disk cover in grid wireless networks. - Tiziana Calamoneri; Andrea E. F. Clementi; Miriam Di Ianni; Massimo Lauria; Angelo Monti; Riccardo Silvestri (Theor. Comput. Sci., 2008)

MANETS: High Mobility Can Make Up for Low Transmission Power. - Andrea E. F. Clementi; Francesco Pasquale; Riccardo Silvestri (ICALP (2), 2009)

Pseudonyms in Cost-Sharing Games. - Paolo Penna; Florian Schoppmann; Riccardo Silvestri; Peter Widmayer (WINE, 2009)

Broadcasting in dynamic radio networks. - Andrea E. F. Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (J. Comput. Syst. Sci., 2009)

Modelling Mobility: A Discrete Revolution. - Andrea E. F. Clementi; Angelo Monti; Riccardo Silvestri (ICALP (2), 2010)

Flooding Time of Edge-Markovian Evolving Graphs. - Andrea E. F. Clementi; Claudio Macci; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (SIAM J. Discret. Math., 2010)

Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). - Andrea E. F. Clementi; Riccardo Silvestri (DISC, 2011)

Modelling mobility: A discrete revolution. - Andrea Clementi; Angelo Monti; Riccardo Silvestri (Ad Hoc Networks, 2011)

Information Spreading in Opportunistic Networks is Fast - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Giovanni Resta; Paolo Santi; Riccardo Silvestri (CoRR, 2011)

Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks. - Tiziana Calamoneri; Andrea E. F. Clementi; Emanuele G. Fusco; Riccardo Silvestri (IEEE Trans. Parallel Distributed Syst., 2011)

Information Spreading in Stationary Markovian Evolving Graphs. - Andrea Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (IEEE Trans. Parallel Distributed Syst., 2011)

Optimal gossiping in geometric radio networks in the presence of dynamical faults. - Andrea Clementi; Angelo Monti; Francesco Pasquale; Riccardo Silvestri (Networks, 2012)

Randomness and Complexity. - Riccardo Silvestri (The Power of Algorithms, 2013)

Rumor Spreading in Random Evolving Graphs. - Andrea Clementi; Pierluigi Crescenzi; Carola Doerr; Pierre Fraigniaud; Marco Isopi; Alessandro Panconesi; Francesco Pasquale; Riccardo Silvestri (ESA, 2013)

Distributed Community Detection in Dynamic Graphs - (Extended Abstract). - Andrea Clementi; Miriam Di Ianni; Giorgio Gambosi; Emanuele Natale; Riccardo Silvestri (SIROCCO, 2013)

Simple Dynamics for Majority Consensus. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri; Luca Trevisan 001 (CoRR, 2013)

Fast flooding over Manhattan. - Andrea Clementi; Angelo Monti; Riccardo Silvestri (Distributed Comput., 2013)

Comparison of the performances of an InAlN/GaN HEMT with a Mo/Au gate or a Ni/Pt/Au gate. - Isabella Rossetto; Fabiana Rampazzo; Riccardo Silvestri; Alberto Zanandrea; Christian Dua; Sylvain L. Delage; Mourad Oualli; Matteo Meneghini; Enrico Zanoni; Gaudenzio Meneghesso (Microelectron. Reliab., 2013)

Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power. - Andrea Clementi; Francesco Pasquale; Riccardo Silvestri (IEEE/ACM Trans. Netw., 2013)

High performance high reliability AlN/GaN DHFET. - Farid Medjdoub; Etienne Okada; Bertrand Grimbert; Damien Ducatteau; Riccardo Silvestri; Matteo Meneghini; Enrico Zanoni; Gaudenzio Meneghesso (ESSDERC, 2014)

Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times. - Luca Becchetti; Andrea Clementi; Francesco Pasquale; Giovanni Resta; Paolo Santi; Riccardo Silvestri (IEEE Trans. Parallel Distributed Syst., 2014)

Evidence for temperature-dependent buffer-induced trapping in GaN-on-silicon power transistors. - Matteo Meneghini; Riccardo Silvestri; Stefano Dalcanale; Davide Bisi; Enrico Zanoni; Gaudenzio Meneghesso; Piet Vanmeerbeek; Abhishek Banerjee 003; Peter Moens (IRPS, 2015)

Plurality Consensus in the Gossip Model. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri (SODA, 2015)

Information spreading in dynamic graphs. - Andrea Clementi; Riccardo Silvestri; Luca Trevisan 001 (Distributed Comput., 2015)

Parsimonious flooding in geometric random-walks. - Andrea Clementi; Riccardo Silvestri (J. Comput. Syst. Sci., 2015)

Distributed community detection in dynamic graphs. - Andrea Clementi; Miriam Di Ianni; Giorgio Gambosi; Emanuele Natale; Riccardo Silvestri (Theor. Comput. Sci., 2015)

Normally-off GaN-HEMTs with p-type gate: Off-state degradation, forward gate stress and ESD failure. - Matteo Meneghini; Oliver Hilt; Clément Fleury; Riccardo Silvestri; Mattia Capriotti; Gottfried Strasser; Dionyz Pogany; Eldad Bahat-Treidel; Frank Brunner; A. Knauer; Joachim Würfl; Isabella Rossetto; et al. (Microelectron. Reliab., 2016)

Rumor spreading in random evolving graphs. - Andrea Clementi; Pierluigi Crescenzi; Carola Doerr; Pierre Fraigniaud; Francesco Pasquale; Riccardo Silvestri (Random Struct. Algorithms, 2016)

Simple dynamics for plurality consensus. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Riccardo Silvestri; Luca Trevisan 001 (Distributed Comput., 2017)