The following pages link to Andrea E. F. Clementi (Q930900):
Displaying 50 items.
- (Q674291) (redirect page) (← links)
- (Q1275084) (redirect page) (← links)
- The reachability problem for finite cellular automata (Q674292) (← links)
- Parsimonious flooding in geometric random-walks (Q743122) (← links)
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- Broadcasting in dynamic radio networks (Q1015809) (← links)
- The parallel complexity of approximating the high degree subgraph problem (Q1275085) (← links)
- Constructing the highest degree subgraph for dense graphs is in \({\mathcal N}{\mathcal C}{\mathcal A}{\mathcal S}\) (Q1351969) (← links)
- Optimal bounds for the approximation of Boolean functions and some applications (Q1390872) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- The minimum range assignment problem on linear radio networks (Q1566370) (← links)
- Self-stabilizing repeated balls-into-bins (Q1733393) (← links)
- The minimum broadcast range assignment problem on linear multi-hop wireless networks. (Q1874421) (← links)
- Round robin is optimal for fault-tolerant broadcasting on wireless networks (Q1878699) (← links)
- Worst-case hardness suffices for derandomization: a new method for hardness-randomness trade-offs (Q1960516) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- Distributed community detection in dynamic graphs (Q2345454) (← links)
- Fast flooding over Manhattan (Q2375821) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- Simple dynamics for plurality consensus (Q2401681) (← links)
- On the approximability of the range assignment problem on radio networks in presence of selfish agents (Q2570125) (← links)
- Parallel load balancing on constrained client-server topologies (Q2664933) (← links)
- (Q2753931) (← links)
- (Q2762500) (← links)
- (Q2768369) (← links)
- Distributed multi-broadcast in unknown radio networks (Q2787689) (← links)
- Rumor spreading in random evolving graphs (Q2795745) (← links)
- Rumor Spreading in Random Evolving Graphs (Q2849323) (← links)
- Distributed Community Detection in Dynamic Graphs (Q2868627) (← links)
- Optimal gossiping in geometric radio networks in the presence of dynamical faults (Q2894246) (← links)
- Flooding time in edge-Markovian dynamic graphs (Q2934348) (← links)
- Flooding Time of Edge-Markovian Evolving Graphs (Q3013157) (← links)
- Parsimonious Flooding in Geometric Random-Walks (Q3095334) (← links)
- Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults (Q3525590) (← links)
- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks (Q3613654) (← links)
- MANETS: High Mobility Can Make Up for Low Transmission Power (Q3638108) (← links)
- A new general derandomization method (Q3841044) (← links)
- Weak Random Sources, Hitting Sets, and BPP Simulations (Q4268859) (← links)
- (Q4390865) (← links)
- (Q4427854) (← links)
- (Q4501569) (← links)
- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs (Q4571950) (← links)
- Stabilizing Consensus with Many Opinions (Q4575624) (← links)
- Find Your Place: Simple Distributed Algorithms for Community Detection (Q4575798) (← links)
- Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness (Q4593942) (← links)
- (Q4785466) (← links)
- (Q4796195) (← links)
- (Q4818849) (← links)
- (Q4848814) (← links)
- OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS (Q4853335) (← links)
- (Q4895237) (← links)
