The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrea E. F. Clementi: [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. Andrea E. F. Clementi, Russell Impagliazzo
    Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:73-90 [Conf]
  3. Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi
    On the Complexity of Approximating Colored-Graph Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:281-290 [Conf]
  4. Andrea E. F. Clementi, Luca Trevisan
    Improved Non-approximability Results for Vertex Cover with Density Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:333-342 [Conf]
  5. 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]
  6. 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]
  7. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Weak Random Sources, Hitting Sets, and BPP Simulations. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:264-272 [Conf]
  8. Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
    Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:179-189 [Conf]
  9. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Hitting Sets Derandomize BPP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:357-368 [Conf]
  10. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:177-187 [Conf]
  11. Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna
    A Note on Parallel Read Operations on Large Public Databases. [Citation Graph (0, 0)][DBLP]
    ICALP Satellite Workshops, 2000, pp:123-134 [Conf]
  12. Andrea E. F. Clementi, Miriam Di Ianni
    Optimum Schedule Problems in Store and Forward Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 1994, pp:1336-1343 [Conf]
  13. 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]
  14. Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi, Yann C. Verhoeven, Paolo Penna
    On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:222- [Conf]
  15. 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]
  16. Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
    The Parallel Complexity of Approximating the High Degree Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:132-141 [Conf]
  17. 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]
  18. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    On the Parallel Computation of Boolean Functions on Unrelated inputs. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:155-161 [Conf]
  19. 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]
  20. 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]
  21. 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]
  22. 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]
  23. Andrea E. F. Clementi, José D. P. Rolim, Erik Urland
    Randomized parallel algorithms. [Citation Graph (0, 0)][DBLP]
    Solving Combinatorial Optimization Problems in Parallel, 1996, pp:25-50 [Conf]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. 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]
  29. Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
    Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:68-77 [Conf]
  30. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:319-330 [Conf]
  31. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Efficient Construction of Hitting Sets for Systems of Linear Functions. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:387-398 [Conf]
  32. Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca
    On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:121-131 [Conf]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Recent Advances Towards Proving P = BPP. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:64, n:, pp:- [Journal]
  38. Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
    Parallel Read Operations Without Memory Contention [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:53, pp:- [Journal]
  39. 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]
  40. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Optimal Bounds for the Approximation of Boolean Functions and Some Applications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:41, pp:- [Journal]
  41. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Hitting Sets Derandomize BPP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:61, pp:- [Journal]
  42. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Towards efficient constructions of hitting sets that derandomize BPP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:29, pp:- [Journal]
  43. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Weak Random Sources, Hitting Sets, and BPP Simulations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:11, pp:- [Journal]
  44. Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
    Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:53, pp:- [Journal]
  45. Andrea E. F. Clementi, Miriam Di Ianni
    Optimum Schedule Problems in Store and Forward Networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1995, v:6, n:2, pp:155-168 [Journal]
  46. Andrea E. F. Clementi, Russell Impagliazzo
    The Reachability Problem for Finite Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:1, pp:27-31 [Journal]
  47. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    A New General Derandomization Method. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1998, v:45, n:1, pp:179-213 [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. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
    Weak Random Sources, Hitting Sets, and BPP Simulations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:28, n:6, pp:2103-2116 [Journal]
  51. Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
    The Parallel Complexity of Approximating the High Degree Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:261-282 [Journal]
  52. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:307-314 [Journal]
  53. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Optimal Bounds for the Approximation of Boolean Functions and Some Applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:180, n:1-2, pp:243-268 [Journal]
  54. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:221, n:1-2, pp:3-18 [Journal]
  55. 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]
  56. 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]
  57. 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]
  58. Andrea E. F. Clementi, Luca Trevisan
    Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:225, n:1-2, pp:113-128 [Journal]
  59. Andrea E. F. Clementi, Miriam Di Ianni
    On the hardness of approximating optimum schedule problems in store and forward networks. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 1996, v:4, n:2, pp:272-280 [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. Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms [Citation Graph (, )][DBLP]


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


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


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


Search in 0.154secs, Finished in 0.157secs
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