UniSa - IRIS Institutional Research Information System

GARGANO, Luisa
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 20.105
AS - Asia 16.348
NA - Nord America 10.834
SA - Sud America 650
Continente sconosciuto - Info sul continente non disponibili 319
AF - Africa 96
OC - Oceania 11
Totale 48.363
Salva come PNG Salva come JPEG
Nazione #
FI - Finlandia 16.817
HK - Hong Kong 12.493
US - Stati Uniti d'America 10.566
SG - Singapore 1.929
IT - Italia 1.345
CN - Cina 851
UA - Ucraina 610
BR - Brasile 486
VN - Vietnam 455
RU - Federazione Russa 301
DE - Germania 265
FR - Francia 195
IE - Irlanda 189
CA - Canada 180
SE - Svezia 162
TR - Turchia 144
KR - Corea 131
IN - India 74
GB - Regno Unito 64
BD - Bangladesh 59
AR - Argentina 49
MX - Messico 42
JP - Giappone 32
ZA - Sudafrica 30
ES - Italia 29
IQ - Iraq 29
PL - Polonia 29
CO - Colombia 27
VE - Venezuela 27
PK - Pakistan 20
PH - Filippine 19
AT - Austria 17
EC - Ecuador 17
NL - Olanda 15
ID - Indonesia 13
IL - Israele 12
PY - Paraguay 12
PE - Perù 11
JO - Giordania 10
MA - Marocco 10
MY - Malesia 10
TN - Tunisia 10
CR - Costa Rica 9
DZ - Algeria 9
EG - Egitto 9
HN - Honduras 9
SA - Arabia Saudita 9
UY - Uruguay 9
UZ - Uzbekistan 9
BE - Belgio 8
LT - Lituania 8
RO - Romania 8
OM - Oman 7
CL - Cile 6
NP - Nepal 6
AU - Australia 5
BO - Bolivia 5
CZ - Repubblica Ceca 5
ET - Etiopia 5
EU - Europa 5
KE - Kenya 5
LB - Libano 5
AL - Albania 4
AZ - Azerbaigian 4
DO - Repubblica Dominicana 4
GR - Grecia 4
GT - Guatemala 4
JM - Giamaica 4
PT - Portogallo 4
SI - Slovenia 4
SV - El Salvador 4
BH - Bahrain 3
BY - Bielorussia 3
CH - Svizzera 3
IR - Iran 3
MT - Malta 3
NZ - Nuova Zelanda 3
SC - Seychelles 3
TT - Trinidad e Tobago 3
AE - Emirati Arabi Uniti 2
BG - Bulgaria 2
BN - Brunei Darussalam 2
HR - Croazia 2
KZ - Kazakistan 2
MD - Moldavia 2
MN - Mongolia 2
NI - Nicaragua 2
NO - Norvegia 2
PA - Panama 2
PS - Palestinian Territory 2
SN - Senegal 2
TH - Thailandia 2
TW - Taiwan 2
A1 - Anonimo 1
AF - Afghanistan, Repubblica islamica di 1
AM - Armenia 1
AO - Angola 1
BF - Burkina Faso 1
BW - Botswana 1
BZ - Belize 1
Totale 48.022
Salva come PNG Salva come JPEG
Città #
Helsinki 16.690
Hong Kong 12.482
Ann Arbor 2.086
Singapore 831
Wilmington 815
Woodbridge 802
Jacksonville 743
Chandler 705
San Jose 677
Houston 618
Princeton 544
Dallas 453
Ashburn 433
Milan 424
Council Bluffs 220
Dublin 186
Nanjing 164
The Dalles 152
Lauterbourg 151
Beijing 137
Rome 137
Dong Ket 134
Andover 127
Dearborn 127
Izmir 119
Ho Chi Minh City 118
Ottawa 107
Pellezzano 99
Boardman 96
Salerno 86
Los Angeles 82
Moscow 73
Hanoi 70
Santa Clara 60
New York 59
Mestre 55
Düsseldorf 48
São Paulo 47
Fairfield 45
Nanchang 43
Shenyang 41
Hebei 39
Naples 38
Figino 37
Jiaxing 34
Norwalk 33
Tokyo 31
Munich 30
Changsha 29
Columbus 29
Chicago 28
Frankfurt am Main 26
Memphis 26
San Francisco 25
Warsaw 25
Turin 23
Montreal 22
Washington 21
Brooklyn 20
Johannesburg 19
London 19
Redwood City 19
Denver 18
San Diego 18
Toronto 18
Mexico City 17
Seattle 17
Da Nang 16
Haiphong 16
North Bergen 16
Cava 15
Phoenix 15
Caracas 14
Orem 14
Ferrandina 13
Florence 13
Sorrento 13
Atlanta 12
Belo Horizonte 12
Boston 12
Chennai 12
Stockholm 12
Tianjin 12
Baghdad 11
Jinan 11
Pune 11
Rio de Janeiro 11
Amsterdam 10
Ankara 10
Napoli 10
Seoul 10
Bogotá 9
Buffalo 9
Erbil 9
Las Vegas 9
Nuremberg 9
Shanghai 9
Tashkent 9
Vienna 9
Asunción 8
Totale 42.128
Salva come PNG Salva come JPEG
Nome #
Coloring Circular Arcs with Applications 2.681
Sparse and Limited Wavelenght Conversion in Tree Networks 2.244
Fast Collective Communication by Packets in the Postal Model 2.022
Limited Wavelength Conversion in All-Optical Tree Networks 1.998
Spanning spiders and light-splitting switches 1.987
Communication Complexity of Fault-Tolerant Information Diffusion 1.984
Efficient Communication in Unknown Networks 1.965
Optimal Sequential Gossiping by Short Messages 1.950
Colouring All Directed Paths in a Symmetric Tree with an Application to Optical Networks 1.943
Groups Burning: Analyzing Spreading Processes in Community-Based Networks 944
On the Capacity of Boolean Graph FormulaeGraphs and Combinatorics, 11 (1995), 29-48, (with ). 902
Asynchronous deterministic rendezvous in graphs 865
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems 727
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width 726
Concurrent Multicast in Weighted Networks 703
Brief announcement: degree optimal deterministic routing for P2P systems 658
Influence Diffusion in Social Networks under Time Window Constraints 617
Unidirectional Error Detecting Codes 572
Improved Algorithms for Chemical Threshold Testing Problems 540
A Note on Secret Sharing Schemes 535
Active influence spreading in social networks 521
How to find a joint probability distribution of minimum entropy (almost) given the marginals 508
Latency-bounded target set selection in social networks 505
Evangelism in social networks: Algorithms and complexity 444
Getting linear time in graphs of bounded neighborhood diversity 391
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 338
A fastalgorithm for the uniquedecipherability of multivalued encodings 337
A model for communication over noisy channels 329
Non-uniform deterministic routing on F-Chord(α) 317
Synchronizability of Multivalued Encodings 317
An Improved Algorithm for Quantitative Group Testing, vol. 36, (1992), 299-306, (with ) 297
Small Probability Spaces: Qualitative Independence And Beyond 277
Approximating probability distributions with short vectors, via information theoretic distance measures 261
Different capacities of a digraph 256
Evangelism in social networks 247
Bounds on the Entropy of a Function of a Random Variable and Their Applications 246
Immutable Codes 244
Degree-Optimal Routing for P2P Systems 239
Sperner Capacities 232
On k-strong conflict-free multicoloring 228
Overlay networks with class 223
F-Chord: Improved Uniform Routing on Chord 202
Proceedings of Fifth International Conference on FUN WITH ALGORITHMS (FUN 2010) 188
Introduzione alla teoria della computazione 187
Immunization in the Threshold Model: A Parameterized Complexity Study 186
Strong Conflict-Free Coloring for Intervals 179
Decoders with Initial State Invariance for Multivalued Encodings 177
Generalized Distance Measures and Error Bounds'', 173
Efficient Collective Communication in Optical Networks 170
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 170
Spread of Influence in Weighted Networks under Time and Budget Constraints 168
Communication Complexity of Gossiping by Packets 168
Brief announcement: Active information spread in networks 167
Tunstall Parse Trees Optimum under Various Criteria 166
Active Spreading in Networks 149-162 166
Speeding up networks mining via neighborhood diversity 165
Complexity of conflict-free colorings of graphs 163
Improved Algorithms for Chemical Threshold Testing Problems 162
On the Information Rate of Secret Sharing Schemes (Extended Abstract) 162
Fast and frugal targeting with incentives 162
Efficient Communication in Unknown Networks 160
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 159
An Information-Theoretic Treatment of Secret Sharing Schemes 158
Influence Propagation over Large Scale Social Networks 157
Special Issue on Fun with Algorithms. 156
Capacities: from Information Theory to Extremal Set Theory 155
Concurrent Multicast in Weighted Networks 153
Degree-Optimal Routing for P2P Systems 150
An Efficient Algorithm for Testing Immutability of Variable Length Codes 150
GENERALIZED DISTANCE MEASURES AND ERROR BOUNDS 149
On the Construction of Minimal Broadcast Network 148
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 148
On Searching Strategies, Parallel Questions, and Delayed Answers 146
A Note on Submodular Set Cover on Matroids 146
Optimal Detection of a Counterfeit Coin with Multi-Arms Balances 146
Asynchronous deterministic rendezvous in graphs 145
Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Mode, 145
Latency-Bounded Target Set Selection in Social Networks 145
Collision–Free Path Coloring with Application to Minimum–Delay Gathering in Sensor Networks 144
Information Theoretic Measures of Distances and their Econometric Applications 144
Spider Covers and Their Applications 143
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 143
Gathering with Minimum Delay in Tree Sensor Networks 142
Communication Complexity of Fault-Tolerant Information Diffusion 141
Efficient Collective Communication in Optical Networks. 140
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 138
Strong Conflict-Free Coloring for Intervals 138
Fault Tolerant Routing in the Star and Pancake Interconnection Networks 136
Time Bounds for Broadcasting in Bounded Degree Graphs 135
Efficient Algorithms for Chemical Threshold Testing Problems 133
Optimizing the finger table in Chord-like DHTs 130
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 129
Efficient Generation of Fair Dice with Few Biased Coins 129
Threshold-bounded dominating set with incentives 129
Spanning Trees with Bounded Number of Branch Vertices 128
GATHERING WITH MINIMUM COMPLETION TIMEIN SENSOR TREE NETWORKS 128
Low-weight superimposed codes and related combinatorial structures: Bounds and applications 128
Qualitative Independence and Sperner Problems for Directed Graphs 126
Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity 125
There are Spanning Spiders in Dense Graphs (and we know how to find them) 121
Totale 42.267
Salva come PNG Salva come JPEG
Categoria #
all - tutte 94.108
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 94.108
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/202634.871 2.178 6.810 4.204 533 679 404 1.160 218 17.020 785 156 724
2026/2027421 271 150 0 0 0 0 0 0 0 0 0 0
Totale 48.363