SILVESTRI, RICCARDO
 Distribuzione geografica
Continente #
NA - Nord America 4.353
EU - Europa 750
AS - Asia 425
SA - Sud America 41
OC - Oceania 4
AF - Africa 3
Totale 5.576
Nazione #
US - Stati Uniti d'America 4.332
UA - Ucraina 251
SG - Singapore 179
IN - India 160
FI - Finlandia 99
IT - Italia 92
SE - Svezia 80
CN - Cina 77
RU - Federazione Russa 75
GB - Regno Unito 53
DE - Germania 36
AR - Argentina 33
BG - Bulgaria 24
CA - Canada 20
IE - Irlanda 13
BE - Belgio 8
RO - Romania 8
BR - Brasile 7
FR - Francia 3
AU - Australia 2
CH - Svizzera 2
DK - Danimarca 2
ID - Indonesia 2
NL - Olanda 2
NZ - Nuova Zelanda 2
AT - Austria 1
AZ - Azerbaigian 1
CO - Colombia 1
ES - Italia 1
HK - Hong Kong 1
IL - Israele 1
IQ - Iraq 1
IR - Iran 1
JP - Giappone 1
MX - Messico 1
NG - Nigeria 1
SC - Seychelles 1
TR - Turchia 1
ZA - Sudafrica 1
Totale 5.576
Città #
Fairfield 760
Woodbridge 402
Houston 345
Chandler 342
Seattle 303
Ashburn 302
Wilmington 224
Cambridge 207
Ann Arbor 195
Santa Clara 146
Singapore 124
Jacksonville 107
Princeton 91
Plano 90
Rome 55
Beijing 53
Des Moines 47
Lawrence 46
Boardman 36
Millbury 35
Boston 34
Federal 33
San Diego 31
San Paolo di Civitate 24
Sofia 24
Andover 23
Norwalk 23
Southend 19
Moscow 17
Dearborn 16
Falls Church 15
Toronto 14
Dublin 12
Falkenstein 11
Helsinki 9
Auburn Hills 8
Brussels 8
Bühl 8
New York 8
Mannheim 7
San Mateo 7
Nanjing 6
Yubileyny 6
Kunming 5
Ottawa 5
Indiana 4
Treviso 4
Trumbull 4
Grafing 3
London 3
Los Angeles 3
Provo 3
Shenyang 3
Washington 3
Grosseto 2
Islington 2
Jakarta 2
Kilburn 2
Laurel 2
Philadelphia 2
Phoenix 2
Redmond 2
Sterling 2
Tappahannock 2
Yellow Springs 2
Aarhus 1
Abuja 1
Auckland 1
Baghdad 1
Baku 1
Basildon 1
Buffalo 1
Campinas 1
Campo Alegre 1
Chengdu 1
Chiyoda-ku 1
Chongqing 1
Copenhagen 1
Cormeilles-en-Parisis 1
Dallas 1
Denver 1
Drogheda 1
Gaziantep 1
Glasgow 1
Hamilton 1
Hounslow 1
Huizhou 1
Itaperuna 1
Jinan 1
Jundiaí 1
Mahé 1
Mairena del Aljarafe 1
Medellín 1
Melbourne 1
Milan 1
Muizenberg 1
Nanchang 1
New Canaan 1
Olinda 1
Paris 1
Totale 4.370
Nome #
A NOTE ON THE DESCRIPTIVE COMPLEXITY OF MAXIMIZATION PROBLEMS 117
A NOTE ON THE APPROXIMATION OF THE MAX CLIQUE PROBLEM 110
On the power assignment problem in radio networks 101
Plurality consensus in the gossip model 95
Distributed community detection in dynamic graphs 92
Structure in Approximation Classes 88
Bounded Size Dictionary Compression: SC^k-Completeness and NC Algorithms 87
On the approximability of the range assignment problem on radio networks in presence of selfish agents 86
Simple dynamics for plurality consensus 85
A Uniform Approach To Define Complexity Classes 83
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks. 83
Complexity Classes and Sparse Oracles 82
A Characterization of the Leaf Language Classes 82
Simple dynamics for Plurality Consensus 82
Divide and Conquer Is Almost Optimal for the Bounded-Hop MST Problem on Random Euclidean Instances 78
Parallel Approximation of Optimization Problems 77
Fast flooding over Manhattan 77
On the bounded-hop MST problem on random Euclidean instances 77
Communication in dynamic radio networks 77
EASILY CHECKED GENERALIZED SELF-REDUCIBILITY 76
Minimum energy broadcast and disk cover in grid wireless networks 76
MANETS: High mobility can make up for low transmission power 75
Distributed broadcast in radio networks of unknown topology 75
The minimum range assignment problem on linear radio networks 74
Helping by Unambiguous Computation and Probabilistic Computation 73
Experimental analysis of simple, distributed vertex coloring algorithms 73
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks. 73
Minimum-Energy Broadcast and disk cover in grid wireless networks 72
Sperner's Lemma and Robust Machines 71
Sperner's Lemma and Robust Machines 71
Polynomial time introreducibility 70
Maximizing the number of broadcast operations in static random geometric ad-hoc networks 70
Distributed community detection in dynamic graphs 70
RELATIVE COMPLEXITY OF EVALUATING THE OPTIMUM COST AND CONSTRUCTING THE OPTIMUM FOR MAXIMIZATION PROBLEMS 69
Flooding Time in edge-Markovian Dynamic Graphs 69
Broadcasting in dynamic radio networks 69
A Worst-Case Analysis of the LZ2 Compression Algorithm 69
Average Measure, Descriptive Complexity and Approximation of Maximization Problems 69
Revisiting a Result of Ko 67
Pseudonyms in cost-sharing games 67
Bounded Size Dictionary Compression: SC^k-completeness and NC Algorithms 67
Flooding time in opportunistic networks under power law and exponential intercontact times 67
Rumor Spreading in Random Evolving Graphs 66
Maximizing the Number of Broadcast Operations in Random Geometric Ad Hoc Wireless Networks 66
Reductions to Sets of Low Information Content 65
Complexity Classes and Sparse Oracles 65
Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms 63
Structure in Approximation Classes 62
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults 62
Reductions to Sets of Low Information Content 61
Modelling mobility: A discrete revolution 60
On Compact Representations of Propositional Circumscription 60
Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-hoc Wireless Networks 59
The Range Assignment Problem in Non-Homogeneous Static Ad-Hoc Networks. 59
Parsimonious Flooding in Geometric Random-Walks 59
The Power Range Assignment Problem in Radio Networks on the Plane 58
An experimental study of simple, distributed vertex colouring algorithms 57
Flooding time of edge-Markovian evolving graphs 57
Optimal gossiping in geometric radio networks in the presence of dynamical faults 57
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks 56
Information spreading in stationary Markovian evolving graphs 56
Opportunistic MANETs: Mobility Can Make Up for Low Transmission Power 56
Distributed Multi-Broadcast in Unknown Radio Networks 56
The helping hierarchy 55
Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems 55
Minimum-energy broadcast in random-grid Ad-Hoc Networks: Approximation and distributed algorithms 55
On computing ad hoc selective families. 55
Rumor spreading in random evolving graphs 54
On the importance of having an identity or, is consensus really universal? 52
The minimum broadcast range assignment problem on linear multi-hop wireless networks 52
On Weighted versus Unweighted Versions of Combinatorial Optimization Problems 50
Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings 50
Easily Checked Self-Reducibility 49
On the importance of having an identity 49
Round Robin is optimal for fault-tolerant broadcasting on wireless networks 48
The General Notion of a Dot-Operator 48
Modelling Mobility: A Discrete Revolution 46
Fast Flooding over Manhattan 45
A Note on the Spatiality Degree of Graphs 45
An Equivalent Version of the Caccetta-Haeggkvist Conjecture in an Online Load Balancing Problem 44
Hardness Results for the Power Range Assignment Problem in Packet Radio Networks 41
The Minimum Range Assignment Problem on Linear Radio Networks 40
A Worst-Case Analysis of Ziv-Lempel Algorithm 35
Information spreading in stationary markovian evolving graphs 35
To Weight or not To Weight: Where is the Question? 31
Experimental analysis of practically efficient algorithms for bounded-hop accumulation in ad-hoe wireless networks 30
Dot Operators 28
Optimization, Average Cost, and Complexity Classes 22
Information spreading in dynamic graphs 21
Selective Families, Superimposed Codes and Broadcasting in Unknown Radio Networks 18
Totale 5.704
Categoria #
all - tutte 15.541
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 133
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 15.674


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020729 0 0 0 0 0 0 176 176 154 115 74 34
2020/2021463 58 74 12 36 9 37 7 58 57 74 36 5
2021/20221.056 3 57 99 18 118 24 103 106 83 82 174 189
2022/2023826 171 133 45 116 130 116 4 29 51 6 17 8
2023/2024289 14 65 13 20 21 38 8 4 0 43 21 42
2024/2025404 43 15 60 29 131 56 70 0 0 0 0 0
Totale 5.704