UniSa - IRIS Institutional Research Information System

VACCARO, Ugo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7.721
EU - Europa 2.431
AS - Asia 1.962
SA - Sud America 239
AF - Africa 15
Continente sconosciuto - Info sul continente non disponibili 6
OC - Oceania 6
Totale 12.380
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.601
IT - Italia 780
SG - Singapore 694
UA - Ucraina 588
CN - Cina 551
RU - Federazione Russa 304
HK - Hong Kong 237
DE - Germania 224
BR - Brasile 220
VN - Vietnam 171
IE - Irlanda 170
TR - Turchia 140
SE - Svezia 139
FI - Finlandia 129
CA - Canada 108
KR - Corea 88
GB - Regno Unito 24
IN - India 20
BD - Bangladesh 11
IL - Israele 11
PL - Polonia 11
NL - Olanda 10
FR - Francia 9
MX - Messico 9
RO - Romania 9
ES - Italia 8
JP - Giappone 8
EU - Europa 6
IQ - Iraq 6
PH - Filippine 6
ZA - Sudafrica 6
AR - Argentina 5
NP - Nepal 5
AT - Austria 4
AU - Australia 4
BE - Belgio 4
PK - Pakistan 4
VE - Venezuela 4
CZ - Repubblica Ceca 3
DK - Danimarca 3
EC - Ecuador 3
MA - Marocco 3
NO - Norvegia 3
SA - Arabia Saudita 3
CO - Colombia 2
HU - Ungheria 2
IR - Iran 2
NZ - Nuova Zelanda 2
OM - Oman 2
PE - Perù 2
TN - Tunisia 2
AZ - Azerbaigian 1
BG - Bulgaria 1
BO - Bolivia 1
BW - Botswana 1
CG - Congo 1
CR - Costa Rica 1
DO - Repubblica Dominicana 1
EG - Egitto 1
GH - Ghana 1
GR - Grecia 1
HR - Croazia 1
KZ - Kazakistan 1
LB - Libano 1
LT - Lituania 1
LU - Lussemburgo 1
MC - Monaco 1
MD - Moldavia 1
PA - Panama 1
PY - Paraguay 1
UY - Uruguay 1
Totale 12.380
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.925
Wilmington 822
Jacksonville 712
Chandler 686
Woodbridge 665
Houston 578
Princeton 504
Hong Kong 235
Singapore 192
Dublin 169
Dong Ket 162
Salerno 158
Ashburn 144
Nanjing 140
Izmir 133
Andover 126
Dearborn 112
Boardman 96
Pellezzano 95
Ottawa 93
Beijing 91
Moscow 81
Mestre 57
Fairfield 50
Hebei 50
Cava 42
Düsseldorf 40
Nanchang 39
Jiaxing 35
Munich 35
Dallas 33
The Dalles 33
Shenyang 30
Columbus 28
Naples 28
Norwalk 28
Changsha 27
Los Angeles 24
Giugliano In Campania 18
San Diego 17
Santa Clara 16
São Paulo 16
Milan 15
Redwood City 15
Seattle 15
Fisciano 14
Tianjin 14
Washington 14
New York 13
Indiana 12
Pune 11
Sorrento 11
Council Bluffs 10
North Bergen 10
San Francisco 10
Guangzhou 9
London 9
Rio de Janeiro 9
Florianópolis 8
Jinan 8
Spinea 8
Angri 7
Atlanta 7
Cambridge 7
Dormagen 7
Warsaw 7
Boston 6
Charlotte 6
Falls Church 6
Haikou 6
Hanover 6
Maletto 6
Renton 6
Rome 6
Stockholm 6
Turku 6
Amsterdam 5
Brescia 5
Brooklyn 5
Chicago 5
Helsinki 5
Mexico City 5
Mountain View 5
Shanghai 5
Tokyo 5
Wuhan 5
Zhengzhou 5
Barcelona 4
Brussels 4
Campinas 4
Campo Grande 4
Edinburgh 4
Johannesburg 4
Melbourne 4
Mercato San Severino 4
Napoli 4
Nola 4
Nuremberg 4
Poggiomarino 4
Rescaldina 4
Totale 8.982
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
ɛ-almost selectors and their applications 165
Partial Covering Arrays: Algorithms and Asymptotics 158
Approximating probability distributions with short vectors, via information theoretic distance measures 152
Spread of Influence in Weighted Networks under Time and Budget Constraints 132
A New Kind of Selectors and Their Applications to Conflict Resolution in Wireless Multichannels Networks 127
Binary Search with Delayed and Missing Answers 126
`Perfectly-Secure Conference Key Distribution 125
A Note on Secret Sharing Schemes 124
Unidirectional Error Detecting Codes 121
Latency-bounded target set selection in social networks 120
Bounding the Average Length of Optimal Source Codes 118
A fastalgorithm for the uniquedecipherability of multivalued encodings 117
Synchronizability of Multivalued Encodings 117
Supermodularity and Subadditivity Properties of the Entropy on the Majorization Lattice 116
Decoders with Initial State Invariance for 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
NEW RESULTS AND APPLICATIONS OF SUPERIMPOSED CODES (AND RELATED COMBINATORIAL STRUCTURES) TO THE DESIGN OF EFFICIENT GROUP TESTING PROCEDURES 112
Improved Algorithms for Chemical Threshold Testing Problems 112
Sperner Capacities 112
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
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 109
Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels 108
A model for communication over noisy channels 108
Communication Complexity of Gossiping by Packets 108
Two Batch Search With Lie Cost 108
Asynchronous deterministic rendezvous in graphs 107
Superselectors: Efficient Constructions and Applications 107
Fault Tolerant Routing in the Star and Pancake Interconnection Networks 107
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 107
Combinatorial Pattern Matching- Proceedings of 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 107
Time Bounds for Broadcasting in Bounded Degree Graphs 105
Concurrent Multicast in Weighted Networks 104
Immutable Codes 104
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 103
Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Mode, 103
ε-almost selectors and their applications to multiple-access communication 103
An Efficient Algorithm for Testing Immutability of Variable Length Codes 102
Efficient Collective Communication in Optical Networks. 100
Asynchronous deterministic rendezvous in graphs 99
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 99
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 99
Optimal Two-Stage Algorithms for Group Testing Problems 98
An Information-Theoretic Treatment of Secret Sharing Schemes 98
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 97
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 97
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
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
Bounding the Average Length of Optimal Source Codes via Majorization Theory 92
Bounds on Entropy in a Guessing Game 92
Perfect, Minimally Adaptive, Error-Correcting Searching Strategies 91
Bounds on the Entropy of a Function of a Random Variable and Their Applications 91
Analysis and comparison of information theory-based distances for genomic strings 91
Spanning Trees with Bounded Number of Branch Vertices 90
Tunstall Parse Trees Optimum under Various Criteria 89
Rota-Metropolis cubic logic and Ulam-Renyi games 88
Fast Gossiping by Short Messages 88
On Searching Strategies, Parallel Questions, and Delayed Answers 87
Concurrent Multicast in Weighted Networks 87
Search Methodologies 87
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks 87
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 86
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
On the approximability and exact algorithms for vector domination and related problems in graphs 86
Influence Diffusion in Social Networks under Time Window Constraints 86
Brief announcement: Active information spread in networks 86
Generalized Framework for Selectors with Applications in Optimal Group Testing 85
Optimal Strategies Against a Liar 84
Spanning spiders and light-splitting switches 84
Optimal Algorithms for Two Group Testing Problems and New Bounds on Generalized Superimposed Codes 84
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems 82
Efficient Communication in Unknown Networks 82
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 82
Efficient Algorithms for Chemical Threshold Testing Problems 81
Partial Covering Arrays: Algorithms and Asymptotics 81
How to go Viral: Cheaply and Quickly 80
Fault-Tolerance Properties of the Star Interconnection Network 78
Efficient Collective Communication in Optical Networks 77
On the Construction of Minimal Broadcast Networks 77
Efficient Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels 76
Efficient Generation of Fair Dice with Few Biased Coins 76
Efficient Communication in Unknown Networks 74
Generalizations of Superimposed Codes with Applications to Efficient Design of Pooling Experiments 74
Improved Algorithms for Chemical Threshold Testing Problems 74
On the Shannon Capacity of Graph Formulæ 74
Secret Sharing Schemes with Veto Capabilities 74
On k-strong conflict-free multicoloring 74
An Improved Heuristic for Ulam-Renyi Game 74
Broadcasting in Hypercubes and Star Graphs with Dynamic Faults 74
Totale 10.094
Salva come PNG Salva come JPEG
Categoria #
all - tutte 40.341
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 40.341
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/20211.115 52 118 119 5 125 43 123 7 145 10 163 205
2021/2022929 2 0 2 16 13 24 15 30 138 129 150 410
2022/20231.588 153 93 18 224 207 349 2 164 261 11 77 29
2023/2024631 88 109 39 19 41 62 35 22 21 47 29 119
2024/20251.984 86 53 34 87 66 202 242 194 179 72 289 480
2025/202668 68 0 0 0 0 0 0 0 0 0 0 0
Totale 12.676