CICALESE, Ferdinando
 Distribuzione geografica
Continente #
NA - Nord America 4.277
EU - Europa 898
AS - Asia 405
OC - Oceania 3
Continente sconosciuto - Info sul continente non disponibili 2
SA - Sud America 1
Totale 5.586
Nazione #
US - Stati Uniti d'America 4.254
UA - Ucraina 364
CN - Cina 222
IT - Italia 189
VN - Vietnam 118
DE - Germania 110
IE - Irlanda 89
FI - Finlandia 80
TR - Turchia 50
SE - Svezia 39
CA - Canada 22
RU - Federazione Russa 10
IN - India 7
NL - Olanda 6
GB - Regno Unito 4
FR - Francia 3
AU - Australia 2
EU - Europa 2
HK - Hong Kong 2
IL - Israele 2
LU - Lussemburgo 2
SG - Singapore 2
BR - Brasile 1
HU - Ungheria 1
JP - Giappone 1
MX - Messico 1
NZ - Nuova Zelanda 1
PK - Pakistan 1
PL - Polonia 1
Totale 5.586
Città #
Ann Arbor 1.162
Woodbridge 514
Wilmington 466
Jacksonville 421
Chandler 382
Houston 312
Princeton 276
Dong Ket 118
Dublin 89
Seattle 78
Andover 74
Nanjing 73
Pellezzano 66
Ashburn 63
Boardman 56
Izmir 50
Mestre 38
Fairfield 29
Cava 27
Nanchang 25
Shenyang 24
Changsha 21
Düsseldorf 20
Hebei 19
Norwalk 19
Ottawa 19
Beijing 17
Dearborn 16
Jiaxing 16
Giugliano In Campania 12
Falls Church 9
Salerno 9
Cambridge 7
Tianjin 7
Pune 6
Helsinki 5
Indiana 5
Jinan 5
Los Angeles 5
Dormagen 4
San Diego 4
Verona 4
Cagliari 3
Fuzhou 3
Hanover 3
Hoogvliet 3
Spinea 3
Tappahannock 3
Venezia 3
Amsterdam 2
Hong Kong 2
Lonato 2
Lynnwood 2
Nuremberg 2
San Francisco 2
Secaucus 2
Taiyuan 2
Washington 2
Adelaide 1
Angers 1
Angri 1
Auckland 1
Budapest 1
Clarksburg 1
Dallas 1
Delhi 1
Denver 1
Edinburgh 1
Epsom 1
Everett 1
Georgetown 1
Haikou 1
Lake Arrowhead 1
Luxembourg 1
Mcallen 1
Melbourne 1
Mexico City 1
Montreal 1
Napoli 1
New York 1
Ningbo 1
Phoenix 1
Redmond 1
Redwood City 1
Richmond Hill 1
San Jose 1
Siena 1
Singapore 1
São Paulo 1
Taizhou 1
Warren 1
Warsaw 1
Yellow Springs 1
Zhengzhou 1
Totale 4.647
Nome #
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost 354
Binary Identification Problems for Weighted Trees 117
Binary Search with Delayed and Missing Answers 112
Information Theoretic Measures of Distances and their Econometric Applications 106
Bounding the Average Length of Optimal Source Codes 104
A Fuzzy Evolutionary Approach to the Classification Problem 101
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 100
Supermodularity and Subadditivity Properties of the Entropy on the Majorization Lattice 98
Two Batch Search With Lie Cost 98
A Linear Algorithm for String Reconstruction in the Reverse Complement Equivalence Model 96
Superselectors: Efficient Constructions and Applications 94
Ulam-Renyi game with constrained lies 93
Q-Ary Ulam-Renyi Game with Weighted Constrained Lies 90
Approximating the maximum consecutive subsums of a sequence 90
Combinatorial Pattern Matching- Proceedings of 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 90
Searching with lies under error cost constraints 88
Recent developments of feedback coding, and its relations with many-valued logic 87
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 87
The Multi-interval Ulam-Rényi Game 86
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 85
On the competitive ratio of evaluating priced functions 85
The Binary Identification Problems for Weighted Trees 82
Rota-Metropolis cubic logic and Ulam-Renyi games 81
Tunstall Parse Trees Optimum under Various Criteria 80
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 80
Searching with lie under error cost constraints 78
Perfect, Minimally Adaptive, Error-Correcting Searching Strategies 78
On Searching Strategies, Parallel Questions, and Delayed Answers 77
An Optimal Algorithm for Querying Priced Information 76
Competitive Evaluation of Threshold Functions in the Priced Information Model 76
Optimal Strategies Against a Liar 75
Learning and the Art of Fault-tolerant Guesswork 75
Perfect Minimally Adaptive q-ary Search with Unreliable Tests 75
Competitive Boolean Function Evaluation. Beyond Monotonicity and the Symmetric Case 75
A new strategy for querying priced information 75
A Note on Approximation of Uniform Distributions from Variable-to-Fixed Length Codes 75
Bounding the Average Length of Optimal Source Codes via Majorization Theory 74
On the Complexity of Searching in Trees: Average-Case Minimization 74
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence 74
A fuzzy evolutionary approach to the classification problem 73
Algorithms for Jumbled Pattern Matching in Strings 72
On the approximability and exact algorithms for vector domination and related problems in graphs 71
Faster Deterministic Communication in Radio Networks 68
On Greedy Algorithms for Decision Trees 68
Can Actors learn by evolving models of fuzzy reasoning? 67
Overlaps Help: Improved Bounds for Group Testing with Interval Queries 66
On Approximate Jumbled Pattern Matching in Strings 66
Searching for Jumbled Patterns in Strings 66
Function Evaluation via Linear Programming Approach in the Priced Information Model 65
On the Competitive Ratio of Evaluating Priced Functions 65
Graphs of separability at most two 65
Faster Centralized Communication in Radio Networks 64
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences 62
On the complexity of searching in trees and partially ordered structures 62
2-Stage Fault Tolerant Interval Group Testing 61
QUASI -PERFECT MINIMALLY ADAPTIVE Q-ARY SEARCH WITH UNRELIABLE TESTS 60
An Improved Heuristic for Ulam-Renyi Game 60
A new strategy for querying priced information 59
Least Adaptive Optimal Search with Unreliable Tests 55
Coping with Delays and Time-Outs in Binary Search Procedures 54
A Better Bouncer's Algorithm 54
The Entropy is Supermodular on the Majorization Lattice 53
Q-ary searching with lies 53
Efficient Reconstruction of RC-Equivalent Strings 53
Q-ary Ulam-Rényi game with constrained lies 51
Overlaps Help: Improved Bounds for Group Testing with Interval Queries'' 50
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness 50
Fault-Tolerant Search Algorithms 48
Optimal coding with one asymmetric error: Below the Sphere Packing Bound 46
Computing with Priced Information: When the Value Makes the Price 44
On Searching Strategies, Parallel Questions, and Delayed Answers 42
Perfect 2-fault tolerant search with minimum adaptiveness 40
Recent Developments of feedback coding, and its relations with many-valued logic 40
Fault-Tolerant Search Algorithms 39
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching 35
Totale 5.688
Categoria #
all - tutte 12.075
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 12.075


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201961 0 0 0 0 0 0 0 0 0 0 60 1
2019/2020907 182 3 76 1 151 204 85 6 79 20 85 15
2020/2021574 5 75 56 0 72 8 73 0 78 2 79 126
2021/2022491 0 0 1 8 16 20 6 24 78 64 59 215
2022/2023820 83 52 9 129 107 187 0 78 122 2 38 13
2023/2024207 40 39 10 10 22 29 9 16 0 32 0 0
Totale 5.688