CICALESE, Ferdinando
 Distribuzione geografica
Continente #
NA - Nord America 3.707
EU - Europa 3.231
AS - Asia 2.693
SA - Sud America 390
AF - Africa 84
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 6
Totale 10.118
Nazione #
US - Stati Uniti d'America 3.637
RU - Federazione Russa 1.294
SG - Singapore 1.108
CN - Cina 688
GB - Regno Unito 656
IT - Italia 345
BR - Brasile 312
HK - Hong Kong 262
VN - Vietnam 212
FR - Francia 202
KR - Corea 167
IE - Irlanda 161
DE - Germania 136
FI - Finlandia 135
SE - Svezia 134
BD - Bangladesh 48
IN - India 45
UA - Ucraina 38
TR - Turchia 37
CA - Canada 33
AT - Austria 30
NL - Olanda 28
AR - Argentina 27
NG - Nigeria 23
JP - Giappone 21
ID - Indonesia 20
MX - Messico 20
PL - Polonia 18
IQ - Iraq 15
BE - Belgio 13
ZA - Sudafrica 13
EC - Ecuador 11
CO - Colombia 10
ES - Italia 10
MA - Marocco 10
PK - Pakistan 10
PT - Portogallo 10
TG - Togo 9
CL - Cile 8
UZ - Uzbekistan 8
EU - Europa 7
PY - Paraguay 7
BJ - Benin 6
EG - Egitto 6
AE - Emirati Arabi Uniti 5
AU - Australia 5
PH - Filippine 5
UY - Uruguay 5
JM - Giamaica 4
KE - Kenya 4
MY - Malesia 4
RS - Serbia 4
TH - Thailandia 4
VE - Venezuela 4
GA - Gabon 3
JO - Giordania 3
LB - Libano 3
NP - Nepal 3
OM - Oman 3
PA - Panama 3
PE - Perù 3
SA - Arabia Saudita 3
TN - Tunisia 3
BB - Barbados 2
CR - Costa Rica 2
DZ - Algeria 2
HR - Croazia 2
IR - Iran 2
KG - Kirghizistan 2
KW - Kuwait 2
KZ - Kazakistan 2
LT - Lituania 2
LV - Lettonia 2
MU - Mauritius 2
PS - Palestinian Territory 2
RO - Romania 2
SV - El Salvador 2
TW - Taiwan 2
AL - Albania 1
AO - Angola 1
BA - Bosnia-Erzegovina 1
BH - Bahrain 1
BN - Brunei Darussalam 1
BO - Bolivia 1
CH - Svizzera 1
CM - Camerun 1
CY - Cipro 1
CZ - Repubblica Ceca 1
DO - Repubblica Dominicana 1
ET - Etiopia 1
GE - Georgia 1
GR - Grecia 1
GT - Guatemala 1
GY - Guiana 1
HN - Honduras 1
HU - Ungheria 1
IL - Israele 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
LU - Lussemburgo 1
Totale 10.113
Città #
Singapore 584
Southend 549
Ashburn 460
Moscow 424
San Jose 411
Dallas 280
Hong Kong 254
Chandler 245
Ann Arbor 230
Jacksonville 219
Woodbridge 187
Verona 175
Houston 166
Dublin 162
Beijing 140
The Dalles 130
Council Bluffs 106
Ho Chi Minh City 78
Wilmington 76
Lawrence 70
Princeton 70
Seoul 68
Los Angeles 63
Hanoi 61
Nanjing 48
New York 47
Helsinki 45
Jinan 36
Buffalo 31
Redondo Beach 31
Shenyang 31
Milan 28
Columbus 25
Frankfurt am Main 24
São Paulo 24
Tianjin 24
Santa Clara 23
Nanchang 22
Brooklyn 21
Orem 20
Abuja 19
Changsha 18
London 18
Amsterdam 17
Des Moines 17
Haikou 17
Vienna 16
Ningbo 15
Sindelfingen 15
Tokyo 15
Chicago 14
North Bergen 14
Warsaw 14
Brussels 13
Chennai 13
Jiaxing 13
Montreal 13
Istanbul 12
Seattle 12
Atlanta 11
Graz 11
Guangzhou 11
San Francisco 11
Norwalk 10
Boston 9
Denver 9
Hebei 9
Lanzhou 9
Lomé 9
Los Lunas 9
Stockholm 9
Zhengzhou 9
Ankara 8
Brasília 8
Haiphong 8
Hangzhou 8
Johannesburg 8
Lappeenranta 8
Redwood City 8
Springfield 8
Tashkent 8
Da Nang 7
Fortaleza 7
Rome 7
Shanghai 7
Taiyuan 7
Taizhou 7
Alessandria 6
Belo Horizonte 6
Boardman 6
Brescia 6
Cotonou 6
Curitiba 6
Fort Worth 6
Guayaquil 6
Palermo 6
Prineville 6
Santiago 6
Tappahannock 6
Toronto 6
Totale 6.291
Nome #
Q-ary Ulam-Rényi game with constrained lies 217
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 198
Efficient Reconstruction of RC-Equivalent Strings 183
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems 180
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 179
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 175
Algorithms for Jumbled Pattern Matching in Strings 171
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost 167
Bubble-Flip—A new generation algorithm for prefix normal words 164
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 162
A Combinatorial Model of Two-Sided Search 159
On Approximate Jumbled Pattern Matching in Strings. 158
Competitive Evaluation of Threshold Functions in the Priced Information Model 155
Binary Identification Problems for Weighted Trees 152
Combinatorial pattern matching: 26th annual symposium, CPM 2015 Ischia Island, Italy, june 29 – july 1, 2015 proceedings 152
On the Competitive Ratio of Evaluating Priced Functions 151
Searching for Jumbled Patterns in Strings 149
Approximating probability distributions with short vectors, via information theoretic distance measures 148
Guest Editorial for "Group Testing: models and applications" 147
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks 146
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 146
Information Theoretic Measures of Distances and their Econometric Applications 143
Approximating decision trees with value dependent testing costs 141
Competitive Boolean Function Evaluation. Beyond Monotonicity and the Symmetric Case 140
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees 139
Trading off Worst and Expected Cost in Decision Tree Problems 137
Least adaptive optimal search with unreliable tests 132
On Infinite Prefix Normal Words 131
Fault-Tolerant Search Algorithms 129
Bounds on the Entropy of a Function of a Random Variable and their Applications 129
The Binary Identification Problems for Weighted Trees 128
Approximating the maximum consecutive subsums of a sequence 128
Q-ary Ulam-Renyi game with constrained lies 128
H(X) vs. H(f (X)) 128
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching 127
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost 127
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence 124
A Combinatorial Model of Two-Sided Search 124
The Multi-interval Ulam-Rényi Game 121
RatioRF: a novel measure for Random Forest clustering based on the Tversky's Ratio model 121
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences 120
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 119
A Better Bouncer's Algorithm 119
Hardness of MSA with Selective Column Scoring 118
Graphs of separability at most two 118
Recent developments of feedback coding, and its relations with many-valued logic 115
On Greedy Algorithms for Decision Trees 115
Using Random Forest Distances for Outlier Detection 114
An Interesting Property of Random Forest Distances with Respect to the Curse of Dimensionality 113
Latency-bounded target set selection in social networks 112
Superselectors: Efficient Constructions and Applications 102
Computing Random Forest-distances in the presence of missing data 101
On the complexity of searching in trees and partially ordered structures 99
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 98
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 98
Teaching with limited information on the Learner's behaviour 97
Trading Off Worst and Expected Cost in Decision Tree Problems 97
On the Redundancy of D-Ary Fano Codes 97
How to go Viral: Cheaply and Quickly 96
On the Tree Search Problem with Non-uniform Costs 94
Spread of influence in weighted networks under time and budget constraints 93
New results on information theoretic clustering 92
Distance-Based Random Forest Clustering with~Missing Data 91
Decision Trees with Short Explainable Rules 90
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution 90
Hardness and approximation of multiple sequence alignment with column score 88
Latency-Bounded Target Set Selection in Social Networks 88
On the complexity of the vector connectivity problem 87
On the tree search problem with non-uniform costs 87
Faster Deterministic Communication in Radio Networks 87
On the star decomposition of a graph: Hardness results and approximation for the max{\textendash}min optimization problem 87
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost 85
Maximum Entropy Interval Aggregations 85
On D-ary Fano Codes 83
How to find a joint probability distribution of minimum entropy (almost) given the marginals 83
Minimum-Entropy Couplings and Their Applications 83
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions 82
Information Theoretical Clustering Is Hard to Approximate 82
On the Complexity of Directed Intersection Representation of {DAGs} 80
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets 80
On the approximability and exact algorithms for vector domination and related problems in graphs 79
On infinite prefix normal words 78
On the Complexity of Searching in Trees: Average-Case Minimization 77
On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation 71
Optimal Approximation of Uniform Distributions with a Biased Coin 58
Probabilistically Robust Counterfactual Explanations under Model Changes 37
Hardness and approximability of bounded access Lempel Ziv coding 36
Verifying Online Safety Properties for Safe Deep Reinforcement Learning 17
On the Probabilistic Learnability of Compact Neural Network Preimage Bounds 7
Totale 10.261
Categoria #
all - tutte 36.547
article - articoli 16.017
book - libri 410
conference - conferenze 18.210
curatela - curatele 469
other - altro 510
patent - brevetti 0
selected - selezionate 0
volume - volumi 931
Totale 73.094


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202116 0 0 0 0 0 0 0 0 0 0 0 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/20264.750 317 278 296 737 1.142 239 515 323 297 257 139 210
Totale 10.261