The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Riccardo Silvestri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2006, pp:60-72 [Conf]
  2. Bernd Borchert, Riccardo Silvestri
    The General Notion of a Dot-Operator. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:36-44 [Conf]
  3. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
    Complexity Classes and Sparse Oracles. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:102-108 [Conf]
  4. Pierluigi Crescenzi, Riccardo Silvestri
    Sperner's Lemma and Robust Machines. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:194-199 [Conf]
  5. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
    Structure in Approximation Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:539-548 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:1-46 [Conf]
  7. Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri
    The Minimum Range Assignment Problem on Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:143-154 [Conf]
  8. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:452-463 [Conf]
  9. Lane A. Hemachandra, Riccardo Silvestri
    Easity Checked Self-Reducibility (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:289-298 [Conf]
  10. 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. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:162-173 [Conf]
  11. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  13. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:320-331 [Conf]
  14. Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
    To Weight or Not to Weight: Where is the Question? [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:68-77 [Conf]
  15. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Distributed multi-broadcast in unknown radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:255-264 [Conf]
  16. Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
    On Computing Ad-hoc Selective Families. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:211-222 [Conf]
  17. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
    Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:197-208 [Conf]
  18. Daniel P. Bovet, Andrea E. F. Clementi, Pierluigi Crescenzi, Riccardo Silvestri
    Parallel approximation of optimization problems. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:7-24 [Conf]
  19. Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
    Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:1-16 [Conf]
  20. 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. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:227-239 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2005, pp:89-98 [Conf]
  22. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Selective families, superimposed codes, and broadcasting on unknown radio networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:709-718 [Conf]
  23. Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
    Experimental analysis of simple, distributed vertex coloring algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:606-615 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:418-427 [Conf]
  25. Sergio De Agostino, Riccardo Silvestri
    Bounded Size Dictionary Compression: SCk-Completeness and NC Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:522-532 [Conf]
  26. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
    The Power Range Assignment Problem in Radio Networks on the Plane. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:651-660 [Conf]
  27. Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
    Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:248-251 [Conf]
  28. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the Importance of Having an Identity or is Consensus Really Universal? [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:134-148 [Conf]
  29. Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri
    The Minimum Range Assignment Problem on Linear Radio Networks. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:2, pp:95-110 [Journal]
  30. Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri
    An Experimental Analysis of Simple, Distributed Vertex Coloring Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:1, pp:1-23 [Journal]
  31. Pierluigi Crescenzi, Sergio De Agostino, Riccardo Silvestri
    A note on the spatiality degree of graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2002, v:63, n:, pp:- [Journal]
  32. Pierluigi Crescenzi, Riccardo Silvestri
    Sperner's Lemma and Robust Machines. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:163-173 [Journal]
  33. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the Importance of Having an Identity or, is Consensus really Universal? [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  34. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Distributed Broadcast in Wireless Networks with Unknown Topology [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  35. Harry Buhrman, Alessandro Panconesi, Riccardo Silvestri, Paul M. B. Vitányi
    On the importance of having an identity or, is consensus really universal?. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:167-176 [Journal]
  36. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
    On the power assignment problem in radio networks [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:54, pp:- [Journal]
  37. Sergio De Agostino, Riccardo Silvestri
    Bounded size dictionary compression: SCk-completeness and NC algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:180, n:2, pp:101-112 [Journal]
  38. Sergio De Agostino, Riccardo Silvestri
    A Worst-Case Analysis of the LZ2 Compression Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:2, pp:258-268 [Journal]
  39. Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan
    On Weighted vs Unweighted Versions of Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:167, n:1, pp:10-26 [Journal]
  40. Pierluigi Crescenzi, Riccardo Silvestri
    Average Measure, Descriptive Complexity and Approximation of Maximization Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:1, pp:15-30 [Journal]
  41. Bernd Borchert, Riccardo Silvestri
    A Characterization of the Leaf Language Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:3, pp:153-158 [Journal]
  42. Patrizio Cintioli, Riccardo Silvestri
    Revisiting a Result of Ko. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:4, pp:189-194 [Journal]
  43. Pierluigi Crescenzi, C. Fiorini, Riccardo Silvestri
    A Note on the Approximation of the MAX CLIQUE Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:1, pp:1-5 [Journal]
  44. Pierluigi Crescenzi, Riccardo Silvestri
    Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:5, pp:221-226 [Journal]
  45. Pierluigi Crescenzi, Riccardo Silvestri
    A Note on the Descriptive Complexity of Maximization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:1, pp:11-15 [Journal]
  46. Patrizio Cintioli, Riccardo Silvestri
    The Helping Hierarchy. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:4, pp:367-377 [Journal]
  47. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
    Complexity Classes and Sparse Oracles. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:382-390 [Journal]
  48. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Round Robin is optimal for fault-tolerant broadcasting on wireless networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:1, pp:89-96 [Journal]
  49. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
    On the Power Assignment Problem in Radio Networks. [Citation Graph (0, 0)][DBLP]
    MONET, 2004, v:9, n:2, pp:125-140 [Journal]
  50. Patrizio Cintioli, Riccardo Silvestri
    Polynomial Time Introreducibility. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:1, pp:1-15 [Journal]
  51. Patrizio Cintioli, Riccardo Silvestri
    Helping by Unambiguous Computation and Probabilistic Computation. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:2, pp:165-180 [Journal]
  52. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
    Structure in Approximation Classes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:5, pp:1759-1782 [Journal]
  53. Lane A. Hemaspaandra, Riccardo Silvestri
    Easily Checked Generalized Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:4, pp:840-858 [Journal]
  54. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:343, n:1-2, pp:27-41 [Journal]
  55. Bernd Borchert, Riccardo Silvestri
    Dot operators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:501-523 [Journal]
  56. Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri
    A Uniform Approach to Define Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:104, n:2, pp:263-283 [Journal]
  57. Marco Cadoli, Francesco M. Donini, Marco Schaerf, Riccardo Silvestri
    On Compact Representations of Propositional Circumscription. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:182, n:1-2, pp:183-202 [Journal]
  58. Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri
    The minimum broadcast range assignment problem on linear multi-hop wireless networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:751-761 [Journal]
  59. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Distributed broadcast in radio networks of unknown topology. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:337-364 [Journal]
  60. Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
    Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:430-441 [Conf]
  61. Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri
    Communication in dynamic radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:205-214 [Conf]
  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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:384, n:2-3, pp:161-167 [Journal]

  63. MANETS: High Mobility Can Make Up for Low Transmission Power. [Citation Graph (, )][DBLP]


  64. Modelling Mobility: A Discrete Revolution. [Citation Graph (, )][DBLP]


  65. Information spreading in stationary Markovian evolving graphs. [Citation Graph (, )][DBLP]


  66. Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. [Citation Graph (, )][DBLP]


  67. Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. [Citation Graph (, )][DBLP]


  68. Flooding time in edge-Markovian dynamic graphs. [Citation Graph (, )][DBLP]


  69. Fast flooding over Manhattan. [Citation Graph (, )][DBLP]


  70. An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem. [Citation Graph (, )][DBLP]


  71. Pseudonyms in Cost-Sharing Games. [Citation Graph (, )][DBLP]


  72. Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms [Citation Graph (, )][DBLP]


  73. MANETS: High mobility can make up for low transmission power [Citation Graph (, )][DBLP]


  74. Modelling Mobility: A Discrete Revolution [Citation Graph (, )][DBLP]


  75. Fast Flooding over Manhattan [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002