Cicalese, Ferdinando
 Distribuzione geografica
Continente #
NA - Nord America 1.658
EU - Europa 1.465
AS - Asia 551
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 5
AF - Africa 4
SA - Sud America 1
Totale 3.691
Nazione #
US - Stati Uniti d'America 1.653
GB - Regno Unito 602
CN - Cina 433
FR - Francia 171
IE - Irlanda 159
SE - Svezia 127
IT - Italia 119
FI - Finlandia 110
DE - Germania 99
KR - Corea 85
UA - Ucraina 36
AT - Austria 13
TR - Turchia 13
BE - Belgio 12
IN - India 8
EU - Europa 7
NL - Olanda 6
CA - Canada 5
HK - Hong Kong 5
AU - Australia 4
JP - Giappone 4
EG - Egitto 2
HR - Croazia 2
PS - Palestinian Territory 2
RS - Serbia 2
RU - Federazione Russa 2
BO - Bolivia 1
CM - Camerun 1
ES - Italia 1
LV - Lettonia 1
MA - Marocco 1
ME - Montenegro 1
NZ - Nuova Zelanda 1
PT - Portogallo 1
RO - Romania 1
TH - Thailandia 1
Totale 3.691
Città #
Southend 549
Chandler 245
Ann Arbor 230
Jacksonville 219
Woodbridge 187
Houston 161
Dublin 159
Beijing 103
Wilmington 76
Ashburn 74
Lawrence 70
Princeton 70
Seoul 68
Verona 52
Nanjing 47
Jinan 34
Shenyang 31
Helsinki 27
Nanchang 22
Changsha 18
Haikou 17
Ningbo 15
Sindelfingen 15
Jiaxing 13
Vienna 13
Brussels 12
New York 11
Tianjin 11
Norwalk 10
Seattle 10
Hebei 9
Milan 9
Frankfurt am Main 8
Lanzhou 8
Redwood City 8
Zhengzhou 8
Guangzhou 7
Hangzhou 7
Taizhou 7
Boardman 6
Los Angeles 6
Taiyuan 6
Tappahannock 6
Coimbatore 4
Düsseldorf 4
Chennai 3
Falls Church 3
Fuzhou 3
Palermo 3
San Francisco 3
Washington 3
Belgrade 2
Botticino 2
Cava 2
Chicago 2
Enschede 2
Fairfield 2
Florence 2
Giza 2
Groningen 2
Lappeenranta 2
Mannheim 2
Melbourne 2
Messina 2
Padova 2
Simi Valley 2
Stockholm 2
Toronto 2
Trieste 2
Zagreb 2
Andover 1
Auburn Hills 1
Auckland 1
Bangkok 1
Bielefeld 1
Brescia 1
Brierley Hill 1
Canberra 1
Central 1
Changchun 1
Changle 1
Chengdu 1
Chiaravalle 1
Clearwater 1
Cologna Veneta 1
Dearborn 1
Des Moines 1
Edinburgh 1
Hongtong 1
Laurel 1
Legnago 1
Lisbon 1
Mehlingen 1
Montreal 1
Montréal 1
Narni 1
Novokuznetsk 1
Nürnberg 1
Oklahoma City 1
Opera 1
Totale 2.758
Nome #
Q-ary Ulam-Rényi game with constrained lies 118
Efficient Reconstruction of RC-Equivalent Strings 115
Indexes for Jumbled Pattern Matching in Strings, Trees, and Graphs 100
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 93
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 87
Information Theoretic Measures of Distances and their Econometric Applications 84
Bubble-Flip---A New Generation Algorithm for Prefix Normal Words 84
Guest Editorial for "Group Testing: models and applications" 78
On Approximate Jumbled Pattern Matching in Strings. 77
Trading off Worst and Expected Cost in Decision Tree Problems 77
Q-ary Ulam-Renyi game with constrained lies 75
Combinatorial pattern matching: 26th annual symposium, CPM 2015 Ischia Island, Italy, june 29 – july 1, 2015 proceedings 74
A Combinatorial Model of Two-Sided Search 74
Algorithms for Jumbled Pattern Matching in Strings 73
The Multi-interval Ulam-Rényi Game 73
Searching for Jumbled Patterns in Strings 72
Binary Identification Problems for Weighted Trees 72
The Binary Identification Problems for Weighted Trees 71
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence 71
On the Competitive Ratio of Evaluating Priced Functions 68
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching 64
Competitive Evaluation of Threshold Functions in the Priced Information Model 60
Competitive Boolean Function Evaluation. Beyond Monotonicity and the Symmetric Case 60
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences 60
Bubble-Flip—A new generation algorithm for prefix normal words 59
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost 58
Least adaptive optimal search with unreliable tests 57
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 56
Fault-Tolerant Search Algorithms 55
H(X) vs. H(f (X)) 54
Latency-bounded target set selection in social networks 53
Recent developments of feedback coding, and its relations with many-valued logic 53
Approximating decision trees with value dependent testing costs 52
Approximating probability distributions with short vectors, via information theoretic distance measures 52
Graphs of separability at most two 52
Decision Trees for Function Evaluation: Simultaneous Optimization of Worst and Expected Cost 49
On Infinite Prefix Normal Words 47
Superselectors: Efficient Constructions and Applications 46
On the complexity of searching in trees and partially ordered structures 46
Correction to: Trading Off Worst and Expected Cost in Decision Tree Problems 43
Approximating the maximum consecutive subsums of a sequence 42
On the Tree Search Problem with Non-uniform Costs 42
A Combinatorial Model of Two-Sided Search 42
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions 40
How to go Viral: Cheaply and Quickly 40
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 40
On lower bounds for the Maximum Consecutive Subsums Problem and the (min, +)-convolution 39
Spread of influence in weighted networks under time and budget constraints 39
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost 37
Latency-Bounded Target Set Selection in Social Networks 36
Trading Off Worst and Expected Cost in Decision Tree Problems 35
On the complexity of the vector connectivity problem 34
On the tree search problem with non-uniform costs 34
On Greedy Algorithms for Decision Trees 33
Bounds on the Entropy of a Function of a Random Variable and their Applications 33
Maximum Entropy Interval Aggregations 33
RatioRF: a novel measure for Random Forest clustering based on the Tversky's Ratio model 30
On the approximability and exact algorithms for vector domination and related problems in graphs 29
Hardness of MSA with Selective Column Scoring 28
On D-ary Fano Codes 28
New results on information theoretic clustering 25
On the Complexity of Directed Intersection Representation of {DAGs} 25
Teaching with limited information on the Learner{'}s behaviour 24
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice 24
On the Complexity of Searching in Trees: Average-Case Minimization 24
A Better Bouncer's Algorithm 23
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 22
How to find a joint probability distribution of minimum entropy (almost) given the marginals 22
On infinite prefix normal words 22
Distance-Based Random Forest Clustering with~Missing Data 21
Minimum-Entropy Couplings and Their Applications 18
On the star decomposition of a graph: Hardness results and approximation for the max{\textendash}min optimization problem 17
Optimal Approximation of Uniform Distributions with a Biased Coin 16
Faster Deterministic Communication in Radio Networks 16
Information Theoretical Clustering Is Hard to Approximate 16
The Tandem Duplication Distance Problem Is Hard over Bounded Alphabets 16
Hardness and approximation of multiple sequence alignment with column score 15
Using Random Forest Distances for Outlier Detection 14
On the Redundancy of D-Ary Fano Codes 14
The #DNN-Verification Problem: Counting Unsafe Inputs for Deep Neural Networks 9
On the Good Behaviour of Extremely Randomized Trees in Random Forest-Distance Computation 1
Totale 3.810
Categoria #
all - tutte 14.213
article - articoli 6.137
book - libri 175
conference - conferenze 7.059
curatela - curatele 201
other - altro 205
patent - brevetti 0
selected - selezionate 0
volume - volumi 436
Totale 28.426


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201913 0 0 0 0 0 0 0 0 0 0 3 10
2019/2020401 64 0 6 19 28 41 81 16 20 23 49 54
2020/2021559 60 102 33 59 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/2024403 21 46 38 35 56 48 25 40 11 83 0 0
Totale 3.810