UniSa - IRIS Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
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/20252.067 94 58 37 105 64 225 238 212 194 87 279 474
2025/202662 62 0 0 0 0 0 0 0 0 0 0 0
Totale 13.133