GARGANO, Luisa
 Distribuzione geografica
Continente #
NA - Nord America 8.027
EU - Europa 2.240
AS - Asia 1.521
SA - Sud America 209
AF - Africa 12
Continente sconosciuto - Info sul continente non disponibili 6
OC - Oceania 6
Totale 12.021
Nazione #
US - Stati Uniti d'America 7.900
IT - Italia 623
UA - Ucraina 600
CN - Cina 586
SG - Singapore 515
RU - Federazione Russa 283
DE - Germania 202
BR - Brasile 193
IE - Irlanda 183
SE - Svezia 151
VN - Vietnam 135
FI - Finlandia 127
TR - Turchia 125
CA - Canada 113
KR - Corea 90
GB - Regno Unito 19
HK - Hong Kong 14
IN - India 13
FR - Francia 11
AT - Austria 9
IL - Israele 8
MX - Messico 8
BD - Bangladesh 5
CZ - Repubblica Ceca 5
EU - Europa 5
IQ - Iraq 5
NL - Olanda 5
RO - Romania 5
ES - Italia 4
JP - Giappone 4
PH - Filippine 4
AU - Australia 3
BE - Belgio 3
EC - Ecuador 3
NP - Nepal 3
NZ - Nuova Zelanda 3
OM - Oman 3
PK - Pakistan 3
PL - Polonia 3
VE - Venezuela 3
AR - Argentina 2
AZ - Azerbaigian 2
BO - Bolivia 2
CO - Colombia 2
DO - Repubblica Dominicana 2
DZ - Algeria 2
PE - Perù 2
ZA - Sudafrica 2
A1 - Anonimo 1
BG - Bulgaria 1
BN - Brunei Darussalam 1
BW - Botswana 1
BY - Bielorussia 1
CG - Congo 1
CL - Cile 1
CR - Costa Rica 1
DK - Danimarca 1
EG - Egitto 1
GR - Grecia 1
HN - Honduras 1
HR - Croazia 1
HU - Ungheria 1
KE - Kenya 1
KZ - Kazakistan 1
LB - Libano 1
MA - Marocco 1
MD - Moldavia 1
ML - Mali 1
PA - Panama 1
QA - Qatar 1
SA - Arabia Saudita 1
SC - Seychelles 1
SV - El Salvador 1
TN - Tunisia 1
UY - Uruguay 1
UZ - Uzbekistan 1
Totale 12.021
Città #
Ann Arbor 2.086
Wilmington 815
Woodbridge 801
Jacksonville 740
Chandler 705
Houston 604
Princeton 544
Dublin 180
Singapore 177
Ashburn 171
Nanjing 164
Dong Ket 134
Andover 127
Dearborn 127
Izmir 118
Ottawa 106
Pellezzano 99
Boardman 95
Beijing 89
Salerno 84
Moscow 73
Mestre 55
Düsseldorf 48
Fairfield 45
Nanchang 43
Shenyang 41
Hebei 39
Jiaxing 34
Norwalk 33
Changsha 29
Dallas 27
Los Angeles 20
Naples 20
Milan 19
Redwood City 19
Rome 19
San Diego 18
Washington 17
North Bergen 16
Cava 15
São Paulo 15
Ferrandina 13
Hong Kong 13
Sorrento 13
Tianjin 12
Jinan 11
Pune 11
Santa Clara 11
The Dalles 11
Napoli 10
Council Bluffs 9
Seattle 9
Cambridge 8
Indiana 8
London 8
Munich 8
New York 8
Haikou 7
Angri 6
Helsinki 6
Nuremberg 6
Renton 6
Shanghai 6
Vienna 6
Florianópolis 5
Giugliano In Campania 5
Rescaldina 5
Rio de Janeiro 5
Striano 5
Acerra 4
Belo Horizonte 4
Curitiba 4
Dormagen 4
Edinburgh 4
Guangzhou 4
Hanover 4
Prineville 4
Ribeirão das Neves 4
San Francisco 4
Spinea 4
Springfield 4
Tokyo 4
Toronto 4
Zhengzhou 4
Barcelona 3
Berlin 3
Brasília 3
Brno 3
Brussels 3
Castrolibero 3
Chicago 3
Fuzhou 3
Goiânia 3
Hangzhou 3
Hefei 3
Kunming 3
Lamézia 3
Lanzhou 3
Lappeenranta 3
Mexico City 3
Totale 8.950
Nome #
Evangelism in social networks 179
Approximating probability distributions with short vectors, via information theoretic distance measures 141
Introduzione alla teoria della computazione 139
Spread of Influence in Weighted Networks under Time and Budget Constraints 127
Overlay networks with class 119
Active Spreading in Networks 149-162 119
A Note on Secret Sharing Schemes 118
Complexity of conflict-free colorings of graphs 118
Unidirectional Error Detecting Codes 116
F-Chord: Improved Uniform Routing on Chord 115
Special Issue on Fun with Algorithms. 114
Synchronizability of Multivalued Encodings 114
Latency-bounded target set selection in social networks 114
Latency-Bounded Target Set Selection in Social Networks 111
Influence Diffusion in Social Networks under Time Window Constraints 111
An Improved Algorithm for Quantitative Group Testing, vol. 36, (1992), 299-306, (with ) 111
Information Theoretic Measures of Distances and their Econometric Applications 110
Different capacities of a digraph 110
Decoders with Initial State Invariance for Multivalued Encodings 109
GENERALIZED DISTANCE MEASURES AND ERROR BOUNDS 109
Sperner Capacities 108
A fastalgorithm for the uniquedecipherability of multivalued encodings 108
Improved Algorithms for Chemical Threshold Testing Problems 107
Spider Covers and Their Applications 107
Optimal Detection of a Counterfeit Coin with Multi-Arms Balances 106
Communication Complexity of Gossiping by Packets 105
Fault Tolerant Routing in the Star and Pancake Interconnection Networks 104
Asynchronous deterministic rendezvous in graphs 103
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 103
Time Bounds for Broadcasting in Bounded Degree Graphs 102
A model for communication over noisy channels 102
Concurrent Multicast in Weighted Networks 101
Coloring Circular Arcs with Applications 99
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 99
Immutable Codes 99
Strong Conflict-Free Coloring for Intervals 99
Asynchronous deterministic rendezvous in graphs 97
Efficient Collective Communication in Optical Networks. 97
Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Mode, 97
Limited Wavelength Conversion in All-Optical Tree Networks 96
Communication Complexity of Fault-Tolerant Information Diffusion 96
Degree-Optimal Routing for P2P Systems 95
Strong Conflict-Free Coloring for Intervals 95
Non-uniform deterministic routing on F-Chord(α) 94
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 94
Influence Propagation over Large Scale Social Networks 93
Brief announcement: degree optimal deterministic routing for P2P systems 93
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 93
Degree-Optimal Deterministic Routing for P2P Systems 92
Capacities: from Information Theory to Extremal Set Theory 92
Gathering with Minimum Delay in Tree Sensor Networks 92
An Efficient Algorithm for Testing Immutability of Variable Length Codes 91
Small Probability Spaces: Qualitative Independence And Beyond 91
Coding, Synchronization and Randomization of Source Messages 91
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 91
Degree-Optimal Routing for P2P Systems 90
Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity 90
Generalized Distance Measures and Error Bounds'', 90
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 89
An Information-Theoretic Treatment of Secret Sharing Schemes 89
Qualitative Independence and Sperner Problems for Directed Graphs 89
Proceedings of 3rd International Workshop on Approximation and Randomized Algorithms in Communication Networks 88
Tighter Time Bounds for Fault Tolerant Broadcasting and Gossiping', vol. 22 (1992), 469-486. 88
Spanning Trees with Bounded Number of Branch Vertices 87
Collision–Free Path Coloring with Application to Minimum–Delay Gathering in Sensor Networks 87
Fast Gossiping by Short Messages 87
On finding small sets that influence large networks 86
Tunstall Parse Trees Optimum under Various Criteria 85
Influence Diffusion in Social Networks under Time Window Constraints 85
On Searching Strategies, Parallel Questions, and Delayed Answers 84
A Note on Submodular Set Cover on Matroids 84
Concurrent Multicast in Weighted Networks 83
Bounds on the Entropy of a Function of a Random Variable and Their Applications 83
On the Information Rate of Secret Sharing Schemes (Extended Abstract) 82
On the Capacity of Boolean Graph FormulaeGraphs and Combinatorics, 11 (1995), 29-48, (with ). 82
Threshold-bounded dominating set with incentives 82
GATHERING WITH MINIMUM COMPLETION TIMEIN SENSOR TREE NETWORKS 81
Brief announcement: Active information spread in networks 80
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems 79
Spanning spiders and light-splitting switches 79
Communication Complexity of Fault-Tolerant Information Diffusion 79
Sparse and Limited Wavelength Conversion in Tree Networks 79
Optimizing the finger table in Chord-like DHTs 79
How to go Viral: Cheaply and Quickly 78
Proceedings of Fifth International Conference on FUN WITH ALGORITHMS (FUN 2010) 77
Multicasting in Optical Networks 77
Active influence spreading in social networks 77
Efficient Algorithms for Chemical Threshold Testing Problems 76
Minimum Weight Dynamo and Fast Opinion Spreading 76
Space-optimal proportion consensus with population protocols 75
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 75
Efficient Collective Communication in Optical Networks 74
Time Optimal Gathering in Sensor Networks 74
On the Construction of Minimal Broadcast Networks 74
Reliable Broadcasting 74
Efficient Communication in Unknown Networks 73
Fault-Tolerance Properties of the Star Interconnection Network 73
On the Shannon Capacity of Graph Formulæ 73
Optimal Sequential Gossiping by Short Messages 72
There are Spanning Spiders in Dense Graphs (and we know how to find them) 72
Totale 9.472
Categoria #
all - tutte 39.397
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 39.397


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020241 0 0 0 0 0 0 0 0 0 0 183 58
2020/20211.117 53 119 121 5 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/20251.320 94 58 37 105 64 225 238 212 194 87 6 0
Totale 12.324