UniSa - IRIS Institutional Research Information System

VACCARO, Ugo
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
AS - Asia 12.234
NA - Nord America 8.077
EU - Europa 2.459
SA - Sud America 288
AF - Africa 18
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 6
Totale 23.090
Salva come PNG Salva come JPEG
Nazione #
HK - Hong Kong 10.440
US - Stati Uniti d'America 7.946
IT - Italia 782
SG - Singapore 731
UA - Ucraina 588
CN - Cina 553
RU - Federazione Russa 306
BR - Brasile 264
DE - Germania 226
VN - Vietnam 179
IE - Irlanda 170
TR - Turchia 142
SE - Svezia 140
FI - Finlandia 129
CA - Canada 114
KR - Corea 88
GB - Regno Unito 30
IN - India 23
PL - Polonia 16
MX - Messico 14
BD - Bangladesh 13
JP - Giappone 13
NL - Olanda 12
ES - Italia 11
IL - Israele 11
FR - Francia 10
IQ - Iraq 9
RO - Romania 9
ZA - Sudafrica 9
AR - Argentina 6
EU - Europa 6
PH - Filippine 6
PK - Pakistan 6
NP - Nepal 5
VE - Venezuela 5
AT - Austria 4
AU - Australia 4
BE - Belgio 4
CO - Colombia 4
SA - Arabia Saudita 4
CZ - Repubblica Ceca 3
DK - Danimarca 3
EC - Ecuador 3
LT - Lituania 3
MA - Marocco 3
NO - Norvegia 3
PE - Perù 3
HU - Ungheria 2
IR - Iran 2
NZ - Nuova Zelanda 2
OM - Oman 2
TN - Tunisia 2
UZ - Uzbekistan 2
AE - Emirati Arabi Uniti 1
AZ - Azerbaigian 1
BG - Bulgaria 1
BO - Bolivia 1
BW - Botswana 1
BY - Bielorussia 1
CG - Congo 1
CH - Svizzera 1
CR - Costa Rica 1
DO - Repubblica Dominicana 1
EG - Egitto 1
GH - Ghana 1
GR - Grecia 1
HR - Croazia 1
KG - Kirghizistan 1
KI - Kiribati 1
KZ - Kazakistan 1
LB - Libano 1
LU - Lussemburgo 1
MC - Monaco 1
MD - Moldavia 1
PA - Panama 1
PW - Palau 1
PY - Paraguay 1
UY - Uruguay 1
Totale 23.090
Salva come PNG Salva come JPEG
Città #
Hong Kong 10.431
Ann Arbor 1.925
Wilmington 822
Jacksonville 712
Chandler 686
Woodbridge 665
Houston 578
Princeton 504
Dallas 274
Singapore 227
Dublin 169
Dong Ket 162
Ashburn 158
Salerno 158
Nanjing 140
Izmir 133
Andover 126
Dearborn 112
Boardman 96
Pellezzano 95
Beijing 93
Ottawa 93
Moscow 81
Mestre 57
Fairfield 50
Hebei 50
Cava 42
Düsseldorf 40
Nanchang 39
Munich 37
Jiaxing 35
Los Angeles 35
The Dalles 33
Shenyang 30
Naples 29
Columbus 28
Norwalk 28
Changsha 27
São Paulo 23
Giugliano In Campania 18
Santa Clara 18
Seattle 18
San Diego 17
San Francisco 17
New York 16
Milan 15
Redwood City 15
Fisciano 14
Tianjin 14
Washington 14
Brooklyn 12
Chicago 12
Indiana 12
Warsaw 12
Council Bluffs 11
Pune 11
Sorrento 11
Atlanta 10
London 10
North Bergen 10
Tokyo 10
Boston 9
Guangzhou 9
Mexico City 9
Rio de Janeiro 9
Florianópolis 8
Jinan 8
Spinea 8
Amsterdam 7
Angri 7
Cambridge 7
Charlotte 7
Dormagen 7
Stockholm 7
Falls Church 6
Haikou 6
Hanover 6
Johannesburg 6
Maletto 6
Montreal 6
Renton 6
Rome 6
Turku 6
Brescia 5
Chennai 5
Helsinki 5
Mountain View 5
Secaucus 5
Shanghai 5
Wuhan 5
Zhengzhou 5
Barcelona 4
Brasília 4
Brussels 4
Campinas 4
Campo Grande 4
Edinburgh 4
Goiânia 4
Melbourne 4
Mercato San Severino 4
Totale 19.552
Salva come PNG Salva come JPEG
Nome #
Optimal Algorithms for Two Group Testing Problems and New Bounds on Generalized Superimposed Codes 886
On the Capacity of Boolean Graph FormulaeGraphs and Combinatorics, 11 (1995), 29-48, (with ). 882
Asynchronous deterministic rendezvous in graphs 592
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 581
Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems 490
Concurrent Multicast in Weighted Networks 483
Combinatorial Algorithms 35th International Workshop, IWOCA 2024, Ischia, Italy, July 1–3, 2024, Proceedings 462
How to find a joint probability distribution of minimum entropy (almost) given the marginals 448
Superselectors: Efficient Constructions and Applications 424
Influence Diffusion in Social Networks under Time Window Constraints 421
Generalizations of Superimposed Codes with Applications to Efficient Design of Pooling Experiments 399
Unidirectional Error Detecting Codes 390
Improved Algorithms for Chemical Threshold Testing Problems 348
A Note on Secret Sharing Schemes 333
Optimal Strategies Against a Liar 326
Latency-bounded target set selection in social networks 313
Achievable Rates and Algorithms for Group Testing with Runlength Constraints 299
Two Batch Search With Lie Cost 283
Synchronizability of Multivalued Encodings 281
A model for communication over noisy channels 277
On the approximability and exact algorithms for vector domination and related problems in graphs 277
Evangelism in social networks: Algorithms and complexity 269
An Improved Algorithm for Quantitative Group Testing, vol. 36, (1992), 299-306, (with ) 267
Perfect, Minimally Adaptive, Error-Correcting Searching Strategies 263
Small Probability Spaces: Qualitative Independence And Beyond 241
A fastalgorithm for the uniquedecipherability of multivalued encodings 229
Old and New Results on Alphabetic Codes 221
Immutable Codes 218
Evangelism in social networks 216
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 210
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs 202
Sperner Capacities 200
Analysis and comparison of information theory-based distances for genomic strings 199
Binary Search with Delayed and Missing Answers 196
Combinatorial Pattern Matching- Proceedings of 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 196
On k-strong conflict-free multicoloring 190
Approximating probability distributions with short vectors, via information theoretic distance measures 189
The Randomness Complexity of Private Computation 175
ɛ-almost selectors and their applications 173
Bounds and algorithms for generalized superimposed codes 172
Generalized Framework for Selectors with Applications in Optimal Group Testing 166
Partial Covering Arrays: Algorithms and Asymptotics 161
Rota-Metropolis cubic logic and Ulam-Renyi games 156
NEW RESULTS AND APPLICATIONS OF SUPERIMPOSED CODES (AND RELATED COMBINATORIAL STRUCTURES) TO THE DESIGN OF EFFICIENT GROUP TESTING PROCEDURES 154
A New Kind of Selectors and Their Applications to Conflict Resolution in Wireless Multichannels Networks 153
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 152
Generalized Distance Measures and Error Bounds'', 148
Bounds on the Entropy of a Function of a Random Variable and Their Applications 148
Bounding the Average Length of Optimal Source Codes 141
Coping with Delays and Time-Outs in Binary Search Procedures 140
`Perfectly-Secure Conference Key Distribution 137
Decoders with Initial State Invariance for Multivalued Encodings 137
Spread of Influence in Weighted Networks under Time and Budget Constraints 135
Efficient Collective Communication in Optical Networks 133
Improved Algorithms for Chemical Threshold Testing Problems 131
Supermodularity and Subadditivity Properties of the Entropy on the Majorization Lattice 122
Bounds on Entropy in a Guessing Game 121
Optimal Detection of a Counterfeit Coin with Multi-Arms Balances 121
GENERALIZED DISTANCE MEASURES AND ERROR BOUNDS 117
Tunstall Parse Trees Optimum under Various Criteria 116
Communication Complexity of Gossiping by Packets 115
Latency-Bounded Target Set Selection in Social Networks 115
Spider Covers and Their Applications 114
Constructions of Generalized Superimposed Codes with Applications to Group Testing and Conflict Resolution in Multiple Access Channels 113
On the Information Rate of Secret Sharing Schemes (Extended Abstract) 113
Information Theoretic Measures of Distances and their Econometric Applications 112
An Efficient Algorithm for Testing Immutability of Variable Length Codes 111
Efficient Communication in Unknown Networks 110
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems 110
ε-almost selectors and their applications to multiple-access communication 110
Time Bounds for Broadcasting in Bounded Degree Graphs 109
Fault Tolerant Routing in the Star and Pancake Interconnection Networks 109
Asynchronous deterministic rendezvous in graphs 108
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas 108
A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks 108
Capacities: from Information Theory to Extremal Set Theory 107
Highly Fault-Tolerant Routing in the Star and Hypercube Interconnection Networks 105
Concurrent Multicast in Weighted Networks 105
Search Problems for Two Irregular Coins with Incomplete Feedback: the Underweight Mode, 105
Efficient Generation of Fair Dice with Few Biased Coins 105
Fast and frugal targeting with incentives 104
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 103
On the Construction of Minimal Broadcast Network 103
An Information-Theoretic Treatment of Secret Sharing Schemes 103
Spanning spiders and light-splitting switches 102
Efficient Collective Communication in Optical Networks. 102
Brief announcement: Active information spread in networks 101
Optimal Two-Stage Algorithms for Group Testing Problems 98
The Entropy is Supermodular on the Majorization Lattice 98
Fault-Tolerant Hypercube Broadcasting via Information Dispersal 98
Bounding the Average Length of Optimal Source Codes via Majorization Theory 97
Optimal Time Data Gathering in Wireless Networks with Omni–Directional Antennas 96
Coding, Synchronization and Randomization of Source Messages 96
A note on equivalent conditions for majorization 95
Qualitative Independence and Sperner Problems for Directed Graphs 95
Partial Covering Arrays: Algorithms and Asymptotics 95
Discovering Small Target Sets in Social Networks: A Fast and Effective Algorithm 95
A new kind of selectors and their applications to conflict resolution in wireless multichannels networks 94
Spanning Trees with Bounded Number of Branch Vertices 92
Search Methodologies 92
Totale 20.161
Salva come PNG Salva come JPEG
Categoria #
all - tutte 54.412
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 54.412
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021945 0 0 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/202610.778 2.595 7.656 527 0 0 0 0 0 0 0 0 0
Totale 23.386