CICALESE, Ferdinando
 Distribuzione geografica
Continente #
NA - Nord America 3.404
EU - Europa 3.199
AS - Asia 2.663
SA - Sud America 389
AF - Africa 84
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 6
Totale 9.752
Nazione #
US - Stati Uniti d'America 3.345
RU - Federazione Russa 1.294
SG - Singapore 1.104
CN - Cina 685
GB - Regno Unito 656
IT - Italia 320
BR - Brasile 311
HK - Hong Kong 260
VN - Vietnam 212
FR - Francia 202
KR - Corea 167
IE - Irlanda 161
DE - Germania 136
FI - Finlandia 135
SE - Svezia 134
IN - India 44
UA - Ucraina 38
TR - Turchia 36
AT - Austria 30
BD - Bangladesh 30
AR - Argentina 27
NL - Olanda 27
CA - Canada 26
NG - Nigeria 23
JP - Giappone 21
MX - Messico 20
ID - Indonesia 19
PL - Polonia 16
IQ - Iraq 15
BE - Belgio 13
ZA - Sudafrica 13
EC - Ecuador 11
CO - Colombia 10
ES - Italia 10
MA - Marocco 10
PK - Pakistan 10
TG - Togo 9
CL - Cile 8
UZ - Uzbekistan 8
EU - Europa 7
PT - Portogallo 7
PY - Paraguay 7
BJ - Benin 6
EG - Egitto 6
AE - Emirati Arabi Uniti 5
AU - Australia 5
PH - Filippine 5
UY - Uruguay 5
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
JM - Giamaica 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
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
HU - Ungheria 1
IL - Israele 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
ME - Montenegro 1
MK - Macedonia 1
NI - Nicaragua 1
Totale 9.749
Città #
Singapore 583
Southend 549
Ashburn 432
Moscow 424
San Jose 301
Dallas 277
Hong Kong 252
Chandler 245
Ann Arbor 230
Jacksonville 219
Woodbridge 187
Verona 172
Houston 164
Dublin 162
Beijing 139
The Dalles 130
Ho Chi Minh City 78
Wilmington 76
Lawrence 70
Princeton 70
Seoul 68
Hanoi 61
Los Angeles 58
Nanjing 48
Helsinki 45
New York 44
Jinan 36
Redondo Beach 31
Shenyang 31
Buffalo 28
Milan 28
Columbus 25
Frankfurt am Main 24
Tianjin 24
São Paulo 23
Council Bluffs 22
Nanchang 22
Brooklyn 20
Abuja 19
Orem 19
Santa Clara 19
Changsha 18
London 18
Amsterdam 17
Des Moines 17
Haikou 17
Vienna 16
Ningbo 15
Sindelfingen 15
Tokyo 15
North Bergen 14
Warsaw 14
Brussels 13
Chennai 13
Jiaxing 13
Chicago 12
Montreal 12
Seattle 12
Atlanta 11
Graz 11
Guangzhou 11
Istanbul 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
San Francisco 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
Altoona 5
Biên Hòa 5
Totale 6.028
Nome #
Q-ary Ulam-Rényi game with constrained lies 211
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 192
Efficient Reconstruction of RC-Equivalent Strings 181
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems 176
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 173
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 173
Algorithms for Jumbled Pattern Matching in Strings 168
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost 164
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 161
Bubble-Flip—A new generation algorithm for prefix normal words 160
A Combinatorial Model of Two-Sided Search 154
On Approximate Jumbled Pattern Matching in Strings. 151
Binary Identification Problems for Weighted Trees 150
Combinatorial pattern matching: 26th annual symposium, CPM 2015 Ischia Island, Italy, june 29 – july 1, 2015 proceedings 150
Competitive Evaluation of Threshold Functions in the Priced Information Model 149
Guest Editorial for "Group Testing: models and applications" 145
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks 144
Approximating probability distributions with short vectors, via information theoretic distance measures 144
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 144
Searching for Jumbled Patterns in Strings 143
On the Competitive Ratio of Evaluating Priced Functions 143
Information Theoretic Measures of Distances and their Econometric Applications 139
Approximating decision trees with value dependent testing costs 138
Competitive Boolean Function Evaluation. Beyond Monotonicity and the Symmetric Case 136
Trading off Worst and Expected Cost in Decision Tree Problems 133
Least adaptive optimal search with unreliable tests 127
Fault-Tolerant Search Algorithms 127
Approximating the maximum consecutive subsums of a sequence 127
On Infinite Prefix Normal Words 126
The Binary Identification Problems for Weighted Trees 125
Bounds on the Entropy of a Function of a Random Variable and their Applications 125
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost 124
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching 123
Q-ary Ulam-Renyi game with constrained lies 123
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence 122
H(X) vs. H(f (X)) 122
Enumerating Safe Regions in Deep Neural Networks with Provable Probabilistic Guarantees 121
RatioRF: a novel measure for Random Forest clustering based on the Tversky's Ratio model 121
A Combinatorial Model of Two-Sided Search 120
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences 116
A Better Bouncer's Algorithm 116
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 115
Using Random Forest Distances for Outlier Detection 114
Recent developments of feedback coding, and its relations with many-valued logic 114
Hardness of MSA with Selective Column Scoring 113
The Multi-interval Ulam-Rényi Game 112
On Greedy Algorithms for Decision Trees 112
Graphs of separability at most two 112
An Interesting Property of Random Forest Distances with Respect to the Curse of Dimensionality 109
Latency-bounded target set selection in social networks 104
Superselectors: Efficient Constructions and Applications 101
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 97
Computing Random Forest-distances in the presence of missing data 96
How to go Viral: Cheaply and Quickly 95
Trading Off Worst and Expected Cost in Decision Tree Problems 95
Teaching with limited information on the Learner's behaviour 93
On the complexity of searching in trees and partially ordered structures 93
On the Tree Search Problem with Non-uniform Costs 92
New results on information theoretic clustering 91
Spread of influence in weighted networks under time and budget constraints 90
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 90
Distance-Based Random Forest Clustering with~Missing Data 89
Latency-Bounded Target Set Selection in Social Networks 87
Decision Trees with Short Explainable Rules 86
Hardness and approximation of multiple sequence alignment with column score 85
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution 85
On the complexity of the vector connectivity problem 85
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost 84
Maximum Entropy Interval Aggregations 83
On the tree search problem with non-uniform costs 82
Faster Deterministic Communication in Radio Networks 82
On the star decomposition of a graph: Hardness results and approximation for the max{\textendash}min optimization problem 82
On the Redundancy of D-Ary Fano Codes 81
On D-ary Fano Codes 79
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions 79
How to find a joint probability distribution of minimum entropy (almost) given the marginals 79
Information Theoretical Clustering Is Hard to Approximate 78
On the Complexity of Directed Intersection Representation of {DAGs} 78
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets 77
On the approximability and exact algorithms for vector domination and related problems in graphs 75
On infinite prefix normal words 75
On the Complexity of Searching in Trees: Average-Case Minimization 73
Minimum-Entropy Couplings and Their Applications 69
On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation 68
Optimal Approximation of Uniform Distributions with a Biased Coin 53
Hardness and approximability of bounded access Lempel Ziv coding 33
Probabilistically Robust Counterfactual Explanations under Model Changes 32
Verifying Online Safety Properties for Safe Deep Reinforcement Learning 10
Totale 9.894
Categoria #
all - tutte 34.115
article - articoli 14.879
book - libri 391
conference - conferenze 17.039
curatela - curatele 442
other - altro 479
patent - brevetti 0
selected - selezionate 0
volume - volumi 885
Totale 68.230


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202174 0 0 0 0 0 0 0 0 0 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/20264.383 317 278 296 737 1.142 239 515 323 297 239 0 0
Totale 9.894