Andrea E. F. Clementi

From MaRDI portal
Revision as of 15:23, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Andrea E. F. Clementi to Andrea E. F. Clementi: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:930900

Available identifiers

zbMath Open clementi.andrea-e-fMaRDI QIDQ930900

List of research outcomes





PublicationDate of PublicationType
The minority dynamics and the power of synchronicity2024-11-28Paper
Bond percolation in small-world graphs with power-law distribution2024-08-21Paper
Parallel approximation of optimization problems2024-06-21Paper
Randomized parallel algorithms2024-06-21Paper
Search via Parallel Lévy Walks on Z22024-03-26Paper
Improved non-approximability results for vertex cover with density constraints2024-01-29Paper
Expansion and flooding in dynamic random networks with node churn2023-10-12Paper
Percolation and epidemic processes in one-dimensional small-world networks (extended abstract)2023-07-26Paper
The parallel complexity of approximating the High Degree Subgraph problem2023-03-21Paper
Consensus vs Broadcast, with and without Noise2023-02-03Paper
Efficient constructions of Hitting Sets for systems of linear functions2022-11-09Paper
Phase Transition of a Non-linear Opinion Dynamics with Noisy Interactions2022-09-01Paper
Bond Percolation in Small-World Graphs with Power-Law Distribution2022-05-18Paper
Parallel load balancing on constrained client-server topologies2021-11-18Paper
https://portal.mardi4nfdi.de/entity/Q50051282021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50095642021-08-04Paper
Finding a Bounded-Degree Expander Inside a Dense One2021-02-02Paper
Find Your Place: Simple Distributed Algorithms for Community Detection2020-08-18Paper
Self-stabilizing repeated balls-into-bins2019-03-21Paper
Stabilizing Consensus with Many Opinions2018-07-16Paper
Find Your Place: Simple Distributed Algorithms for Community Detection2018-07-16Paper
Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs2018-07-04Paper
Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness2017-11-16Paper
Ignore or Comply?2017-10-11Paper
Plurality Consensus in the Gossip Model2017-10-05Paper
Simple dynamics for plurality consensus2017-09-04Paper
Rumor spreading in random evolving graphs2016-03-22Paper
Distributed multi-broadcast in unknown radio networks2016-03-04Paper
Distributed community detection in dynamic graphs2015-05-22Paper
Information spreading in dynamic graphs2015-03-25Paper
Fast flooding over Manhattan2015-03-02Paper
Flooding time in edge-Markovian dynamic graphs2014-12-12Paper
Information spreading in dynamic graphs2014-12-05Paper
Parsimonious flooding in geometric random-walks2014-09-22Paper
Communication in dynamic radio networks2014-03-13Paper
Distributed Community Detection in Dynamic Graphs2013-12-17Paper
Rumor Spreading in Random Evolving Graphs2013-09-17Paper
Fast flooding over Manhattan2013-06-25Paper
Optimal gossiping in geometric radio networks in the presence of dynamical faults2012-06-29Paper
Parsimonious Flooding in Geometric Random-Walks2011-10-28Paper
Flooding Time of Edge-Markovian Evolving Graphs2011-07-18Paper
Information Spreading in Dynamic Networks: An Analytical Approach2011-04-05Paper
Approximation and Online Algorithms2009-08-11Paper
MANETS: High Mobility Can Make Up for Low Transmission Power2009-07-14Paper
Broadcasting in dynamic radio networks2009-04-30Paper
Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks2009-03-12Paper
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults2008-09-17Paper
Minimum-energy broadcast and disk cover in grid wireless networks2008-06-24Paper
On the bounded-hop MST problem on random Euclidean instances2007-10-02Paper
STACS 20042007-10-01Paper
Structural Information and Communication Complexity2005-11-30Paper
On the approximability of the range assignment problem on radio networks in presence of selfish agents2005-10-26Paper
https://portal.mardi4nfdi.de/entity/Q48188492004-09-24Paper
Round robin is optimal for fault-tolerant broadcasting on wireless networks2004-09-08Paper
https://portal.mardi4nfdi.de/entity/Q44278542003-09-14Paper
Distributed broadcast in radio networks of unknown topology.2003-08-17Paper
The minimum range assignment problem on linear radio networks2003-06-02Paper
The minimum broadcast range assignment problem on linear multi-hop wireless networks.2003-05-25Paper
https://portal.mardi4nfdi.de/entity/Q47961952003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q47854662003-02-04Paper
https://portal.mardi4nfdi.de/entity/Q27683692002-03-24Paper
https://portal.mardi4nfdi.de/entity/Q27625002002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27539312001-12-18Paper
https://portal.mardi4nfdi.de/entity/Q45015692001-12-05Paper
https://portal.mardi4nfdi.de/entity/Q49386242000-07-10Paper
Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs2000-01-12Paper
Improved non-approximability results for minimum vertex cover with density constraints2000-01-12Paper
Weak Random Sources, Hitting Sets, and BPP Simulations1999-10-28Paper
The parallel complexity of approximating the high degree subgraph problem1999-01-12Paper
A new general derandomization method1999-01-05Paper
Optimal bounds for the approximation of Boolean functions and some applications1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43908651998-05-26Paper
The reachability problem for finite cellular automata1997-02-28Paper
Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\)1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48952371997-01-22Paper
OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS1996-01-28Paper
https://portal.mardi4nfdi.de/entity/Q48488141995-09-20Paper

Research outcomes over time

This page was built for person: Andrea E. F. Clementi