Riccardo Silvestri

111 papers A* 9A 13B 11C 1Misc 1Journal 62Unranked 13

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	Simple dynamics for plurality consensus. Distributed Comput. Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
2016	J	`jnl`	Normally-off GaN-HEMTs with p-type gate: Off-state degradation, forward gate stress and ESD failure. Microelectron. Reliab. 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, Enrico Zanoni, Gaudenzio Meneghesso, Stefano Dalcanale
2016	J	`jnl`	Rumor spreading in random evolving graphs. Random Struct. Algorithms Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri
2015	J	`jnl`	Distributed community detection in dynamic graphs. Theor. Comput. Sci. Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
2015	—	`conf`	Evidence for temperature-dependent buffer-induced trapping in GaN-on-silicon power transistors. IRPS Matteo Meneghini, Riccardo Silvestri, Stefano Dalcanale, Davide Bisi, Enrico Zanoni, Gaudenzio Meneghesso, Piet Vanmeerbeek, Abhishek Banerjee, Peter Moens
2015	J	`jnl`	Information spreading in dynamic graphs. Distributed Comput. Andrea Clementi, Riccardo Silvestri, Luca Trevisan
2015	J	`jnl`	Parsimonious flooding in geometric random-walks. J. Comput. Syst. Sci. Andrea Clementi, Riccardo Silvestri
2015	A*	`conf`	Plurality Consensus in the Gossip Model. SODA Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri
2014	J	`jnl`	Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times. IEEE Trans. Parallel Distributed Syst. Luca Becchetti, Andrea Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri
2014	—	`conf`	High performance high reliability AlN/GaN DHFET. ESSDERC Farid Medjdoub, Etienne Okada, Bertrand Grimbert, Damien Ducatteau, Riccardo Silvestri, Matteo Meneghini, Enrico Zanoni, Gaudenzio Meneghesso
2014	J	`jnl`	Plurality Consensus in the Gossip Model. CoRR Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri
2014	B	`conf`	Simple dynamics for plurality consensus. SPAA Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
2013	J	`jnl`	Comparison of the performances of an InAlN/GaN HEMT with a Mo/Au gate or a Ni/Pt/Au gate. Microelectron. Reliab. Isabella Rossetto, Fabiana Rampazzo, Riccardo Silvestri, Alberto Zanandrea, Christian Dua, Sylvain L. Delage, Mourad Oualli, Matteo Meneghini, Enrico Zanoni, Gaudenzio Meneghesso
2013	J	`jnl`	Distributed Community Detection in Dynamic Graphs CoRR Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
2013	B	`conf`	Distributed Community Detection in Dynamic Graphs - (Extended Abstract). SIROCCO Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri
2013	J	`jnl`	Fast flooding over Manhattan. Distributed Comput. Andrea Clementi, Angelo Monti, Riccardo Silvestri
2013	J	`jnl`	Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power. IEEE/ACM Trans. Netw. Andrea Clementi, Francesco Pasquale, Riccardo Silvestri
2013	—	`ch.`	Randomness and Complexity. The Power of Algorithms Riccardo Silvestri
2013	J	`jnl`	Rumor Spreading in Random Evolving Graphs CoRR Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
2013	A	`conf`	Rumor Spreading in Random Evolving Graphs. ESA Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri
2013	J	`jnl`	Simple Dynamics for Majority Consensus. CoRR Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan
2012	A*	`conf`	Information spreading in dynamic graphs. PODC Andrea Clementi, Riccardo Silvestri, Luca Trevisan
2012	J	`jnl`	Optimal gossiping in geometric radio networks in the presence of dynamical faults. Networks Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2011	J	`jnl`	Information Spreading in Dynamic Graphs CoRR Andrea Clementi, Riccardo Silvestri, Luca Trevisan
2011	J	`jnl`	Information Spreading in Opportunistic Networks is Fast CoRR Luca Becchetti, Andrea Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri
2011	J	`jnl`	Information Spreading in Stationary Markovian Evolving Graphs CoRR Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2011	J	`jnl`	Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distributed Syst. Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2011	J	`jnl`	Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks. IEEE Trans. Parallel Distributed Syst. Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri
2011	J	`jnl`	Modelling mobility: A discrete revolution. Ad Hoc Networks Andrea Clementi, Angelo Monti, Riccardo Silvestri
2011	J	`jnl`	Parsimonious Flooding in Geometric Random-Walks CoRR Andrea Clementi, Riccardo Silvestri
2011	A	`conf`	Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). DISC Andrea E. F. Clementi, Riccardo Silvestri
2010	J	`jnl`	Fast Flooding over Manhattan CoRR Andrea Clementi, Angelo Monti, Riccardo Silvestri
2010	A*	`conf`	Fast flooding over Manhattan. PODC Andrea Clementi, Angelo Monti, Riccardo Silvestri
2010	J	`jnl`	Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discret. Math. Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2010	—	`conf`	Modelling Mobility: A ICALP (2) Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2010	J	`jnl`	Modelling Mobility: A Discrete Revolution CoRR Andrea Clementi, Angelo Monti, Riccardo Silvestri
2009	J	`jnl`	Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2009	A	`conf`	Information spreading in stationary Markovian evolving graphs. IPDPS Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2009	—	`conf`	MANETS: High Mobility Can Make Up for Low Transmission Power. ICALP (2) Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri
2009	J	`jnl`	MANETS: High mobility can make up for low transmission power CoRR Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri
2009	—	`conf`	Pseudonyms in Cost-Sharing Games. WINE Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer
2008	A*	`conf`	Flooding time in edge-Markovian dynamic graphs. PODC Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2008	J	`jnl`	Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
2008	J	`jnl`	Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms CoRR Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2008	A	`conf`	Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. MSWiM Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2007	B	`conf`	An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG Angelo Monti, Paolo Penna, Riccardo Silvestri
2007	A*	`conf`	Communication in dynamic radio networks. PODC Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri
2007	B	`conf`	Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. OPODIS Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri
2007	J	`jnl`	On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2007	B	`conf`	Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. MFCS Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2006	—	`conf`	A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. ADHOC-NOW Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2006	B	`conf`	Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
2006	J	`jnl`	On the importance of having an identity or, is consensus really universal?. Distributed Comput. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
2005	J	`jnl`	An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. Algorithmica Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
2005	B	`conf`	Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. SIROCCO Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri
2005	A	`conf`	Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2005	J	`jnl`	On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2004	A	`conf`	Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
2004	J	`jnl`	On the Power Assignment Problem in Radio Networks. Mob. Networks Appl. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
2004	J	`jnl`	Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distributed Comput. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2004	A	`conf`	The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri
2003	C	`ed.`	Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings CIAC Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri
2003	J	`jnl`	Bounded size dictionary compression: SC Inf. Comput. Sergio De Agostino, Riccardo Silvestri
2003	J	`jnl`	Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2003	B	`conf`	Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2003	B	`conf`	Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2003	J	`jnl`	Polynomial Time Introreducibility. Theory Comput. Syst. Patrizio Cintioli, Riccardo Silvestri
2003	J	`jnl`	The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri
2003	J	`jnl`	The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri
2002	J	`jnl`	A note on the spatiality degree of graphs. Ars Comb. Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri
2002	A*	`conf`	Experimental analysis of simple, distributed vertex coloring algorithms. SODA Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
2002	J	`jnl`	On the Importance of Having an Identity or, is Consensus really Universal? CoRR Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
2002	B	`conf`	Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. ISAAC Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	J	`jnl`	Distributed Broadcast in Wireless Networks with Unknown Topology CoRR Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	A*	`conf`	Distributed multi-broadcast in unknown radio networks. PODC Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	J	`jnl`	Dot operators. Theor. Comput. Sci. Bernd Borchert, Riccardo Silvestri
2001	—	`conf`	On Computing Ad-hoc Selective Families. RANDOM-APPROX Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
2001	J	`jnl`	On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. Inf. Comput. Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
2001	A	`conf`	Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. ESA Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	A*	`conf`	Selective families, superimposed codes, and broadcasting on unknown radio networks. SODA Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	J	`jnl`	The Helping Hierarchy. RAIRO Theor. Informatics Appl. Patrizio Cintioli, Riccardo Silvestri
2000	A	`conf`	On the Importance of Having an Identity or is Consensus Really Universal? DISC Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
2000	J	`jnl`	On the power assignment problem in radio networks Electron. Colloquium Comput. Complex. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
2000	A	`conf`	The Minimum Range Assignment Problem on Linear Radio Networks. ESA Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri
2000	A	`conf`	The Power Range Assignment Problem in Radio Networks on the Plane. STACS Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
1999	—	`conf`	Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. RANDOM-APPROX Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
1999	J	`jnl`	Structure in Approximation Classes. SIAM J. Comput. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
1998	A	`conf`	Bounded Size Dictionary Compression: SC STACS Sergio De Agostino, Riccardo Silvestri
1998	J	`jnl`	Sperner's Lemma and Robust Machines. Comput. Complex. Pierluigi Crescenzi, Riccardo Silvestri
1997	J	`jnl`	A Characterization of the Leaf Language Classes. Inf. Process. Lett. Bernd Borchert, Riccardo Silvestri
1997	J	`jnl`	A Worst-Case Analysis of the LZ2 Compression Algorithm. Inf. Comput. Sergio De Agostino, Riccardo Silvestri
1997	J	`jnl`	Helping by Unambiguous Computation and Probabilistic Computation. Theory Comput. Syst. Patrizio Cintioli, Riccardo Silvestri
1997	J	`jnl`	On Compact Representations of Propositional Circumscription. Theor. Comput. Sci. Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri
1997	J	`jnl`	Revisiting a Result of Ko. Inf. Process. Lett. Patrizio Cintioli, Riccardo Silvestri
1997	A	`conf`	The General Notion of a Dot-Operator. CCC Bernd Borchert, Riccardo Silvestri
1996	—	`conf`	Parallel approximation of optimization problems. Solving Combinatorial Optimization Problems in Parallel Daniel P. Bovet, Andrea Clementi, Pierluigi Crescenzi, Riccardo Silvestri
1996	J	`jnl`	Structure in Approximation Classes Electron. Colloquium Comput. Complex. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
1996	—	`conf`	To Weight or Not to Weight: Where is the Question? ISTCS Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
1995	J	`jnl`	Complexity Classes and Sparse Oracles. J. Comput. Syst. Sci. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
1995	J	`jnl`	Easily Checked Generalized Self-Reducibility. SIAM J. Comput. Lane A. Hemaspaandra, Riccardo Silvestri
1995	Misc	`conf`	Structure in Approximation Classes (Extended Abstract). COCOON Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
1993	J	`jnl`	A Note on the Descriptive Complexity of Maximization. Inf. Process. Lett. Pierluigi Crescenzi, Riccardo Silvestri
1993	J	`jnl`	Average Measure, Descriptive Complexity and Approximation of Maximization Problems. Int. J. Found. Comput. Sci. Pierluigi Crescenzi, Riccardo Silvestri
1993	B	`conf`	Easity Checked Self-Reducibility (Extended Abstract). FCT Lane A. Hemachandra, Riccardo Silvestri
1993	—	`conf`	Sperner's Lemma and Robust Machines. SCT Pierluigi Crescenzi, Riccardo Silvestri
1992	J	`jnl`	A Uniform Approach to Define Complexity Classes. Theor. Comput. Sci. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
1992	—	`conf`	Reductions to Sets of Low Information Content. Complexity Theory: Current Research Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1992	A*	`conf`	Reductions to Sets of Low Information Content. ICALP Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1991	J	`jnl`	A Note on the Approximation of the MAX CLIQUE Problem. Inf. Process. Lett. Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri
1991	—	`conf`	Complexity Classes and Sparse Oracles. SCT Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
1990	J	`jnl`	Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. Inf. Process. Lett. Pierluigi Crescenzi, Riccardo Silvestri