| 2013 | ||
|---|---|---|
| j26 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Fast flooding over Manhattan. Distributed Computing 26(1): 25-38 (2013) | |
| i20 | Andrea E. F. 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) | |
| i19 | Andrea E. F. Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri: Distributed Community Detection in Dynamic Graphs. CoRR abs/1302.5607 (2013) | |
| 2012 | ||
| j25 | Andrea E. F. 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) | |
| c45 | Andrea E. F. Clementi, Riccardo Silvestri, Luca Trevisan: Information spreading in dynamic graphs. PODC 2012: 37-46 | |
| 2011 | ||
| j24 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Modelling mobility: A discrete revolution. Ad Hoc Networks 9(6): 998-1014 (2011) | |
| j23 | 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 Distrib. Syst. 22(2): 208-216 (2011) | |
| j22 | Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distrib. Syst. 22(9): 1425-1432 (2011) | |
| c44 | Andrea E. F. Clementi, Riccardo Silvestri: Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). DISC 2011: 298-310 | |
| i18 | Andrea E. F. Clementi, Riccardo Silvestri: Parsimonious Flooding in Geometric Random-Walks. CoRR abs/1101.5308 (2011) | |
| i17 | Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Information Spreading in Stationary Markovian Evolving Graphs. CoRR abs/1103.0741 (2011) | |
| i16 | Luca Becchetti, Andrea E. F. Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri: Information Spreading in Opportunistic Networks is Fast. CoRR abs/1107.5241 (2011) | |
| i15 | Andrea E. F. Clementi, Riccardo Silvestri, Luca Trevisan: Information Spreading in Dynamic Graphs. CoRR abs/1111.0583 (2011) | |
| 2010 | ||
| j21 | Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discrete Math. 24(4): 1694-1712 (2010) | |
| c43 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Modelling Mobility: A Discrete Revolution. ICALP (2) 2010: 490-501 | |
| c42 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Fast flooding over Manhattan. PODC 2010: 375-383 | |
| i14 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Modelling Mobility: A Discrete Revolution. CoRR abs/1002.1016 (2010) | |
| i13 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Fast Flooding over Manhattan. CoRR abs/1002.3757 (2010) | |
| 2009 | ||
| j20 | Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. 75(4): 213-230 (2009) | |
| c41 | Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri: MANETS: High Mobility Can Make Up for Low Transmission Power. ICALP (2) 2009: 387-398 | |
| c40 | Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Information spreading in stationary Markovian evolving graphs. IPDPS 2009: 1-12 | |
| i12 | Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri: MANETS: High mobility can make up for low transmission power. CoRR abs/0903.0520 (2009) | |
| 2008 | ||
| j19 | 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) | |
| c39 | 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 | |
| c38 | Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri: Flooding time in edge-Markovian dynamic graphs. PODC 2008: 213-222 | |
| i11 | 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 | ||
| j18 | 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) | |
| c37 | 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 | |
| c36 | 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 | |
| c35 | Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri: Communication in dynamic radio networks. PODC 2007: 205-214 | |
| 2006 | ||
| c34 | 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 | |
| c33 | 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 | ||
| j17 | 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) | |
| c32 | 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 | |
| c31 | 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 | ||
| j16 | 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) | |
| j15 | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: On the Power Assignment Problem in Radio Networks. MONET 9(2): 125-140 (2004) | |
| c30 | 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 | |
| c29 | 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 | ||
| j14 | 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) | |
| j13 | 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) | |
| j12 | 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) | |
| c28 | 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. IPDPS 2003: 222 | |
| c27 | 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 | |
| c26 | 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 | |
| 2002 | ||
| c25 | 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 | |
| 2001 | ||
| c24 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. ESA 2001: 452-463 | |
| c23 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Distributed multi-broadcast in unknown radio networks. PODC 2001: 255-264 | |
| c22 | Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri: On Computing Ad-hoc Selective Families. RANDOM-APPROX 2001: 211-222 | |
| c21 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Selective families, superimposed codes, and broadcasting on unknown radio networks. SODA 2001: 709-718 | |
| c20 | Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS 2001: 121-131 | |
| i10 | Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri: Distributed Broadcast in Wireless Networks with Unknown Topology. CoRR cs.DS/0107011 (2001) | |
| 2000 | ||
| c19 | 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 | |
| c18 | Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna: A Note on Parallel Read Operations on Large Public Databases. ICALP Satellite Workshops 2000: 123-134 | |
| c17 | Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri: The Power Range Assignment Problem in Radio Networks on the Plane. STACS 2000: 651-660 | |
| i9 | Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim: Parallel Read Operations Without Memory Contention. Electronic Colloquium on Computational Complexity (ECCC) 7(53) (2000) | |
| i8 | 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 | ||
| j11 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. SIAM J. Comput. 28(6): 2103-2116 (1999) | |
| j10 | 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. Theor. Comput. Sci. 221(1-2): 3-18 (1999) | |
| j9 | Andrea E. F. Clementi, Luca Trevisan: Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. Theor. Comput. Sci. 225(1-2): 113-128 (1999) | |
| c16 | Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi: On the Complexity of Approximating Colored-Graph Problems. COCOON 1999: 281-290 | |
| c15 | 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. ICALP 1999: 179-189 | |
| c14 | 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 | |
| c13 | 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. STACS 1999: 68-77 | |
| 1998 | ||
| j8 | Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Recent Advances Towards Proving P = BPP. Bulletin of the EATCS 64 (1998) | |
| j7 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: A New General Derandomization Method. J. ACM 45(1): 179-213 (1998) | |
| j6 | 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. Theor. Comput. Sci. 205(1-2): 261-282 (1998) | |
| 1997 | ||
| j5 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds for the Approximation of Boolean Functions and Some Applications. Theor. Comput. Sci. 180(1-2): 243-268 (1997) | |
| c12 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS 1997: 264-272 | |
| c11 | 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. ICALP 1997: 177-187 | |
| c10 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Efficient Construction of Hitting Sets for Systems of Linear Functions. STACS 1997: 387-398 | |
| i7 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan: Weak Random Sources, Hitting Sets, and BPP Simulations. Electronic Colloquium on Computational Complexity (ECCC) 4(11) (1997) | |
| i6 | 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. Electronic Colloquium on Computational Complexity (ECCC) 4(53) (1997) | |
| 1996 | ||
| j4 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. Theor. Comput. Sci. 161(1&2): 307-314 (1996) | |
| j3 | Andrea E. F. Clementi, Miriam Di Ianni: On the hardness of approximating optimum schedule problems in store and forward networks. IEEE/ACM Trans. Netw. 4(2): 272-280 (1996) | |
| c9 | Andrea E. F. Clementi, Luca Trevisan: Improved Non-approximability Results for Vertex Cover with Density Constraints. COCOON 1996: 333-342 | |
| c8 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Sets Derandomize BPP. ICALP 1996: 357-368 | |
| c7 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: On the Parallel Computation of Boolean Functions on Unrelated inputs. ISTCS 1996: 155-161 | |
| c6 | 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 | |
| c5 | Andrea E. F. Clementi, José D. P. Rolim, Erik Urland: Randomized parallel algorithms. Solving Combinatorial Optimization Problems in Parallel 1996: 25-50 | |
| c4 | 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. STACS 1996: 319-330 | |
| i5 | Andrea E. F. Clementi, Luca Trevisan: Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints. Electronic Colloquium on Computational Complexity (ECCC) 3(16) (1996) | |
| i4 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Towards efficient constructions of hitting sets that derandomize BPP. Electronic Colloquium on Computational Complexity (ECCC) 3(29) (1996) | |
| i3 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Properties of Hard Boolean Operators and their Consequences on BPP. Electronic Colloquium on Computational Complexity (ECCC) 3(55) (1996) | |
| 1995 | ||
| j2 | Andrea E. F. Clementi, Miriam Di Ianni: Optimum Schedule Problems in Store and Forward Networks. Int. J. Found. Comput. Sci. 6(2): 155-168 (1995) | |
| j1 | Andrea E. F. Clementi, Russell Impagliazzo: The Reachability Problem for Finite Cellular Automata. Inf. Process. Lett. 53(1): 27-31 (1995) | |
| c3 | 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. ISAAC 1995: 132-141 | |
| i2 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Optimal Bounds for the Approximation of Boolean Functions and Some Applications. Electronic Colloquium on Computational Complexity (ECCC) 2(41) (1995) | |
| i1 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim: Hitting Sets Derandomize BPP. Electronic Colloquium on Computational Complexity (ECCC) 2(61) (1995) | |
| 1994 | ||
| c2 | Andrea E. F. Clementi, Russell Impagliazzo: Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. CIAC 1994: 73-90 | |
| c1 | Andrea E. F. Clementi, Miriam Di Ianni: Optimum Schedule Problems in Store and Forward Networks. INFOCOM 1994: 1336-1343 | |
Data released under the ODC-BY 1.0 license — See also our legal information page