UniSa - IRIS Institutional Research Information System

VACCARO, Ugo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7.532
EU - Europa 2.353
AS - Asia 1.471
SA - Sud America 177
AF - Africa 9
Continente sconosciuto - Info sul continente non disponibili 6
OC - Oceania 6
Totale 11.554
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.427
IT - Italia 773
UA - Ucraina 586
CN - Cina 544
SG - Singapore 468
RU - Federazione Russa 302
DE - Germania 189
IE - Irlanda 170
VN - Vietnam 163
BR - Brasile 162
TR - Turchia 140
SE - Svezia 136
FI - Finlandia 123
CA - Canada 98
KR - Corea 82
HK - Hong Kong 17
GB - Regno Unito 13
IN - India 12
NL - Olanda 10
FR - Francia 9
IL - Israele 9
RO - Romania 9
JP - Giappone 7
BD - Bangladesh 6
ES - Italia 6
EU - Europa 6
PH - Filippine 6
PL - Polonia 5
AU - Australia 4
BE - Belgio 4
IQ - Iraq 4
MX - Messico 4
AR - Argentina 3
DK - Danimarca 3
EC - Ecuador 3
MA - Marocco 3
NO - Norvegia 3
NP - Nepal 3
PK - Pakistan 3
VE - Venezuela 3
AT - Austria 2
CO - Colombia 2
CZ - Repubblica Ceca 2
HU - Ungheria 2
IR - Iran 2
NZ - Nuova Zelanda 2
OM - Oman 2
PE - Perù 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
LB - Libano 1
LU - Lussemburgo 1
MC - Monaco 1
MD - Moldavia 1
PA - Panama 1
SA - Arabia Saudita 1
TN - Tunisia 1
UY - Uruguay 1
ZA - Sudafrica 1
Totale 11.554
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.925
Wilmington 822
Jacksonville 711
Chandler 686
Woodbridge 665
Houston 577
Princeton 504
Singapore 177
Dublin 169
Dong Ket 162
Salerno 157
Nanjing 140
Ashburn 139
Izmir 133
Andover 126
Dearborn 112
Boardman 96
Pellezzano 95
Ottawa 93
Beijing 85
Moscow 81
Mestre 57
Fairfield 50
Hebei 50
Cava 42
Düsseldorf 40
Nanchang 39
Jiaxing 35
Shenyang 30
Norwalk 28
Changsha 27
Naples 26
Dallas 24
Giugliano In Campania 18
Los Angeles 18
San Diego 17
The Dalles 17
Hong Kong 15
Milan 15
Redwood City 15
Fisciano 14
Tianjin 14
Washington 14
São Paulo 13
Indiana 12
Santa Clara 12
Pune 11
Seattle 11
Sorrento 11
Council Bluffs 10
North Bergen 10
Guangzhou 9
Florianópolis 8
Jinan 8
Spinea 8
Angri 7
Cambridge 7
Dormagen 7
Falls Church 6
Haikou 6
Hanover 6
London 6
Maletto 6
New York 6
Renton 6
Rio de Janeiro 6
Amsterdam 5
Brescia 5
Helsinki 5
Mountain View 5
Rome 5
Shanghai 5
Wuhan 5
Zhengzhou 5
Barcelona 4
Brussels 4
Campo Grande 4
Edinburgh 4
Melbourne 4
Mercato San Severino 4
Napoli 4
Nola 4
Poggiomarino 4
Rescaldina 4
Ribeirão das Neves 4
Sarno 4
Tokyo 4
Venice 4
Belo Horizonte 3
Cagliari 3
Caivano 3
Campinas 3
Casalnuovo di Napoli 3
Chicago 3
Fuzhou 3
Goiânia 3
Gravina in Puglia 3
Hoogvliet 3
Lanzhou 3
Mexico City 3
Totale 8.584
Salva come PNG Salva come JPEG
Nome #
Evangelism in social networks 179
ɛ-almost selectors and their applications 160
Partial Covering Arrays: Algorithms and Asymptotics 155
Approximating probability distributions with short vectors, via information theoretic distance measures 141
Spread of Influence in Weighted Networks under Time and Budget Constraints 127
Binary Search with Delayed and Missing Answers 120
A Note on Secret Sharing Schemes 118
`Perfectly-Secure Conference Key Distribution 116
Unidirectional Error Detecting Codes 116
A New Kind of Selectors and Their Applications to Conflict Resolution in Wireless Multichannels Networks 115
Synchronizability of Multivalued Encodings 114
Latency-bounded target set selection in social networks 114
Bounding the Average Length of Optimal Source Codes 112
Supermodularity and Subadditivity Properties of the Entropy on the Majorization Lattice 111
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
NEW RESULTS AND APPLICATIONS OF SUPERIMPOSED CODES (AND RELATED COMBINATORIAL STRUCTURES) TO THE DESIGN OF EFFICIENT GROUP TESTING PROCEDURES 109
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 Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 106
Optimal Detection of a Counterfeit Coin with Multi-Arms Balances 106
Communication Complexity of Gossiping by Packets 105
Two Batch Search With Lie Cost 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
Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels 102
Time Bounds for Broadcasting in Bounded Degree Graphs 102
A model for communication over noisy channels 102
Concurrent Multicast in Weighted Networks 101
Superselectors: Efficient Constructions and Applications 101
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 99
Immutable Codes 99
Combinatorial Pattern Matching- Proceedings of 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 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
Optimal Two-Stage Algorithms for Group Testing Problems 96
ε-almost selectors and their applications to multiple-access communication 96
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 94
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 93
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 92
Capacities: from Information Theory to Extremal Set Theory 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
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
Bounds on Entropy in a Guessing Game 88
Spanning Trees with Bounded Number of Branch Vertices 87
Fast Gossiping by Short Messages 87
Tunstall Parse Trees Optimum under Various Criteria 85
Perfect, Minimally Adaptive, Error-Correcting Searching Strategies 85
Influence Diffusion in Social Networks under Time Window Constraints 85
On Searching Strategies, Parallel Questions, and Delayed Answers 84
Bounding the Average Length of Optimal Source Codes via Majorization Theory 84
Rota-Metropolis cubic logic and Ulam-Renyi games 84
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 84
Analysis and comparison of information theory-based distances for genomic strings 84
Concurrent Multicast in Weighted Networks 83
Search Methodologies 83
Bounds on the Entropy of a Function of a Random Variable and Their Applications 83
Optimal Algorithms for Two Group Testing Problems and New Bounds on Generalized Superimposed Codes 82
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
Optimal Strategies Against a Liar 81
On the approximability and exact algorithms for vector domination and related problems in graphs 81
Brief announcement: Active information spread in networks 80
Generalized Framework for Selectors with Applications in Optimal Group Testing 79
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems 79
Spanning spiders and light-splitting switches 79
Partial Covering Arrays: Algorithms and Asymptotics 79
How to go Viral: Cheaply and Quickly 78
Efficient Algorithms for Chemical Threshold Testing Problems 76
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks 75
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 75
Efficient Collective Communication in Optical Networks 74
On the Construction of Minimal Broadcast Networks 74
Efficient Communication in Unknown Networks 73
Fault-Tolerance Properties of the Star Interconnection Network 73
On the Shannon Capacity of Graph Formulæ 73
Improved Algorithms for Chemical Threshold Testing Problems 72
An Improved Heuristic for Ulam-Renyi Game 72
Efficient Communication in Unknown Networks 71
Generalizations of Superimposed Codes with Applications to Efficient Design of Pooling Experiments 71
On the Construction of Minimal Broadcast Network 71
Secret Sharing Schemes with Veto Capabilities 71
Broadcasting in Hypercubes and Star Graphs with Dynamic Faults 71
Efficient Generation of Fair Dice with Few Biased Coins 71
The Randomness Complexity of Private Computation 70
On k-strong conflict-free multicoloring 69
Totale 9.480
Salva come PNG Salva come JPEG
Categoria #
all - tutte 37.512
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 37.512
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020252 0 0 0 0 0 0 0 0 0 0 199 53
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.225 86 53 34 87 66 202 242 194 179 72 10 0
Totale 11.849