GARGANO, Luisa
 Distribuzione geografica
Continente #
EU - Europa 19.414
AS - Asia 16.247
NA - Nord America 10.255
SA - Sud America 635
AF - Africa 94
OC - Oceania 11
Continente sconosciuto - Info sul continente non disponibili 8
Totale 46.664
Nazione #
FI - Finlandia 16.817
HK - Hong Kong 12.468
US - Stati Uniti d'America 10.037
SG - Singapore 1.894
CN - Cina 818
IT - Italia 673
UA - Ucraina 608
BR - Brasile 479
VN - Vietnam 455
RU - Federazione Russa 301
DE - Germania 263
FR - Francia 191
IE - Irlanda 189
SE - Svezia 162
CA - Canada 157
TR - Turchia 144
KR - Corea 130
IN - India 74
GB - Regno Unito 64
BD - Bangladesh 56
AR - Argentina 44
MX - Messico 36
JP - Giappone 31
ZA - Sudafrica 30
IQ - Iraq 29
PL - Polonia 27
CO - Colombia 26
VE - Venezuela 26
ES - Italia 24
PK - Pakistan 20
PH - Filippine 19
AT - Austria 17
EC - Ecuador 17
NL - Olanda 15
ID - Indonesia 13
IL - Israele 12
PY - Paraguay 12
JO - Giordania 10
MA - Marocco 10
PE - Perù 10
TN - Tunisia 10
DZ - Algeria 9
EG - Egitto 9
MY - Malesia 9
SA - Arabia Saudita 9
UY - Uruguay 9
UZ - Uzbekistan 9
LT - Lituania 8
RO - Romania 8
BE - Belgio 7
OM - Oman 7
CL - Cile 6
CR - Costa Rica 6
NP - Nepal 6
AU - Australia 5
BO - Bolivia 5
CZ - Repubblica Ceca 5
ET - Etiopia 5
EU - Europa 5
HN - Honduras 5
KE - Kenya 5
LB - Libano 5
AL - Albania 4
AZ - Azerbaigian 4
DO - Repubblica Dominicana 4
PT - Portogallo 4
SI - Slovenia 4
BH - Bahrain 3
BY - Bielorussia 3
CH - Svizzera 3
GR - Grecia 3
IR - Iran 3
MT - Malta 3
NZ - Nuova Zelanda 3
AE - Emirati Arabi Uniti 2
BN - Brunei Darussalam 2
HR - Croazia 2
KZ - Kazakistan 2
MD - Moldavia 2
MN - Mongolia 2
PA - Panama 2
PS - Palestinian Territory 2
SN - Senegal 2
SV - El Salvador 2
TH - Thailandia 2
A1 - Anonimo 1
AF - Afghanistan, Repubblica islamica di 1
AM - Armenia 1
AO - Angola 1
BF - Burkina Faso 1
BG - Bulgaria 1
BW - Botswana 1
BZ - Belize 1
CG - Congo 1
CI - Costa d'Avorio 1
CU - Cuba 1
CW - ???statistics.table.value.countryCode.CW??? 1
DK - Danimarca 1
GA - Gabon 1
GT - Guatemala 1
Totale 46.638
Città #
Helsinki 16.690
Hong Kong 12.457
Ann Arbor 2.086
Wilmington 815
Singapore 814
Woodbridge 801
Jacksonville 742
Chandler 705
Houston 612
San Jose 577
Princeton 544
Dallas 446
Ashburn 402
Dublin 186
Council Bluffs 180
Nanjing 164
The Dalles 152
Lauterbourg 151
Dong Ket 134
Andover 127
Dearborn 127
Izmir 119
Ho Chi Minh City 118
Beijing 112
Ottawa 106
Pellezzano 99
Boardman 96
Salerno 84
Los Angeles 75
Moscow 73
Hanoi 70
Mestre 55
New York 49
Düsseldorf 48
Fairfield 45
São Paulo 44
Nanchang 43
Shenyang 41
Hebei 39
Santa Clara 35
Jiaxing 34
Norwalk 33
Naples 31
Tokyo 31
Munich 30
Changsha 29
Columbus 29
Frankfurt am Main 26
Warsaw 24
Rome 23
Chicago 21
Milan 21
Montreal 20
Johannesburg 19
London 19
Redwood City 19
Brooklyn 18
San Diego 18
San Francisco 18
Washington 18
Denver 17
Da Nang 16
Haiphong 16
North Bergen 16
Seattle 16
Cava 15
Caracas 13
Ferrandina 13
Orem 13
Sorrento 13
Toronto 13
Belo Horizonte 12
Boston 12
Chennai 12
Mexico City 12
Stockholm 12
Tianjin 12
Baghdad 11
Florence 11
Jinan 11
Pune 11
Rio de Janeiro 11
Amsterdam 10
Ankara 10
Napoli 10
Phoenix 10
Bogotá 9
Erbil 9
Nuremberg 9
Seoul 9
Tashkent 9
Vienna 9
Asunción 8
Atlanta 8
Buffalo 8
Cambridge 8
City of London 8
Curitiba 8
Dhaka 8
Indiana 8
Totale 41.190
Nome #
Coloring Circular Arcs with Applications 2.669
Sparse and Limited Wavelenght Conversion in Tree Networks 2.226
Fast Collective Communication by Packets in the Postal Model 2.019
Limited Wavelength Conversion in All-Optical Tree Networks 1.986
Spanning spiders and light-splitting switches 1.977
Communication Complexity of Fault-Tolerant Information Diffusion 1.975
Efficient Communication in Unknown Networks 1.957
Optimal Sequential Gossiping by Short Messages 1.940
Colouring All Directed Paths in a Symmetric Tree with an Application to Optical Networks 1.939
Groups Burning: Analyzing Spreading Processes in Community-Based Networks 937
On the Capacity of Boolean Graph FormulaeGraphs and Combinatorics, 11 (1995), 29-48, (with ). 898
Asynchronous deterministic rendezvous in graphs 857
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems 717
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width 714
Concurrent Multicast in Weighted Networks 695
Brief announcement: degree optimal deterministic routing for P2P systems 646
Influence Diffusion in Social Networks under Time Window Constraints 613
Unidirectional Error Detecting Codes 572
Improved Algorithms for Chemical Threshold Testing Problems 533
A Note on Secret Sharing Schemes 520
Active influence spreading in social networks 511
How to find a joint probability distribution of minimum entropy (almost) given the marginals 494
Latency-bounded target set selection in social networks 482
Evangelism in social networks: Algorithms and complexity 434
Getting linear time in graphs of bounded neighborhood diversity 376
A fastalgorithm for the uniquedecipherability of multivalued encodings 330
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 327
A model for communication over noisy channels 319
Non-uniform deterministic routing on F-Chord(α) 307
Synchronizability of Multivalued Encodings 305
An Improved Algorithm for Quantitative Group Testing, vol. 36, (1992), 299-306, (with ) 296
Small Probability Spaces: Qualitative Independence And Beyond 269
Approximating probability distributions with short vectors, via information theoretic distance measures 257
Evangelism in social networks 244
Immutable Codes 241
Bounds on the Entropy of a Function of a Random Variable and Their Applications 241
Different capacities of a digraph 240
Sperner Capacities 229
Degree-Optimal Routing for P2P Systems 226
On k-strong conflict-free multicoloring 217
Overlay networks with class 206
F-Chord: Improved Uniform Routing on Chord 196
Proceedings of Fifth International Conference on FUN WITH ALGORITHMS (FUN 2010) 183
Immunization in the Threshold Model: A Parameterized Complexity Study 182
Introduzione alla teoria della computazione 176
Decoders with Initial State Invariance for Multivalued Encodings 173
Strong Conflict-Free Coloring for Intervals 168
Generalized Distance Measures and Error Bounds'', 167
Brief announcement: Active information spread in networks 162
Speeding up networks mining via neighborhood diversity 161
Efficient Collective Communication in Optical Networks 160
Spread of Influence in Weighted Networks under Time and Budget Constraints 159
Communication Complexity of Gossiping by Packets 159
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 159
On the Information Rate of Secret Sharing Schemes (Extended Abstract) 158
Active Spreading in Networks 149-162 158
Complexity of conflict-free colorings of graphs 157
Efficient Communication in Unknown Networks 155
Improved Algorithms for Chemical Threshold Testing Problems 155
Fast and frugal targeting with incentives 155
Tunstall Parse Trees Optimum under Various Criteria 153
Concurrent Multicast in Weighted Networks 150
Capacities: from Information Theory to Extremal Set Theory 149
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 147
Special Issue on Fun with Algorithms. 146
An Efficient Algorithm for Testing Immutability of Variable Length Codes 146
Influence Propagation over Large Scale Social Networks 145
An Information-Theoretic Treatment of Secret Sharing Schemes 145
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 143
On the Construction of Minimal Broadcast Network 142
GENERALIZED DISTANCE MEASURES AND ERROR BOUNDS 142
Asynchronous deterministic rendezvous in graphs 141
Spider Covers and Their Applications 141
Optimal Detection of a Counterfeit Coin with Multi-Arms Balances 139
Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Mode, 139
A Note on Submodular Set Cover on Matroids 138
Degree-Optimal Routing for P2P Systems 138
Communication Complexity of Fault-Tolerant Information Diffusion 137
Latency-Bounded Target Set Selection in Social Networks 137
On Searching Strategies, Parallel Questions, and Delayed Answers 136
Strong Conflict-Free Coloring for Intervals 136
Collision–Free Path Coloring with Application to Minimum–Delay Gathering in Sensor Networks 135
Information Theoretic Measures of Distances and their Econometric Applications 133
Efficient Collective Communication in Optical Networks. 132
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 132
Fault Tolerant Routing in the Star and Pancake Interconnection Networks 131
Time Bounds for Broadcasting in Bounded Degree Graphs 130
Gathering with Minimum Delay in Tree Sensor Networks 129
Efficient Generation of Fair Dice with Few Biased Coins 127
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 124
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 123
Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity 121
Optimizing the finger table in Chord-like DHTs 121
GATHERING WITH MINIMUM COMPLETION TIMEIN SENSOR TREE NETWORKS 120
Qualitative Independence and Sperner Problems for Directed Graphs 119
Threshold-bounded dominating set with incentives 119
Efficient Algorithms for Chemical Threshold Testing Problems 117
Spanning Trees with Bounded Number of Branch Vertices 115
Tighter Time Bounds for Fault Tolerant Broadcasting and Gossiping', vol. 22 (1992), 469-486. 115
Coding, Synchronization and Randomization of Source Messages 114
Totale 41.431
Categoria #
all - tutte 87.509
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 87.509


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021352 0 0 0 0 0 0 0 0 0 8 165 179
2021/2022984 0 0 2 11 14 20 15 19 137 140 189 437
2022/20231.626 157 96 14 229 208 362 0 171 279 5 78 27
2023/2024641 68 115 45 19 48 87 38 22 21 36 21 121
2024/20252.067 94 58 37 105 64 225 238 212 194 87 279 474
2025/202633.900 2.178 6.810 4.204 533 679 404 1.160 218 17.020 694 0 0
Totale 46.971