default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRiccardo Silvestri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j46]Luca Becchetti
, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. Distributed Comput. 30(4): 293-306 (2017)- 2016
- [j45]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:
Normally-off GaN-HEMTs with p-type gate: Off-state degradation, forward gate stress and ESD failure. Microelectron. Reliab. 58: 177-184 (2016) - [j44]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri:
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48(2): 290-312 (2016) - 2015
- [j43]Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information spreading in dynamic graphs. Distributed Comput. 28(1): 55-73 (2015) - [j42]Andrea Clementi, Riccardo Silvestri:
Parsimonious flooding in geometric random-walks. J. Comput. Syst. Sci. 81(1): 219-233 (2015) - [j41]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed community detection in dynamic graphs. Theor. Comput. Sci. 584: 19-41 (2015) - [c47]Matteo Meneghini, Riccardo Silvestri, Stefano Dalcanale, Davide Bisi, Enrico Zanoni, Gaudenzio Meneghesso, Piet Vanmeerbeek, Abhishek Banerjee, Peter Moens:
Evidence for temperature-dependent buffer-induced trapping in GaN-on-silicon power transistors. IRPS 2015: 2 - [c46]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri:
Plurality Consensus in the Gossip Model. SODA 2015: 371-390 - 2014
- [j40]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri:
Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times. IEEE Trans. Parallel Distributed Syst. 25(9): 2297-2306 (2014) - [c45]Farid Medjdoub, Etienne Okada, Bertrand Grimbert, Damien Ducatteau, Riccardo Silvestri, Matteo Meneghini, Enrico Zanoni, Gaudenzio Meneghesso:
High performance high reliability AlN/GaN DHFET. ESSDERC 2014: 146-149 - [c44]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. SPAA 2014: 247-256 - [i16]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri:
Plurality Consensus in the Gossip Model. CoRR abs/1407.2565 (2014) - 2013
- [j39]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Fast flooding over Manhattan. Distributed Comput. 26(1): 25-38 (2013) - [j38]Isabella Rossetto, Fabiana Rampazzo, Riccardo Silvestri, Alberto Zanandrea, Christian Dua, Sylvain L. Delage, Mourad Oualli, Matteo Meneghini, Enrico Zanoni, Gaudenzio Meneghesso:
Comparison of the performances of an InAlN/GaN HEMT with a Mo/Au gate or a Ni/Pt/Au gate. Microelectron. Reliab. 53(9-11): 1476-1480 (2013) - [j37]Andrea Clementi, Francesco Pasquale, Riccardo Silvestri:
Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power. IEEE/ACM Trans. Netw. 21(2): 610-620 (2013) - [c43]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. ESA 2013: 325-336 - [c42]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed Community Detection in Dynamic Graphs - (Extended Abstract). SIROCCO 2013: 1-12 - [p1]Riccardo Silvestri:
Randomness and Complexity. The Power of Algorithms 2013: 235-250 - [i15]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. CoRR abs/1302.3828 (2013) - [i14]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed Community Detection in Dynamic Graphs. CoRR abs/1302.5607 (2013) - [i13]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple Dynamics for Majority Consensus. CoRR abs/1310.2858 (2013) - 2012
- [j36]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Optimal gossiping in geometric radio networks in the presence of dynamical faults. Networks 59(3): 289-298 (2012) - [c41]Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information spreading in dynamic graphs. PODC 2012: 37-46 - 2011
- [j35]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Modelling mobility: A discrete revolution. Ad Hoc Networks 9(6): 998-1014 (2011) - [j34]Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri:
Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks. IEEE Trans. Parallel Distributed Syst. 22(2): 208-216 (2011) - [j33]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distributed Syst. 22(9): 1425-1432 (2011) - [c40]Andrea E. F. Clementi, Riccardo Silvestri:
Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). DISC 2011: 298-310 - [i12]Andrea Clementi, Riccardo Silvestri:
Parsimonious Flooding in Geometric Random-Walks. CoRR abs/1101.5308 (2011) - [i11]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information Spreading in Stationary Markovian Evolving Graphs. CoRR abs/1103.0741 (2011) - [i10]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri:
Information Spreading in Opportunistic Networks is Fast. CoRR abs/1107.5241 (2011) - [i9]Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information Spreading in Dynamic Graphs. CoRR abs/1111.0583 (2011) - 2010
- [j32]Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discret. Math. 24(4): 1694-1712 (2010) - [c39]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Modelling Mobility: A Discrete Revolution. ICALP (2) 2010: 490-501 - [c38]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Fast flooding over Manhattan. PODC 2010: 375-383 - [i8]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Modelling Mobility: A Discrete Revolution. CoRR abs/1002.1016 (2010) - [i7]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Fast Flooding over Manhattan. CoRR abs/1002.3757 (2010)
2000 – 2009
- 2009
- [j31]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4): 213-230 (2009) - [c37]Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri:
MANETS: High Mobility Can Make Up for Low Transmission Power. ICALP (2) 2009: 387-398 - [c36]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information spreading in stationary Markovian evolving graphs. IPDPS 2009: 1-12 - [c35]Paolo Penna, Florian Schoppmann, Riccardo Silvestri, Peter Widmayer:
Pseudonyms in Cost-Sharing Games. WINE 2009: 256-267 - [i6]Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri:
MANETS: High mobility can make up for low transmission power. CoRR abs/0903.0520 (2009) - 2008
- [j30]Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri:
Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. 399(1-2): 38-53 (2008) - [c34]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. MSWiM 2008: 354-361 - [c33]Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Flooding time in edge-Markovian dynamic graphs. PODC 2008: 213-222 - [i5]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
- [j29]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) - [c32]Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. MFCS 2007: 430-441 - [c31]Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri:
Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. OPODIS 2007: 247-259 - [c30]Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri:
Communication in dynamic radio networks. PODC 2007: 205-214 - [c29]Angelo Monti, Paolo Penna, Riccardo Silvestri:
An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. WG 2007: 154-165 - 2006
- [j28]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi:
On the importance of having an identity or, is consensus really universal?. Distributed Comput. 18(3): 167-176 (2006) - [c28]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 - [c27]Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri:
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO 2006: 227-239 - 2005
- [j27]Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri:
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. Algorithmica 41(1): 1-23 (2005) - [j26]Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri:
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) - [c26]Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri:
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS 2005 - [c25]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
- [j25]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distributed Comput. 64(1): 89-96 (2004) - [j24]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
On the Power Assignment Problem in Radio Networks. Mob. Networks Appl. 9(2): 125-140 (2004) - [c24]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 - [c23]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
- [j23]Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica 35(2): 95-110 (2003) - [j22]Sergio De Agostino, Riccardo Silvestri:
Bounded size dictionary compression: SCk-completeness and NC algorithms. Inf. Comput. 180(2): 101-112 (2003) - [j21]Patrizio Cintioli, Riccardo Silvestri:
Polynomial Time Introreducibility. Theory Comput. Syst. 36(1): 1-15 (2003) - [j20]Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri:
The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 299(1-3): 751-761 (2003) - [j19]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302(1-3): 337-364 (2003) - [c22]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 - [c21]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 - [e1]Rossella Petreschi, Giuseppe Persiano, Riccardo Silvestri:
Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings. Lecture Notes in Computer Science 2653, Springer 2003, ISBN 3-540-40176-8 [contents] - 2002
- [j18]Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri:
A note on the spatiality degree of graphs. Ars Comb. 63 (2002) - [c20]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. ISAAC 2002: 320-331 - [c19]Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri:
Experimental analysis of simple, distributed vertex coloring algorithms. SODA 2002: 606-615 - [i4]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi:
On the Importance of Having an Identity or, is Consensus really Universal? CoRR cs.DC/0201006 (2002) - 2001
- [j17]Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan:
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. Inf. Comput. 167(1): 10-26 (2001) - [j16]Patrizio Cintioli, Riccardo Silvestri:
The Helping Hierarchy. RAIRO Theor. Informatics Appl. 35(4): 367-377 (2001) - [j15]Bernd Borchert, Riccardo Silvestri:
Dot operators. Theor. Comput. Sci. 262(1): 501-523 (2001) - [c18]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. ESA 2001: 452-463 - [c17]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed multi-broadcast in unknown radio networks. PODC 2001: 255-264 - [c16]Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri:
On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222 - [c15]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Selective families, superimposed codes, and broadcasting on unknown radio networks. SODA 2001: 709-718 - [i3]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Distributed Broadcast in Wireless Networks with Unknown Topology. CoRR cs.DS/0107011 (2001) - 2000
- [c14]Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri:
The Minimum Range Assignment Problem on Linear Radio Networks. ESA 2000: 143-154 - [c13]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
The Power Range Assignment Problem in Radio Networks on the Plane. STACS 2000: 651-660 - [c12]Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi:
On the Importance of Having an Identity or is Consensus Really Universal? DISC 2000: 134-148 - [i2]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
On the power assignment problem in radio networks. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j14]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. SIAM J. Comput. 28(5): 1759-1782 (1999) - [c11]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. RANDOM-APPROX 1999: 197-208 - 1998
- [j13]Pierluigi Crescenzi, Riccardo Silvestri:
Sperner's Lemma and Robust Machines. Comput. Complex. 7(2): 163-173 (1998) - [c10]Sergio De Agostino, Riccardo Silvestri:
Bounded Size Dictionary Compression: SCk-Completeness and NC Algorithms. STACS 1998: 522-532 - 1997
- [j12]Sergio De Agostino, Riccardo Silvestri:
A Worst-Case Analysis of the LZ2 Compression Algorithm. Inf. Comput. 139(2): 258-268 (1997) - [j11]Patrizio Cintioli, Riccardo Silvestri:
Revisiting a Result of Ko. Inf. Process. Lett. 61(4): 189-194 (1997) - [j10]Bernd Borchert, Riccardo Silvestri:
A Characterization of the Leaf Language Classes. Inf. Process. Lett. 63(3): 153-158 (1997) - [j9]Patrizio Cintioli, Riccardo Silvestri:
Helping by Unambiguous Computation and Probabilistic Computation. Theory Comput. Syst. 30(2): 165-180 (1997) - [j8]Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri:
On Compact Representations of Propositional Circumscription. Theor. Comput. Sci. 182(1-2): 183-202 (1997) - [c9]Bernd Borchert, Riccardo Silvestri:
The General Notion of a Dot-Operator. CCC 1997: 36-44 - 1996
- [c8]Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan:
To Weight or Not to Weight: Where is the Question? ISTCS 1996: 68-77 - [c7]Daniel P. Bovet, Andrea Clementi, Pierluigi Crescenzi, Riccardo Silvestri:
Parallel approximation of optimization problems. Solving Combinatorial Optimization Problems in Parallel 1996: 7-24 - [i1]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j7]Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri:
Complexity Classes and Sparse Oracles. J. Comput. Syst. Sci. 50(3): 382-390 (1995) - [j6]Lane A. Hemaspaandra, Riccardo Silvestri:
Easily Checked Generalized Self-Reducibility. SIAM J. Comput. 24(4): 840-858 (1995) - [c6]Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan:
Structure in Approximation Classes (Extended Abstract). COCOON 1995: 539-548 - 1993
- [j5]Pierluigi Crescenzi, Riccardo Silvestri:
Average Measure, Descriptive Complexity and Approximation of Maximization Problems. Int. J. Found. Comput. Sci. 4(1): 15-30 (1993) - [j4]Pierluigi Crescenzi, Riccardo Silvestri:
A Note on the Descriptive Complexity of Maximization. Inf. Process. Lett. 47(1): 11-15 (1993) - [c5]Pierluigi Crescenzi, Riccardo Silvestri:
Sperner's Lemma and Robust Machines. SCT 1993: 194-199 - [c4]Lane A. Hemachandra, Riccardo Silvestri:
Easity Checked Self-Reducibility (Extended Abstract). FCT 1993: 289-298 - 1992
- [j3]Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri:
A Uniform Approach to Define Complexity Classes. Theor. Comput. Sci. 104(2): 263-283 (1992) - [c3]Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf:
Reductions to Sets of Low Information Content. Complexity Theory: Current Research 1992: 1-46 - [c2]Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf:
Reductions to Sets of Low Information Content. ICALP 1992: 162-173 - 1991
- [j2]Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri:
A Note on the Approximation of the MAX CLIQUE Problem. Inf. Process. Lett. 40(1): 1-5 (1991) - [c1]Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri:
Complexity Classes and Sparse Oracles. SCT 1991: 102-108 - 1990
- [j1]Pierluigi Crescenzi, Riccardo Silvestri:
Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. Inf. Process. Lett. 33(5): 221-226 (1990)
Coauthor Index
Andrea Clementi
aka: Andrea E. F. Clementi
aka: Andrea E. F. Clementi
[j46] [j44] [j43] [j42] [j41] [c46] [j40] [c44] [i16] [j39] [j37] [c43] [c42] [i15] [i14] [i13] [j36] [c41] [j35] [j34] [j33] [c40] [i12] [i11] [i10] [i9] [j32] [c39] [c38] [i8] [i7] [j31] [c37] [c36] [i6] [j30] [c34] [c33] [i5] [j29] [c32] [c31] [c30] [c28] [c27] [j26] [c26] [c25] [j25] [j24] [c24] [c23] [j23] [j20] [j19] [c22] [c21] [c20] [c18] [c17] [c16] [c15] [i3] [c14] [c13] [i2] [c11] [c7]