| 2009 |
|---|
| 71 | EE | Andrea E. F. Clementi,
Francesco Pasquale,
Riccardo Silvestri:
MANETS: High mobility can make up for low transmission power
CoRR abs/0903.0520: (2009) |
| 70 | EE | Andrea E. F. Clementi,
Angelo Monti,
Francesco Pasquale,
Riccardo Silvestri:
Broadcasting in dynamic radio networks.
J. Comput. Syst. Sci. 75(4): 213-230 (2009) |
| 2008 |
|---|
| 69 | 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.
MSWiM 2008: 354-361 |
| 68 | EE | Andrea E. F. Clementi,
Claudio Macci,
Angelo Monti,
Francesco Pasquale,
Riccardo Silvestri:
Flooding time in edge-Markovian dynamic graphs.
PODC 2008: 213-222 |
| 67 | 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) |
| 66 | 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 |
|---|
| 65 | 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 |
| 64 | 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 |
| 63 | EE | Andrea E. F. Clementi,
Francesco Pasquale,
Angelo Monti,
Riccardo Silvestri:
Communication in dynamic radio networks.
PODC 2007: 205-214 |
| 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 |
| 2005 |
|---|
| 59 | 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 |
| 58 | 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 |
| 57 | 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 |
|---|
| 56 | 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 |
| 55 | 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 |
| 54 | 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) |
| 53 | EE | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
On the Power Assignment Problem in Radio Networks.
MONET 9(2): 125-140 (2004) |
| 2003 |
|---|
| 52 | EE | 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 |
| 51 | | 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 |
| 50 | 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 |
| 49 | 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) |
| 48 | 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) |
| 47 | 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) |
| 2002 |
|---|
| 46 | 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 |
| 2001 |
|---|
| 45 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks.
ESA 2001: 452-463 |
| 44 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Distributed multi-broadcast in unknown radio networks.
PODC 2001: 255-264 |
| 43 | EE | Andrea E. F. Clementi,
Pierluigi Crescenzi,
Angelo Monti,
Paolo Penna,
Riccardo Silvestri:
On Computing Ad-hoc Selective Families.
RANDOM-APPROX 2001: 211-222 |
| 42 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Selective families, superimposed codes, and broadcasting on unknown radio networks.
SODA 2001: 709-718 |
| 41 | EE | 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 |
| 40 | EE | Andrea E. F. Clementi,
Angelo Monti,
Riccardo Silvestri:
Distributed Broadcast in Wireless Networks with Unknown Topology
CoRR cs.DS/0107011: (2001) |
| 2000 |
|---|
| 39 | | 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 |
| 38 | | 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 |
| 37 | EE | Andrea E. F. Clementi,
Paolo Penna,
Riccardo Silvestri:
The Power Range Assignment Problem in Radio Networks on the Plane.
STACS 2000: 651-660 |
| 36 | EE | 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) |
| 35 | 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 |
|---|
| 34 | EE | Andrea E. F. Clementi,
Pierluigi Crescenzi,
Gianluca Rossi:
On the Complexity of Approximating Colored-Graph Problems.
COCOON 1999: 281-290 |
| 33 | EE | 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 |
| 32 | | 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 |
| 31 | EE | 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 |
| 30 | | 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) |
| 29 | EE | 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) |
| 28 | EE | 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) |
| 1998 |
|---|
| 27 | | Andrea E. F. Clementi,
José D. P. Rolim,
Luca Trevisan:
Recent Advances Towards Proving P = BPP.
Bulletin of the EATCS 64: (1998) |
| 26 | EE | Alexander E. Andreev,
Andrea E. F. Clementi,
José D. P. Rolim:
A New General Derandomization Method.
J. ACM 45(1): 179-213 (1998) |
| 25 | EE | 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 |
|---|
| 24 | EE | 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 |
| 23 | | 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 |
| 22 | | 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 |
| 21 | EE | 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) |
| 20 | EE | 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) |
| 19 | EE | 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) |
| 1996 |
|---|
| 18 | | Andrea E. F. Clementi,
Luca Trevisan:
Improved Non-approximability Results for Vertex Cover with Density Constraints.
COCOON 1996: 333-342 |
| 17 | | Alexander E. Andreev,
Andrea E. F. Clementi,
José D. P. Rolim:
Hitting Sets Derandomize BPP.
ICALP 1996: 357-368 |
| 16 | | 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 |
| 15 | | 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 |
| 14 | | Andrea E. F. Clementi,
José D. P. Rolim,
Erik Urland:
Randomized parallel algorithms.
Solving Combinatorial Optimization Problems in Parallel 1996: 25-50 |
| 13 | | 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 |
| 12 | EE | 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) |
| 11 | EE | 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) |
| 10 | EE | 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) |
| 9 | EE | 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) |
| 8 | EE | 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) |
| 1995 |
|---|
| 7 | | 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 |
| 6 | EE | 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) |
| 5 | EE | Alexander E. Andreev,
Andrea E. F. Clementi,
José D. P. Rolim:
Hitting Sets Derandomize BPP
Electronic Colloquium on Computational Complexity (ECCC) 2(61): (1995) |
| 4 | EE | Andrea E. F. Clementi,
Russell Impagliazzo:
The Reachability Problem for Finite Cellular Automata.
Inf. Process. Lett. 53(1): 27-31 (1995) |
| 3 | | 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) |
| 1994 |
|---|
| 2 | | Andrea E. F. Clementi,
Russell Impagliazzo:
Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata.
CIAC 1994: 73-90 |
| 1 | | Andrea E. F. Clementi,
Miriam Di Ianni:
Optimum Schedule Problems in Store and Forward Networks.
INFOCOM 1994: 1336-1343 |
