Andrea E. F. Clementi

72 papers A* 9A 14B 7Misc 2Journal 33Unranked 7

Year	Rank	Type	Title / Venue / Authors
2020	J	`jnl`	Find Your Place: Simple Distributed Algorithms for Community Detection. SIAM J. Comput. Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan
2011	J	`jnl`	Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks. IEEE Trans. Parallel Distributed Syst. Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri
2011	A	`conf`	Parsimonious Flooding in Geometric Random-Walks - (Extended Abstract). DISC Andrea E. F. Clementi, Riccardo Silvestri
2010	J	`jnl`	Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discret. Math. Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2010	—	`conf`	Modelling Mobility: A ICALP (2) Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2009	J	`jnl`	Broadcasting in dynamic radio networks. J. Comput. Syst. Sci. Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2009	A	`conf`	Information spreading in stationary Markovian evolving graphs. IPDPS Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2009	—	`conf`	MANETS: High Mobility Can Make Up for Low Transmission Power. ICALP (2) Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri
2009	J	`jnl`	MANETS: High mobility can make up for low transmission power CoRR Andrea E. F. Clementi, Francesco Pasquale, Riccardo Silvestri
2008	A*	`conf`	Flooding time in edge-Markovian dynamic graphs. PODC Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2008	J	`jnl`	Minimum-Energy Broadcast and disk cover in grid wireless networks. Theor. Comput. Sci. Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
2008	J	`jnl`	Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms CoRR Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2008	A	`conf`	Minimum-energy broadcast in random-grid ad-hoc networks: approximation and distributed algorithms. MSWiM Tiziana Calamoneri, Andrea E. F. Clementi, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2007	A*	`conf`	Communication in dynamic radio networks. PODC Andrea E. F. Clementi, Francesco Pasquale, Angelo Monti, Riccardo Silvestri
2007	B	`conf`	Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks. OPODIS Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri
2007	J	`jnl`	On the bounded-hop MST problem on random Euclidean instances. Theor. Comput. Sci. Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2007	B	`conf`	Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults. MFCS Andrea E. F. Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri
2006	—	`conf`	A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. ADHOC-NOW Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2006	B	`conf`	Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks. SIROCCO Tiziana Calamoneri, Andrea E. F. Clementi, Miriam Di Ianni, Massimo Lauria, Angelo Monti, Riccardo Silvestri
2005	B	`conf`	Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances. SIROCCO Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Massimo Lauria, Gianluca Rossi, Riccardo Silvestri
2005	A	`conf`	Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks. IPDPS Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
2005	J	`jnl`	On the approximability of the range assignment problem on radio networks in presence of selfish agents. Theor. Comput. Sci. Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2004	A	`conf`	Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. STACS Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg, Gianluca Rossi, Riccardo Silvestri
2004	J	`jnl`	On the Power Assignment Problem in Radio Networks. Mob. Networks Appl. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
2004	J	`jnl`	Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distributed Comput. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2004	A	`conf`	The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. IPDPS Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Gianluca Rossi, Angelo Monti, Riccardo Silvestri
2003	J	`jnl`	Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2003	B	`conf`	Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. SIROCCO Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2003	B	`conf`	Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. WAOA Christoph Ambühl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri
2003	A	`conf`	On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. IPDPS Andrea E. F. Clementi, Gurvan Huiban, Gianluca Rossi, Yann C. Verhoeven, Paolo Penna
2003	J	`jnl`	The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica Andrea E. F. Clementi, Paolo Penna, Afonso Ferreira, Stephane Perennes, Riccardo Silvestri
2003	J	`jnl`	The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri
2002	B	`conf`	Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. ISAAC Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	J	`jnl`	Distributed Broadcast in Wireless Networks with Unknown Topology CoRR Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	A*	`conf`	Distributed multi-broadcast in unknown radio networks. PODC Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	—	`conf`	On Computing Ad-hoc Selective Families. RANDOM-APPROX Andrea E. F. Clementi, Pierluigi Crescenzi, Angelo Monti, Paolo Penna, Riccardo Silvestri
2001	A	`conf`	On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. STACS Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo Penna, Gianluca Rossi, Paola Vocca
2001	A	`conf`	Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. ESA Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2001	A*	`conf`	Selective families, superimposed codes, and broadcasting on unknown radio networks. SODA Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
2000	—	`conf`	A Note on Parallel Read Operations on Large Public Databases. ICALP Satellite Workshops Gian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna
2000	J	`jnl`	On the power assignment problem in radio networks Electron. Colloquium Comput. Complex. Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
2000	J	`jnl`	Parallel Read Operations Without Memory Contention Electron. Colloquium Comput. Complex. Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
2000	A	`conf`	The Minimum Range Assignment Problem on Linear Radio Networks. ESA Andrea E. F. Clementi, Afonso Ferreira, Paolo Penna, Stephane Perennes, Riccardo Silvestri
2000	A	`conf`	The Power Range Assignment Problem in Radio Networks on the Plane. STACS Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
1999	—	`conf`	Hardness Results for the Power Range Assignmet Problem in Packet Radio Networks. RANDOM-APPROX Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri
1999	J	`jnl`	Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. Theor. Comput. Sci. Andrea E. F. Clementi, Luca Trevisan
1999	A	`conf`	Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. STACS Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim
1999	Misc	`conf`	On the Complexity of Approximating Colored-Graph Problems. COCOON Andrea E. F. Clementi, Pierluigi Crescenzi, Gianluca Rossi
1999	A*	`conf`	Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. ICALP Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
1999	J	`jnl`	Weak Random Sources, Hitting Sets, and BPP Simulations. SIAM J. Comput. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
1999	J	`jnl`	Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs. Theor. Comput. Sci. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1998	J	`jnl`	A New General Derandomization Method. J. ACM Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1998	J	`jnl`	Recent Advances Towards Proving P = BPP. Bull. EATCS Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
1998	J	`jnl`	The Parallel Complexity of Approximating the High Degree Subgraph Problem. Theor. Comput. Sci. Alexander E. Andreev, Andrea E. F. Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim
1997	A	`conf`	Efficient Construction of Hitting Sets for Systems of Linear Functions. STACS Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1997	J	`jnl`	Optimal Bounds for the Approximation of Boolean Functions and Some Applications. Theor. Comput. Sci. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1997	J	`jnl`	Small Random Sets for Affine Spaces and Better Explicit Lower Bounds for Branching Programs Electron. Colloquium Comput. Complex. Alexander E. Andreev, Juri L. Baskakov, Andrea E. F. Clementi, José D. P. Rolim
1997	J	`jnl`	Weak Random Sources, Hitting Sets, and BPP Simulations Electron. Colloquium Comput. Complex. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
1997	A*	`conf`	Weak Random Sources, Hitting Sets, and BPP Simulations. FOCS Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan
1997	A*	`conf`	Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs. ICALP Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1996	J	`jnl`	Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. Theor. Comput. Sci. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1996	J	`jnl`	Hitting Properties of Hard Boolean Operators and their Consequences on BPP Electron. Colloquium Comput. Complex. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1996	A*	`conf`	Hitting Sets Derandomize BPP. ICALP Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1996	J	`jnl`	Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints Electron. Colloquium Comput. Complex. Andrea E. F. Clementi, Luca Trevisan
1996	Misc	`conf`	Improved Non-approximability Results for Vertex Cover with Density Constraints. COCOON Andrea E. F. Clementi, Luca Trevisan
1996	—	`conf`	On the Parallel Computation of Boolean Functions on Unrelated inputs. ISTCS Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1996	J	`jnl`	On the hardness of approximating optimum schedule problems in store and forward networks. IEEE/ACM Trans. Netw. Andrea E. F. Clementi, Miriam Di Ianni
1996	A	`conf`	Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. STACS Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1996	J	`jnl`	Towards efficient constructions of hitting sets that derandomize BPP Electron. Colloquium Comput. Complex. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1995	J	`jnl`	Hitting Sets Derandomize BPP Electron. Colloquium Comput. Complex. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1995	J	`jnl`	Optimal Bounds for the Approximation of Boolean Functions and Some Applications Electron. Colloquium Comput. Complex. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
1994	A*	`conf`	Optimum Schedule Problems in Store and Forward Networks. INFOCOM Andrea E. F. Clementi, Miriam Di Ianni