GARGANO, Luisa
 Distribuzione geografica
Continente #
AS - Asia 14.688
NA - Nord America 8.952
EU - Europa 2.402
SA - Sud America 445
AF - Africa 39
OC - Oceania 9
Continente sconosciuto - Info sul continente non disponibili 8
Totale 26.543
Nazione #
HK - Hong Kong 12.450
US - Stati Uniti d'America 8.765
SG - Singapore 965
CN - Cina 716
IT - Italia 651
UA - Ucraina 604
BR - Brasile 396
RU - Federazione Russa 290
DE - Germania 227
VN - Vietnam 195
IE - Irlanda 183
SE - Svezia 159
CA - Canada 145
TR - Turchia 136
FI - Finlandia 132
KR - Corea 105
GB - Regno Unito 45
IN - India 34
MX - Messico 27
PL - Polonia 22
ZA - Sudafrica 16
ES - Italia 15
BD - Bangladesh 14
AT - Austria 13
FR - Francia 12
IL - Israele 11
JP - Giappone 11
AR - Argentina 10
NL - Olanda 9
CO - Colombia 8
IQ - Iraq 8
EC - Ecuador 7
LT - Lituania 7
RO - Romania 6
VE - Venezuela 6
BE - Belgio 5
CZ - Repubblica Ceca 5
EU - Europa 5
ID - Indonesia 5
OM - Oman 5
PE - Perù 5
PK - Pakistan 5
UY - Uruguay 5
DO - Repubblica Dominicana 4
DZ - Algeria 4
NP - Nepal 4
PH - Filippine 4
AU - Australia 3
CH - Svizzera 3
IR - Iran 3
MA - Marocco 3
NZ - Nuova Zelanda 3
PY - Paraguay 3
SA - Arabia Saudita 3
SI - Slovenia 3
UZ - Uzbekistan 3
AZ - Azerbaigian 2
BO - Bolivia 2
BY - Bielorussia 2
CL - Cile 2
ET - Etiopia 2
HN - Honduras 2
KE - Kenya 2
KZ - Kazakistan 2
LB - Libano 2
MD - Moldavia 2
PA - Panama 2
SV - El Salvador 2
TN - Tunisia 2
A1 - Anonimo 1
AF - Afghanistan, Repubblica islamica di 1
BF - Burkina Faso 1
BG - Bulgaria 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BW - Botswana 1
BZ - Belize 1
CG - Congo 1
CR - Costa Rica 1
CU - Cuba 1
CW - ???statistics.table.value.countryCode.CW??? 1
DK - Danimarca 1
EG - Egitto 1
GA - Gabon 1
GR - Grecia 1
GT - Guatemala 1
GY - Guiana 1
HR - Croazia 1
HU - Ungheria 1
IS - Islanda 1
KI - Kiribati 1
ML - Mali 1
NO - Norvegia 1
PW - Palau 1
QA - Qatar 1
SC - Seychelles 1
SN - Senegal 1
SO - Somalia 1
TH - Thailandia 1
TT - Trinidad e Tobago 1
Totale 26.540
Città #
Hong Kong 12.440
Ann Arbor 2.086
Wilmington 815
Woodbridge 801
Jacksonville 740
Chandler 705
Houston 609
Princeton 544
Dallas 444
Singapore 245
Ashburn 237
Dublin 180
Nanjing 164
Dong Ket 134
Andover 127
Dearborn 127
Izmir 118
Beijing 107
Ottawa 106
Pellezzano 99
Boardman 95
Salerno 84
Moscow 73
Los Angeles 55
Mestre 55
Düsseldorf 48
Fairfield 45
Nanchang 43
Shenyang 41
Hebei 39
São Paulo 37
Jiaxing 34
Norwalk 33
New York 32
Munich 30
Changsha 29
Columbus 28
The Dalles 28
Ho Chi Minh City 25
Naples 25
Rome 23
Milan 20
Warsaw 20
Redwood City 19
Santa Clara 19
San Diego 18
San Francisco 18
Washington 17
Brooklyn 16
North Bergen 16
Seattle 16
Cava 15
Chicago 15
Denver 13
Ferrandina 13
London 13
Sorrento 13
Boston 12
Montreal 12
Tianjin 12
Toronto 12
Council Bluffs 11
Jinan 11
Johannesburg 11
Pune 11
Tokyo 11
Ankara 10
Belo Horizonte 10
Florence 10
Hanoi 10
Napoli 10
Stockholm 10
Chennai 9
Mexico City 9
Rio de Janeiro 9
Seoul 9
Cambridge 8
Indiana 8
Vienna 8
Atlanta 7
Haikou 7
Nuremberg 7
Phoenix 7
Sumaré 7
Angri 6
Brasília 6
Curitiba 6
Florianópolis 6
Helsinki 6
Renton 6
Shanghai 6
Amsterdam 5
Giugliano In Campania 5
Monterrey 5
Poplar 5
Rescaldina 5
Salvador 5
Striano 5
Turku 5
Acerra 4
Totale 22.335
Nome #
Groups Burning: Analyzing Spreading Processes in Community-Based Networks 917
On the Capacity of Boolean Graph FormulaeGraphs and Combinatorics, 11 (1995), 29-48, (with ). 883
Asynchronous deterministic rendezvous in graphs 816
Coloring Circular Arcs with Applications 792
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems 697
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width 687
Concurrent Multicast in Weighted Networks 671
Brief announcement: degree optimal deterministic routing for P2P systems 612
Influence Diffusion in Social Networks under Time Window Constraints 591
Unidirectional Error Detecting Codes 559
Improved Algorithms for Chemical Threshold Testing Problems 515
A Note on Secret Sharing Schemes 493
Active influence spreading in social networks 487
How to find a joint probability distribution of minimum entropy (almost) given the marginals 474
Latency-bounded target set selection in social networks 459
Evangelism in social networks: Algorithms and complexity 413
Getting linear time in graphs of bounded neighborhood diversity 362
Sparse and Limited Wavelenght Conversion in Tree Networks 350
A fastalgorithm for the uniquedecipherability of multivalued encodings 304
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 294
A model for communication over noisy channels 292
Synchronizability of Multivalued Encodings 284
Non-uniform deterministic routing on F-Chord(α) 281
An Improved Algorithm for Quantitative Group Testing, vol. 36, (1992), 299-306, (with ) 275
Small Probability Spaces: Qualitative Independence And Beyond 244
Approximating probability distributions with short vectors, via information theoretic distance measures 227
Immutable Codes 225
Different capacities of a digraph 222
Evangelism in social networks 221
Bounds on the Entropy of a Function of a Random Variable and Their Applications 207
Sperner Capacities 206
On k-strong conflict-free multicoloring 194
Degree-Optimal Routing for P2P Systems 179
Proceedings of Fifth International Conference on FUN WITH ALGORITHMS (FUN 2010) 171
Overlay networks with class 170
F-Chord: Improved Uniform Routing on Chord 165
Immunization in the Threshold Model: A Parameterized Complexity Study 162
Decoders with Initial State Invariance for Multivalued Encodings 156
Introduzione alla teoria della computazione 155
Generalized Distance Measures and Error Bounds'', 152
Strong Conflict-Free Coloring for Intervals 152
Fast Collective Communication by Packets in the Postal Model 148
Speeding up networks mining via neighborhood diversity 145
Spread of Influence in Weighted Networks under Time and Budget Constraints 142
Complexity of conflict-free colorings of graphs 140
Efficient Collective Communication in Optical Networks 138
Tunstall Parse Trees Optimum under Various Criteria 138
Efficient Communication in Unknown Networks 137
Improved Algorithms for Chemical Threshold Testing Problems 135
On the Information Rate of Secret Sharing Schemes (Extended Abstract) 135
Communication Complexity of Gossiping by Packets 133
Active Spreading in Networks 149-162 132
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 131
Special Issue on Fun with Algorithms. 130
Concurrent Multicast in Weighted Networks 128
Brief announcement: Active information spread in networks 128
Optimal Detection of a Counterfeit Coin with Multi-Arms Balances 125
Fast and frugal targeting with incentives 125
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 124
An Efficient Algorithm for Testing Immutability of Variable Length Codes 124
On the Construction of Minimal Broadcast Network 124
Capacities: from Information Theory to Extremal Set Theory 123
Strong Conflict-Free Coloring for Intervals 122
Latency-Bounded Target Set Selection in Social Networks 121
Asynchronous deterministic rendezvous in graphs 120
On Searching Strategies, Parallel Questions, and Delayed Answers 120
GENERALIZED DISTANCE MEASURES AND ERROR BOUNDS 120
Information Theoretic Measures of Distances and their Econometric Applications 118
Spider Covers and Their Applications 117
Time Bounds for Broadcasting in Bounded Degree Graphs 115
An Information-Theoretic Treatment of Secret Sharing Schemes 114
Communication Complexity of Fault-Tolerant Information Diffusion 113
Limited Wavelength Conversion in All-Optical Tree Networks 112
Fault Tolerant Routing in the Star and Pancake Interconnection Networks 112
Influence Propagation over Large Scale Social Networks 111
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 111
Efficient Generation of Fair Dice with Few Biased Coins 111
Degree-Optimal Routing for P2P Systems 110
Efficient Collective Communication in Optical Networks. 109
Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Mode, 108
A Note on Submodular Set Cover on Matroids 107
GATHERING WITH MINIMUM COMPLETION TIMEIN SENSOR TREE NETWORKS 107
Spanning spiders and light-splitting switches 106
Optimizing the finger table in Chord-like DHTs 104
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 104
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 103
Gathering with Minimum Delay in Tree Sensor Networks 103
Collision–Free Path Coloring with Application to Minimum–Delay Gathering in Sensor Networks 102
Communication Complexity of Fault-Tolerant Information Diffusion 100
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 100
Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity 100
Coding, Synchronization and Randomization of Source Messages 100
Degree-Optimal Deterministic Routing for P2P Systems 99
Spanning Trees with Bounded Number of Branch Vertices 98
Qualitative Independence and Sperner Problems for Directed Graphs 98
Low-weight superimposed codes and related combinatorial structures: Bounds and applications 97
On Searching Strategies, Parallel Questions, and Delayed Answers 95
On finding small sets that influence large networks 95
Proceedings of 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks 94
Tighter Time Bounds for Fault Tolerant Broadcasting and Gossiping', vol. 22 (1992), 469-486. 94
Totale 22.571
Categoria #
all - tutte 64.592
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 64.592


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021819 0 0 0 0 131 50 132 6 148 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/202613.778 2.178 6.810 4.204 533 53 0 0 0 0 0 0 0
Totale 26.849