| 2008 |
|---|
| 68 | EE | 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) |
| 67 | EE | 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) |
| 2007 |
|---|
| 66 | EE | 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 |
| 65 | EE | 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 |
| 64 | EE | Andrea E. F. Clementi,
Francesco Pasquale,
Angelo Monti,
Riccardo Silvestri:
Communication in dynamic radio networks.
PODC 2007: 205-214 |
| 63 | EE | 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 |
| 62 | | 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) |
| 2006 |
|---|
| 61 | EE | 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 |
| 60 | EE | 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 |
| 59 | EE | Harry Buhrman,
Alessandro Panconesi,
Riccardo Silvestri,
Paul M. B. Vitányi:
On the importance of having an identity or, is consensus really universal?.
Distributed Computing 18(3): 167-176 (2006) |
| 2005 |
|---|
| 58 | EE | 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 |
| 57 | EE | 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 |
| 56 | EE | 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) |
| 2004 |
|---|
| 55 | EE | 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 |
| 54 | EE | 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 |
| 53 | EE | Irene Finocchi,
Alessandro Panconesi,
Riccardo Silvestri:
An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms.
Algorithmica 41(1): 1-23 (2004) |
| 52 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Round Robin is optimal for fault-tolerant broadcasting on wireless networks.
J. Parallel Distrib. Comput. 64(1): 89-96 (2004) |
| 51 | EE | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
On the Power Assignment Problem in Radio Networks.
MONET 9(2): 125-140 (2004) |
| 2003 |
|---|
| 50 | | Rossella Petreschi,
Giuseppe Persiano,
Riccardo Silvestri:
Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings
Springer 2003 |
| 49 | | 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 |
| 48 | EE | 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 |
| 47 | EE | 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) |
| 46 | EE | Sergio De Agostino,
Riccardo Silvestri:
Bounded size dictionary compression: SCk-completeness and NC algorithms.
Inf. Comput. 180(2): 101-112 (2003) |
| 45 | EE | Andrea E. F. Clementi,
Miriam Di Ianni,
Riccardo Silvestri:
The minimum broadcast range assignment problem on linear multi-hop wireless networks.
Theor. Comput. Sci. 1-3(299): 751-761 (2003) |
| 44 | EE | 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) |
| 43 | EE | Patrizio Cintioli,
Riccardo Silvestri:
Polynomial Time Introreducibility.
Theory Comput. Syst. 36(1): 1-15 (2003) |
| 2002 |
|---|
| 42 | EE | 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 |
| 41 | EE | Irene Finocchi,
Alessandro Panconesi,
Riccardo Silvestri:
Experimental analysis of simple, distributed vertex coloring algorithms.
SODA 2002: 606-615 |
| 40 | | Pierluigi Crescenzi,
Sergio De Agostino,
Riccardo Silvestri:
A note on the spatiality degree of graphs.
Ars Comb. 63: (2002) |
| 39 | EE | 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 |
|---|
| 38 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks.
ESA 2001: 452-463 |
| 37 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Distributed multi-broadcast in unknown radio networks.
PODC 2001: 255-264 |
| 36 | EE | Andrea E. F. Clementi,
Pierluigi Crescenzi,
Angelo Monti,
Paolo Penna,
Riccardo Silvestri:
On Computing Ad-hoc Selective Families.
RANDOM-APPROX 2001: 211-222 |
| 35 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Selective families, superimposed codes, and broadcasting on unknown radio networks.
SODA 2001: 709-718 |
| 34 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Distributed Broadcast in Wireless Networks with Unknown Topology
CoRR cs.DS/0107011: (2001) |
| 33 | EE | Patrizio Cintioli,
Riccardo Silvestri:
The Helping Hierarchy.
ITA 35(4): 367-377 (2001) |
| 32 | | Pierluigi Crescenzi,
Riccardo Silvestri,
Luca Trevisan:
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems.
Inf. Comput. 167(1): 10-26 (2001) |
| 31 | EE | Bernd Borchert,
Riccardo Silvestri:
Dot operators.
Theor. Comput. Sci. 262(1): 501-523 (2001) |
| 2000 |
|---|
| 30 | EE | 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 |
| 29 | | 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 |
| 28 | EE | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
The Power Range Assignment Problem in Radio Networks on the Plane.
STACS 2000: 651-660 |
| 27 | EE | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
On the power assignment problem in radio networks
Electronic Colloquium on Computational Complexity (ECCC) 7(54): (2000) |
| 1999 |
|---|
| 26 | | 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 |
| 25 | | Pierluigi Crescenzi,
Viggo Kann,
Riccardo Silvestri,
Luca Trevisan:
Structure in Approximation Classes.
SIAM J. Comput. 28(5): 1759-1782 (1999) |
| 1998 |
|---|
| 24 | | Sergio De Agostino,
Riccardo Silvestri:
Bounded Size Dictionary Compression: SCk-Completeness and NC Algorithms.
STACS 1998: 522-532 |
| 23 | | Pierluigi Crescenzi,
Riccardo Silvestri:
Sperner's Lemma and Robust Machines.
Computational Complexity 7(2): 163-173 (1998) |
| 1997 |
|---|
| 22 | EE | Bernd Borchert,
Riccardo Silvestri:
The General Notion of a Dot-Operator.
IEEE Conference on Computational Complexity 1997: 36-44 |
| 21 | | Sergio De Agostino,
Riccardo Silvestri:
A Worst-Case Analysis of the LZ2 Compression Algorithm.
Inf. Comput. 139(2): 258-268 (1997) |
| 20 | EE | Patrizio Cintioli,
Riccardo Silvestri:
Revisiting a Result of Ko.
Inf. Process. Lett. 61(4): 189-194 (1997) |
| 19 | EE | Bernd Borchert,
Riccardo Silvestri:
A Characterization of the Leaf Language Classes.
Inf. Process. Lett. 63(3): 153-158 (1997) |
| 18 | EE | Marco Cadoli,
Francesco M. Donini,
Marco Schaerf,
Riccardo Silvestri:
On Compact Representations of Propositional Circumscription.
Theor. Comput. Sci. 182(1-2): 183-202 (1997) |
| 17 | | Patrizio Cintioli,
Riccardo Silvestri:
Helping by Unambiguous Computation and Probabilistic Computation.
Theory Comput. Syst. 30(2): 165-180 (1997) |
| 1996 |
|---|
| 16 | | Pierluigi Crescenzi,
Riccardo Silvestri,
Luca Trevisan:
To Weight or Not to Weight: Where is the Question?
ISTCS 1996: 68-77 |
| 15 | | Daniel P. Bovet,
Andrea E. F. Clementi,
Pierluigi Crescenzi,
Riccardo Silvestri:
Parallel approximation of optimization problems.
Solving Combinatorial Optimization Problems in Parallel 1996: 7-24 |
| 14 | EE | Pierluigi Crescenzi,
Viggo Kann,
Riccardo Silvestri,
Luca Trevisan:
Structure in Approximation Classes
Electronic Colloquium on Computational Complexity (ECCC) 3(66): (1996) |
| 1995 |
|---|
| 13 | | Pierluigi Crescenzi,
Viggo Kann,
Riccardo Silvestri,
Luca Trevisan:
Structure in Approximation Classes (Extended Abstract).
COCOON 1995: 539-548 |
| 12 | | Daniel P. Bovet,
Pierluigi Crescenzi,
Riccardo Silvestri:
Complexity Classes and Sparse Oracles.
J. Comput. Syst. Sci. 50(3): 382-390 (1995) |
| 11 | | Lane A. Hemaspaandra,
Riccardo Silvestri:
Easily Checked Generalized Self-Reducibility.
SIAM J. Comput. 24(4): 840-858 (1995) |
| 1993 |
|---|
| 10 | | Lane A. Hemachandra,
Riccardo Silvestri:
Easity Checked Self-Reducibility (Extended Abstract).
FCT 1993: 289-298 |
| 9 | | Pierluigi Crescenzi,
Riccardo Silvestri:
Sperner's Lemma and Robust Machines.
Structure in Complexity Theory Conference 1993: 194-199 |
| 8 | | Pierluigi Crescenzi,
Riccardo Silvestri:
A Note on the Descriptive Complexity of Maximization.
Inf. Process. Lett. 47(1): 11-15 (1993) |
| 7 | | Pierluigi Crescenzi,
Riccardo Silvestri:
Average Measure, Descriptive Complexity and Approximation of Maximization Problems.
Int. J. Found. Comput. Sci. 4(1): 15-30 (1993) |
| 1992 |
|---|
| 6 | | 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 |
| 5 | | 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 |
| 4 | | Daniel P. Bovet,
Pierluigi Crescenzi,
Riccardo Silvestri:
A Uniform Approach to Define Complexity Classes.
Theor. Comput. Sci. 104(2): 263-283 (1992) |
| 1991 |
|---|
| 3 | | Daniel P. Bovet,
Pierluigi Crescenzi,
Riccardo Silvestri:
Complexity Classes and Sparse Oracles.
Structure in Complexity Theory Conference 1991: 102-108 |
| 2 | | Pierluigi Crescenzi,
C. Fiorini,
Riccardo Silvestri:
A Note on the Approximation of the MAX CLIQUE Problem.
Inf. Process. Lett. 40(1): 1-5 (1991) |
| 1990 |
|---|
| 1 | | 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) |
