The following pages link to Riccardo Silvestri (Q590536):
Displaying 50 items.
- (Q235224) (redirect page) (← links)
- Revisiting a result of Ko (Q286990) (← links)
- A characterization of the leaf language classes (Q287160) (← links)
- Helping by unambiguous computation and probabilistic computation (Q675865) (← links)
- A note on the descriptive complexity of maximization problems (Q685495) (← links)
- Parsimonious flooding in geometric random-walks (Q743122) (← links)
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446) (← links)
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- Broadcasting in dynamic radio networks (Q1015809) (← links)
- A uniform approach to define complexity classes (Q1200807) (← links)
- Sperner's lemma and robust machines (Q1272662) (← links)
- A worst-case analysis of the LZ2 compression algorithm (Q1383148) (← links)
- On compact representations of propositional circumscription (Q1391128) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- Polynomial time introreducibility (Q1405796) (← links)
- The minimum range assignment problem on linear radio networks (Q1566370) (← links)
- An experimental analysis of simple, distributed vertex coloring algorithms (Q1763143) (← links)
- On weighted vs unweighted versions of combinatorial optimization problems (Q1854428) (← 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)
- Complexity classes and sparse oracles (Q1894447) (← links)
- On the importance of having an identity or, is consensus really universal? (Q1953645) (← 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)
- (Q2753931) (← links)
- (Q2766868) (← 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)
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem (Q3508564) (← 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)
- Structure in Approximation Classes (Q4268816) (← links)
- AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS (Q4275181) (← links)
- (Q4281491) (← links)
- (Q4284249) (← links)
- The Helping Hierarchy (Q4331052) (← links)
- (Q4427854) (← links)
- (Q4501569) (← links)
