UniSa - IRIS Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021945 0 0 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/20252.067 94 58 37 105 64 225 238 212 194 87 279 474
2025/202612.466 2.178 6.810 3.478 0 0 0 0 0 0 0 0 0
Totale 25.537