UniSa - IRIS Institutional Research Information System

VACCARO, Ugo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 7.400
EU - Europa 1.962
AS - Asia 802
Continente sconosciuto - Info sul continente non disponibili 6
OC - Oceania 6
SA - Sud America 4
AF - Africa 3
Totale 10.183
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 7.299
IT - Italia 681
UA - Ucraina 583
CN - Cina 465
DE - Germania 182
IE - Irlanda 170
VN - Vietnam 163
SE - Svezia 136
TR - Turchia 135
FI - Finlandia 119
CA - Canada 98
RU - Federazione Russa 21
GB - Regno Unito 13
IN - India 12
NL - Olanda 10
FR - Francia 9
IL - Israele 9
RO - Romania 9
ES - Italia 6
EU - Europa 6
PH - Filippine 6
PL - Polonia 5
AU - Australia 4
BE - Belgio 4
HK - Hong Kong 4
SG - Singapore 4
BR - Brasile 3
MX - Messico 3
NO - Norvegia 3
HU - Ungheria 2
JP - Giappone 2
NZ - Nuova Zelanda 2
AT - Austria 1
BG - Bulgaria 1
BO - Bolivia 1
BW - Botswana 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
EG - Egitto 1
GH - Ghana 1
GR - Grecia 1
HR - Croazia 1
LU - Lussemburgo 1
MC - Monaco 1
MD - Moldavia 1
NP - Nepal 1
SA - Arabia Saudita 1
Totale 10.183
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.925
Wilmington 822
Jacksonville 711
Chandler 686
Woodbridge 665
Houston 577
Princeton 504
Dublin 169
Dong Ket 162
Salerno 149
Nanjing 140
Ashburn 134
Izmir 133
Andover 126
Dearborn 112
Pellezzano 95
Boardman 94
Ottawa 93
Beijing 82
Mestre 57
Fairfield 50
Hebei 50
Cava 42
Düsseldorf 40
Nanchang 39
Jiaxing 32
Shenyang 29
Norwalk 28
Changsha 27
Giugliano In Campania 18
Naples 18
San Diego 17
Redwood City 15
Washington 14
Tianjin 13
Indiana 12
Pune 11
Seattle 11
Sorrento 11
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
Amsterdam 5
Brescia 5
Mountain View 5
Barcelona 4
Brussels 4
Edinburgh 4
Melbourne 4
Mercato San Severino 4
Napoli 4
Rescaldina 4
Zhengzhou 4
Cagliari 3
Caivano 3
Casalnuovo di Napoli 3
Chicago 3
Fuzhou 3
Gravina in Puglia 3
Guangzhou 3
Hoogvliet 3
Lanzhou 3
Mexico City 3
Poggiomarino 3
Rome 3
Sennori 3
Stockholm 3
Venice 3
Verona 3
Auckland 2
Avellino 2
Budapest 2
Cetara 2
Edmonton 2
Fisciano 2
Frankfurt am Main 2
Groningen 2
Hangzhou 2
Hefei 2
Helsinki 2
Hong Kong 2
Horia 2
Las Vegas 2
Lonato 2
Lynnwood 2
Madrid 2
Marigliano 2
Milan 2
Ningbo 2
Nocera Inferiore 2
Oslo 2
Totale 8.131
Salva come PNG Salva come JPEG
Nome #
ɛ-almost selectors and their applications 153
Partial Covering Arrays: Algorithms and Asymptotics 146
Evangelism in social networks 138
Approximating probability distributions with short vectors, via information theoretic distance measures 126
Binary Search with Delayed and Missing Answers 111
Unidirectional Error Detecting Codes 110
Synchronizability of Multivalued Encodings 108
Latency-bounded target set selection in social networks 107
Information Theoretic Measures of Distances and their Econometric Applications 106
Spread of Influence in Weighted Networks under Time and Budget Constraints 104
NEW RESULTS AND APPLICATIONS OF SUPERIMPOSED CODES (AND RELATED COMBINATORIAL STRUCTURES) TO THE DESIGN OF EFFICIENT GROUP TESTING PROCEDURES 104
Bounding the Average Length of Optimal Source Codes 104
A Note on Secret Sharing Schemes 104
Improved Algorithms for Chemical Threshold Testing Problems 103
Influence Diffusion in Social Networks under Time Window Constraints 103
Latency-Bounded Target Set Selection in Social Networks 102
An Improved Algorithm for Quantitative Group Testing, vol. 36, (1992), 299-306, (with ) 101
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 100
Sperner Capacities 100
Optimal Detection of a Counterfeit Coin with Multi-Arms Balances 100
GENERALIZED DISTANCE MEASURES AND ERROR BOUNDS 100
A New Kind of Selectors and Their Applications to Conflict Resolution in Wireless Multichannels Networks 99
Supermodularity and Subadditivity Properties of the Entropy on the Majorization Lattice 98
Two Batch Search With Lie Cost 98
Fault Tolerant Routing in the Star and Pancake Interconnection Networks 96
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 96
Superselectors: Efficient Constructions and Applications 94
Communication Complexity of Gossiping by Packets 94
Immutable Codes 93
Time Bounds for Broadcasting in Bounded Degree Graphs 93
Spider Covers and Their Applications 92
A model for communication over noisy channels 91
A fastalgorithm for the uniquedecipherability of multivalued encodings 91
Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels 90
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 90
Efficient Collective Communication in Optical Networks. 90
Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Mode, 90
Combinatorial Pattern Matching- Proceedings of 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 90
ε-almost selectors and their applications to multiple-access communication 89
Concurrent Multicast in Weighted Networks 87
Optimal Two-Stage Algorithms for Group Testing Problems 86
`Perfectly-Secure Conference Key Distribution 86
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 85
Decoders with Initial State Invariance for Multivalued Encodings 85
Bounds on Entropy in a Guessing Game 84
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 84
Generalized Distance Measures and Error Bounds'', 84
Coding, Synchronization and Randomization of Source Messages 84
Asynchronous deterministic rendezvous in graphs 83
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 83
Asynchronous deterministic rendezvous in graphs 82
Spanning Trees with Bounded Number of Branch Vertices 82
Fast Gossiping by Short Messages 82
Rota-Metropolis cubic logic and Ulam-Renyi games 81
Small Probability Spaces: Qualitative Independence And Beyond 81
Tunstall Parse Trees Optimum under Various Criteria 80
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 80
Capacities: from Information Theory to Extremal Set Theory 79
An Information-Theoretic Treatment of Secret Sharing Schemes 79
Qualitative Independence and Sperner Problems for Directed Graphs 79
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 79
Optimal Algorithms for Two Group Testing Problems and New Bounds on Generalized Superimposed Codes 78
Perfect, Minimally Adaptive, Error-Correcting Searching Strategies 78
An Efficient Algorithm for Testing Immutability of Variable Length Codes 78
On Searching Strategies, Parallel Questions, and Delayed Answers 77
Search Methodologies 77
On the Information Rate of Secret Sharing Schemes (Extended Abstract) 76
On the Capacity of Boolean Graph FormulaeGraphs and Combinatorics, 11 (1995), 29-48, (with ). 75
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 75
Bounding the Average Length of Optimal Source Codes via Majorization Theory 74
Optimal Strategies Against a Liar 74
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems 74
Analysis and comparison of information theory-based distances for genomic strings 74
Influence Diffusion in Social Networks under Time Window Constraints 73
Spanning spiders and light-splitting switches 72
How to go Viral: Cheaply and Quickly 72
Partial Covering Arrays: Algorithms and Asymptotics 72
On the approximability and exact algorithms for vector domination and related problems in graphs 71
Concurrent Multicast in Weighted Networks 70
Generalized Framework for Selectors with Applications in Optimal Group Testing 69
Improved Algorithms for Chemical Threshold Testing Problems 69
Bounds on the Entropy of a Function of a Random Variable and Their Applications 69
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 69
On the Construction of Minimal Broadcast Networks 68
Efficient Algorithms for Chemical Threshold Testing Problems 67
Fault-Tolerance Properties of the Star Interconnection Network 67
On the Shannon Capacity of Graph Formulæ 67
The Randomness Complexity of Private Computation 66
Secret Sharing Schemes with Veto Capabilities 66
Efficient Generation of Fair Dice with Few Biased Coins 66
Efficient Communication in Unknown Networks 65
Efficient Collective Communication in Optical Networks 65
Efficient Communication in Unknown Networks 64
Generalizations of Superimposed Codes with Applications to Efficient Design of Pooling Experiments 64
On the Construction of Minimal Broadcast Network 64
Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults 64
Brief announcement: Active information spread in networks 64
Optimizing Spread of Influence in Social Networks via Partial Incentives 62
On k-strong conflict-free multicoloring 61
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks 60
Totale 8.535
Salva come PNG Salva come JPEG
Categoria #
all - tutte 24.550
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 24.550
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019228 0 0 0 0 0 0 0 0 0 56 169 3
2019/20201.397 317 55 135 15 127 97 164 31 135 69 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/2024470 88 109 39 19 41 62 35 22 21 34 0 0
Totale 10.463