CICALESE, Ferdinando
 Distribuzione geografica
Continente #
NA - Nord America 2.563
EU - Europa 2.242
AS - Asia 1.953
SA - Sud America 307
AF - Africa 39
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 5
Totale 7.116
Nazione #
US - Stati Uniti d'America 2.524
SG - Singapore 818
GB - Regno Unito 632
CN - Cina 609
RU - Federazione Russa 542
BR - Brasile 275
HK - Hong Kong 244
IT - Italia 208
FR - Francia 192
IE - Irlanda 160
FI - Finlandia 132
SE - Svezia 131
DE - Germania 118
KR - Corea 111
VN - Vietnam 50
UA - Ucraina 37
TR - Turchia 32
IN - India 22
AT - Austria 21
CA - Canada 17
NL - Olanda 17
JP - Giappone 13
BE - Belgio 12
MX - Messico 12
PL - Polonia 12
BD - Bangladesh 11
AR - Argentina 10
EC - Ecuador 8
ES - Italia 8
TG - Togo 8
EU - Europa 7
ID - Indonesia 7
ZA - Sudafrica 7
BJ - Benin 6
EG - Egitto 6
MA - Marocco 6
IQ - Iraq 5
AE - Emirati Arabi Uniti 4
AU - Australia 4
CL - Cile 4
PY - Paraguay 4
RS - Serbia 4
UZ - Uzbekistan 4
PK - Pakistan 3
BB - Barbados 2
HR - Croazia 2
JM - Giamaica 2
KG - Kirghizistan 2
KZ - Kazakistan 2
LT - Lituania 2
LV - Lettonia 2
PA - Panama 2
PS - Palestinian Territory 2
PT - Portogallo 2
RO - Romania 2
TW - Taiwan 2
VE - Venezuela 2
AO - Angola 1
BA - Bosnia-Erzegovina 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BO - Bolivia 1
CH - Svizzera 1
CM - Camerun 1
CO - Colombia 1
CR - Costa Rica 1
CY - Cipro 1
CZ - Repubblica Ceca 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
GA - Gabon 1
GE - Georgia 1
GR - Grecia 1
GT - Guatemala 1
IL - Israele 1
IR - Iran 1
KE - Kenya 1
KW - Kuwait 1
LA - Repubblica Popolare Democratica del Laos 1
LB - Libano 1
LK - Sri Lanka 1
ME - Montenegro 1
MK - Macedonia 1
MY - Malesia 1
NI - Nicaragua 1
NZ - Nuova Zelanda 1
PE - Perù 1
TH - Thailandia 1
TN - Tunisia 1
UY - Uruguay 1
Totale 7.116
Città #
Southend 549
Singapore 360
Dallas 275
Chandler 245
Hong Kong 237
Ann Arbor 230
Jacksonville 219
Woodbridge 187
Dublin 161
Houston 161
Moscow 136
Ashburn 132
Beijing 131
Verona 85
Wilmington 76
The Dalles 71
Lawrence 70
Princeton 70
Seoul 68
Los Angeles 52
Nanjing 47
Helsinki 44
New York 43
Jinan 36
Redondo Beach 31
Shenyang 31
Buffalo 28
Milan 26
Columbus 25
Nanchang 22
Council Bluffs 20
Brooklyn 19
Changsha 18
São Paulo 18
Tianjin 18
Haikou 17
Ho Chi Minh City 17
Santa Clara 17
Vienna 16
Ningbo 15
Sindelfingen 15
Des Moines 14
Frankfurt am Main 14
North Bergen 14
Jiaxing 13
London 13
Brussels 12
Seattle 12
Guangzhou 11
Hanoi 10
Norwalk 10
Warsaw 10
Amsterdam 9
Chennai 9
Hebei 9
Lanzhou 9
Zhengzhou 9
Ankara 8
Chicago 8
Lomé 8
Redwood City 8
Tokyo 8
Atlanta 7
Boston 7
Brasília 7
Denver 7
Hangzhou 7
Istanbul 7
Orem 7
Taizhou 7
Boardman 6
Brescia 6
Cotonou 6
Curitiba 6
Fortaleza 6
Lappeenranta 6
Montreal 6
Palermo 6
San Francisco 6
Stockholm 6
Taiyuan 6
Tappahannock 6
Belo Horizonte 5
Fort Worth 5
Guarulhos 5
Guayaquil 5
Johannesburg 5
Shanghai 5
Augusta 4
Coimbatore 4
Düsseldorf 4
Mantova 4
Meda 4
Poplar 4
Porto Alegre 4
Romola 4
Tashkent 4
Volta Redonda 4
Washington 4
Baghdad 3
Totale 4.461
Nome #
Q-ary Ulam-Rényi game with constrained lies 177
Efficient Reconstruction of RC-Equivalent Strings 155
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 144
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 143
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 130
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 126
Algorithms for Jumbled Pattern Matching in Strings 124
On the Competitive Ratio of Evaluating Priced Functions 123
Bubble-Flip—A new generation algorithm for prefix normal words 120
On Approximate Jumbled Pattern Matching in Strings. 119
Guest Editorial for "Group Testing: models and applications" 117
A Combinatorial Model of Two-Sided Search 116
Combinatorial pattern matching: 26th annual symposium, CPM 2015 Ischia Island, Italy, june 29 – july 1, 2015 proceedings 114
Searching for Jumbled Patterns in Strings 112
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 112
Information Theoretic Measures of Distances and their Econometric Applications 111
Competitive Evaluation of Threshold Functions in the Priced Information Model 110
Binary Identification Problems for Weighted Trees 108
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost 106
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems 106
The Binary Identification Problems for Weighted Trees 105
Q-ary Ulam-Renyi game with constrained lies 105
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks 104
Competitive Boolean Function Evaluation. Beyond Monotonicity and the Symmetric Case 102
Approximating probability distributions with short vectors, via information theoretic distance measures 101
Fault-Tolerant Search Algorithms 100
The Multi-interval Ulam-Rényi Game 99
On Infinite Prefix Normal Words 99
Least adaptive optimal search with unreliable tests 97
Trading off Worst and Expected Cost in Decision Tree Problems 97
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching 96
Approximating decision trees with value dependent testing costs 96
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence 95
Approximating the maximum consecutive subsums of a sequence 94
H(X) vs. H(f (X)) 94
RatioRF: a novel measure for Random Forest clustering based on the Tversky's Ratio model 91
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost 90
Recent developments of feedback coding, and its relations with many-valued logic 88
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences 87
On Greedy Algorithms for Decision Trees 86
Bounds on the Entropy of a Function of a Random Variable and their Applications 86
Superselectors: Efficient Constructions and Applications 83
A Combinatorial Model of Two-Sided Search 80
Graphs of separability at most two 79
On the Tree Search Problem with Non-uniform Costs 78
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 77
Hardness of MSA with Selective Column Scoring 76
Latency-bounded target set selection in social networks 76
Trading Off Worst and Expected Cost in Decision Tree Problems 76
Using Random Forest Distances for Outlier Detection 72
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees 72
Spread of influence in weighted networks under time and budget constraints 71
How to go Viral: Cheaply and Quickly 70
A Better Bouncer's Algorithm 70
New results on information theoretic clustering 69
Latency-Bounded Target Set Selection in Social Networks 69
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost 68
On the complexity of the vector connectivity problem 68
On the complexity of searching in trees and partially ordered structures 67
On D-ary Fano Codes 66
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 66
An Interesting Property of Random Forest Distances with Respect to the Curse of Dimensionality 64
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions 64
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution 64
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 64
Teaching with limited information on the Learner's behaviour 63
Distance-Based Random Forest Clustering with~Missing Data 63
On the tree search problem with non-uniform costs 63
Decision Trees with Short Explainable Rules 61
Maximum Entropy Interval Aggregations 60
On the Complexity of Directed Intersection Representation of {DAGs} 58
Faster Deterministic Communication in Radio Networks 56
How to find a joint probability distribution of minimum entropy (almost) given the marginals 56
Computing Random Forest-distances in the presence of missing data 55
On the Redundancy of D-Ary Fano Codes 55
On the approximability and exact algorithms for vector domination and related problems in graphs 54
On the star decomposition of a graph: Hardness results and approximation for the max{\textendash}min optimization problem 52
On the Complexity of Searching in Trees: Average-Case Minimization 51
On infinite prefix normal words 51
Hardness and approximation of multiple sequence alignment with column score 50
Information Theoretical Clustering Is Hard to Approximate 46
On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation 44
Minimum-Entropy Couplings and Their Applications 42
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets 42
Optimal Approximation of Uniform Distributions with a Biased Coin 38
Totale 7.254
Categoria #
all - tutte 29.174
article - articoli 12.675
book - libri 345
conference - conferenze 14.592
curatela - curatele 384
other - altro 401
patent - brevetti 0
selected - selezionate 0
volume - volumi 777
Totale 58.348


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021305 0 0 0 0 76 101 10 15 29 6 52 16
2021/2022371 19 44 26 11 36 10 6 34 14 14 42 115
2022/2023882 79 55 125 138 59 227 4 54 102 6 23 10
2023/2024494 21 46 38 35 56 48 25 40 11 83 56 35
2024/20251.610 91 89 78 238 59 44 65 107 223 124 164 328
2025/20261.743 317 278 296 737 115 0 0 0 0 0 0 0
Totale 7.254