default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Clementi
Andrea E. F. Clementi
Person information
- affiliation: University of Rome Tor Vergata, Department of Mathematics, Rome, Italy
- affiliation (PhD 1994): Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c68]Andrea Clementi
, Luciano Gualà, Luca Pepè Sciarria, Alessandro Straziota:
Maintaining k-MinHash Signatures over Fully-Dynamic Data Streams with Recovery. WSDM 2025: 79-87- 2024
- [j42]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond percolation in small-world graphs with power-law distribution. Theor. Comput. Sci. 1011: 114717 (2024) - [c67]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi:
The Minority Dynamics and the Power of Synchronicity. SODA 2024: 4155-4176 - [i42]Andrea Clementi, Luciano Gualà, Luca Pepè Sciarria, Alessandro Straziota:
Maintaining k-MinHash Signatures over Fully-Dynamic Data Streams with Recovery. CoRR abs/2407.21614 (2024) - 2023
- [j41]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and flooding in dynamic random networks with node churn. Random Struct. Algorithms 63(1): 61-101 (2023) - [c66]Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus:
On the Role of Memory in Robust Opinion Dynamics. IJCAI 2023: 29-37 - [c65]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond Percolation in Small-World Graphs with Power-Law Distribution. SAND 2023: 3:1-3:22 - [i41]Luca Becchetti, Andrea Clementi, Amos Korman, Francesco Pasquale, Luca Trevisan, Robin Vacus:
On the Role of Memory in Robust Opinion Dynamics. CoRR abs/2302.08600 (2023) - [i40]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Robin Vacus, Isabella Ziccardi:
The Minority Dynamics and the Power of Synchronicity. CoRR abs/2310.13558 (2023) - 2022
- [j40]Francesco D'Amore, Andrea Clementi, Emanuele Natale:
Phase transition of a nonlinear opinion dynamics with noisy interactions. Swarm Intell. 16(4): 261-304 (2022) - [c64]Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Percolation and Epidemic Processes in One-Dimensional Small-World Networks - (Extended Abstract). LATIN 2022: 476-492 - [i39]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Bond Percolation in Small-World Graphs with Power-Law Distribution. CoRR abs/2205.08774 (2022) - [i38]Luca Becchetti, Arthur Carvalho Walraven da Cunha, Andrea Clementi, Francesco D'Amore, Hicham Lesfari, Emanuele Natale, Luca Trevisan:
On the Multidimensional Random Subset Sum Problem. CoRR abs/2207.13944 (2022) - 2021
- [j39]Andrea Clementi, Emanuele Natale, Isabella Ziccardi:
Parallel Load Balancing on constrained client-server topologies. Theor. Comput. Sci. 895: 16-33 (2021) - [c63]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and Flooding in Dynamic Random Networks with Node Churn. ICDCS 2021: 976-986 - [c62]Andrea Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale:
Search via Parallel Lévy Walks on Z2. PODC 2021: 81-91 - [i37]Luca Becchetti, Andrea Clementi, Riccardo Denni, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Sharp Thresholds for a SIR Model on One-Dimensional Small-World Networks. CoRR abs/2103.16398 (2021) - 2020
- [j38]Luca Becchetti, Andrea E. F. Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. SIAM J. Comput. 49(4): 821-864 (2020) - [j37]Luca Becchetti, Andrea Clementi, Emanuele Natale:
Consensus Dynamics: An Overview. SIGACT News 51(1): 58-104 (2020) - [c61]Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan:
Consensus vs Broadcast, with and Without Noise (Extended Abstract). ITCS 2020: 42:1-42:13 - [c60]Francesco D'Amore, Andrea Clementi, Emanuele Natale:
Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions - (Extended Abstract). SIROCCO 2020: 255-272 - [c59]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Finding a Bounded-Degree Expander Inside a Dense One. SODA 2020: 1320-1336 - [c58]Andrea Clementi, Emanuele Natale, Isabella Ziccardi:
Parallel Load Balancing on Constrained Client-Server Topologies. SPAA 2020: 163-173 - [i36]Andrea Clementi, Francesco D'Amore, George Giakkoupis, Emanuele Natale:
On the Search Efficiency of Parallel Lévy Walks on Z2. CoRR abs/2004.01562 (2020) - [i35]Francesco D'Amore, Andrea Clementi, Emanuele Natale:
Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions. CoRR abs/2005.07423 (2020) - [i34]Andrea Clementi, Emanuele Natale, Isabella Ziccardi:
Parallel Load Balancing on Constrained Client-Server Topologies. CoRR abs/2005.13583 (2020) - [i33]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan, Isabella Ziccardi:
Expansion and Flooding in Dynamic Random Networks with Node Churn. CoRR abs/2007.14681 (2020)
2010 – 2019
- 2019
- [j36]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
Self-stabilizing repeated balls-into-bins. Distributed Comput. 32(1): 59-68 (2019) - 2018
- [c57]Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Average Whenever You Meet: Opportunistic Protocols for Community Detection. ESA 2018: 7:1-7:13 - [c56]Andrea Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca:
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. MFCS 2018: 28:1-28:15 - [i32]Andrea Clementi, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca, Luca Trevisan:
Consensus Needs Broadcast in Noiseless Models but can be Exponentially Easier in the Presence of Noise. CoRR abs/1807.05626 (2018) - [i31]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Finding a Bounded-Degree Expander Inside a Dense One. CoRR abs/1811.10316 (2018) - 2017
- [j35]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. Distributed Comput. 30(4): 293-306 (2017) - [c55]Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca:
Rational Fair Consensus in the Gossip Model. IPDPS 2017: 163-171 - [c54]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply?: On Breaking Symmetry in Consensus. PODC 2017: 335-344 - [c53]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. SODA 2017: 940-959 - [c52]Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca:
Brief Announcement: On the Parallel Undecided-State Dynamics with Two Colors. DISC 2017: 47:1-47:4 - [i30]Petra Berenbrink, Andrea Clementi, Robert Elsässer, Peter Kling, Frederik Mallmann-Trenn, Emanuele Natale:
Ignore or Comply? On Breaking Symmetry in Consensus. CoRR abs/1702.04921 (2017) - [i29]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Friend or Foe? Population Protocols can perform Community Detection. CoRR abs/1703.05045 (2017) - [i28]Andrea Clementi, Luciano Gualà, Guido Proietti, Giacomo Scornavacca:
Rational Fair Consensus in the GOSSIP Model. CoRR abs/1705.09566 (2017) - [i27]Andrea Clementi, Luciano Gualà, Francesco Pasquale, Giacomo Scornavacca:
On the Parallel Undecided-State Dynamics with Two Colors. CoRR abs/1707.05135 (2017) - 2016
- [j34]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Francesco Pasquale, Riccardo Silvestri:
Rumor spreading in random evolving graphs. Random Struct. Algorithms 48(2): 290-312 (2016) - [c51]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Stabilizing Consensus with Many Opinions. SODA 2016: 620-635 - 2015
- [j33]Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information spreading in dynamic graphs. Distributed Comput. 28(1): 55-73 (2015) - [j32]Andrea Clementi, Riccardo Silvestri:
Parsimonious flooding in geometric random-walks. J. Comput. Syst. Sci. 81(1): 219-233 (2015) - [j31]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed community detection in dynamic graphs. Theor. Comput. Sci. 584: 19-41 (2015) - [c50]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri:
Plurality Consensus in the Gossip Model. SODA 2015: 371-390 - [c49]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
Self-Stabilizing Repeated Balls-into-Bins. SPAA 2015: 332-339 - [i26]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta:
Self-Stabilizing Repeated Balls-into-Bins. CoRR abs/1501.04822 (2015) - [i25]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale:
Probabilistic Self-Stabilization. CoRR abs/1507.06707 (2015) - [i24]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Stabilizing Consensus with Many Opinions. CoRR abs/1508.06782 (2015) - [i23]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Luca Trevisan:
Find Your Place: Simple Distributed Algorithms for Community Detection. CoRR abs/1511.03927 (2015) - 2014
- [j30]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri:
Flooding Time in Opportunistic Networks under Power Law and Exponential Intercontact Times. IEEE Trans. Parallel Distributed Syst. 25(9): 2297-2306 (2014) - [c48]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple dynamics for plurality consensus. SPAA 2014: 247-256 - [i22]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri:
Plurality Consensus in the Gossip Model. CoRR abs/1407.2565 (2014) - 2013
- [j29]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Fast flooding over Manhattan. Distributed Comput. 26(1): 25-38 (2013) - [j28]Andrea Clementi, Francesco Pasquale, Riccardo Silvestri:
Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power. IEEE/ACM Trans. Netw. 21(2): 610-620 (2013) - [c47]Andrea Clementi, Pierluigi Crescenzi, Carola Doerr, Pierre Fraigniaud, Marco Isopi, Alessandro Panconesi, Francesco Pasquale, Riccardo Silvestri:
Rumor Spreading in Random Evolving Graphs. ESA 2013: 325-336 - [c46]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed Community Detection in Dynamic Graphs - (Extended Abstract). SIROCCO 2013: 1-12 - [i21]Andrea 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) - [i20]Andrea Clementi, Miriam Di Ianni, Giorgio Gambosi, Emanuele Natale, Riccardo Silvestri:
Distributed Community Detection in Dynamic Graphs. CoRR abs/1302.5607 (2013) - [i19]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Riccardo Silvestri, Luca Trevisan:
Simple Dynamics for Majority Consensus. CoRR abs/1310.2858 (2013) - 2012
- [j27]Andrea 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 Clementi, Riccardo Silvestri, Luca Trevisan:
Information spreading in dynamic graphs. PODC 2012: 37-46 - 2011
- [j26]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Modelling mobility: A discrete revolution. Ad Hoc Networks 9(6): 998-1014 (2011) - [j25]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 Distributed Syst. 22(2): 208-216 (2011) - [j24]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information Spreading in Stationary Markovian Evolving Graphs. IEEE Trans. Parallel Distributed 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 - [p1]Andrea Clementi, Francesco Pasquale:
Information Spreading in Dynamic Networks: An Analytical Approach. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 591-619 - [i18]Andrea Clementi, Riccardo Silvestri:
Parsimonious Flooding in Geometric Random-Walks. CoRR abs/1101.5308 (2011) - [i17]Andrea Clementi, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Information Spreading in Stationary Markovian Evolving Graphs. CoRR abs/1103.0741 (2011) - [i16]Luca Becchetti, Andrea Clementi, Francesco Pasquale, Giovanni Resta, Paolo Santi, Riccardo Silvestri:
Information Spreading in Opportunistic Networks is Fast. CoRR abs/1107.5241 (2011) - [i15]Andrea Clementi, Riccardo Silvestri, Luca Trevisan:
Information Spreading in Dynamic Graphs. CoRR abs/1111.0583 (2011) - 2010
- [j23]Andrea E. F. Clementi, Claudio Macci, Angelo Monti, Francesco Pasquale, Riccardo Silvestri:
Flooding Time of Edge-Markovian Evolving Graphs. SIAM J. Discret. 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 Clementi, Angelo Monti, Riccardo Silvestri:
Fast flooding over Manhattan. PODC 2010: 375-383 - [i14]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Modelling Mobility: A Discrete Revolution. CoRR abs/1002.1016 (2010) - [i13]Andrea Clementi, Angelo Monti, Riccardo Silvestri:
Fast Flooding over Manhattan. CoRR abs/1002.3757 (2010)
2000 – 2009
- 2009
- [j22]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
- [j21]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
- [j20]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
- [j19]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
- [j18]Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri:
Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distributed Comput. 64(1): 89-96 (2004) - [j17]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
On the Power Assignment Problem in Radio Networks. Mob. Networks Appl. 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
- [j16]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) - [j15]Andrea E. F. Clementi, Miriam Di Ianni, Riccardo Silvestri:
The minimum broadcast range assignment problem on linear multi-hop wireless networks. Theor. Comput. Sci. 299(1-3): 751-761 (2003) - [j14]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. Electron. Colloquium Comput. Complex. TR00 (2000) - [i8]Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri:
On the power assignment problem in radio networks. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j13]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) - [j12]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) - [j11]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
- [j10]Andrea E. F. Clementi, José D. P. Rolim, Luca Trevisan:
Recent Advances Towards Proving P = BPP. Bull. EATCS 64 (1998) - [j9]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
A New General Derandomization Method. J. ACM 45(1): 179-213 (1998) - [j8]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
- [j7]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. Electron. Colloquium Comput. Complex. TR97 (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. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j6]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) - [j5]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 Clementi, Pierluigi Crescenzi, Riccardo Silvestri:
Parallel approximation of optimization problems. Solving Combinatorial Optimization Problems in Parallel 1996: 7-24 - [c5]Andrea 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. Electron. Colloquium Comput. Complex. TR96 (1996) - [i4]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Towards efficient constructions of hitting sets that derandomize BPP. Electron. Colloquium Comput. Complex. TR96 (1996) - [i3]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Hitting Properties of Hard Boolean Operators and their Consequences on BPP. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j4]Andrea Clementi, Patrizia Mentrasti, Pierluigi Pierini:
Some Results on Invertible Cellular Automata. Complex Syst. 9(3) (1995) - [j3]Andrea Clementi, Miriam Di Ianni:
Optimum Schedule Problems in Store and Forward Networks. Int. J. Found. Comput. Sci. 6(2): 155-168 (1995) - [j2]Andrea Clementi, Russell Impagliazzo:
The Reachability Problem for Finite Cellular Automata. Inf. Process. Lett. 53(1): 27-31 (1995) - [c3]Alexander E. Andreev, Andrea 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. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Hitting Sets Derandomize BPP. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [j1]Andrea Clementi, Giuseppe A. De Biase, Annalisa Massini:
Fast Parallel Arithmetic on Cellular Automata. Complex Syst. 8(6) (1994) - [c2]Andrea 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
Coauthor Index
[j42] [c67] [j41] [c66] [c65] [i41] [i40] [c64] [i39] [c63] [i37] [j38] [c61] [c59] [i33] [j36] [c57] [c56] [i32] [i31] [j35] [c53] [c52] [i29] [i27] [j34] [c51] [c50] [c49] [i26] [i25] [i24] [i23] [j30] [c48] [i22] [j28] [c47] [i21] [i19] [j27] [j24] [p1] [i17] [i16] [j23] [j22] [c41] [c40] [i12] [c38] [c37] [c35]
[j35] [j34] [j33] [j32] [j31] [c50] [j30] [c48] [i22] [j29] [j28] [c47] [c46] [i21] [i20] [i19] [j27] [c45] [j26] [j25] [j24] [c44] [i18] [i17] [i16] [i15] [j23] [c43] [c42] [i14] [i13] [j22] [c41] [c40] [i12] [j21] [c39] [c38] [i11] [j20] [c37] [c36] [c35] [c34] [c33] [j19] [c32] [c31] [j18] [j17] [c30] [c29] [j16] [j15] [j14] [c27] [c26] [c25] [c24] [c23] [c22] [c21] [i10] [c19] [c17] [i8] [c14] [c6]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
