UniSa - IRIS Institutional Research Information System

CICALESE, Ferdinando
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.399
EU - Europa 925
AS - Asia 412
Continente sconosciuto - Info sul continente non disponibili 3
OC - Oceania 3
SA - Sud America 1
Totale 5.743
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.378
UA - Ucraina 378
CN - Cina 228
IT - Italia 194
VN - Vietnam 118
DE - Germania 110
IE - Irlanda 97
FI - Finlandia 78
TR - Turchia 52
SE - Svezia 43
CA - Canada 20
RU - Federazione Russa 10
IN - India 7
NL - Olanda 5
GB - Regno Unito 4
EU - Europa 3
AU - Australia 2
FR - Francia 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
PL - Polonia 1
Totale 5.743
Salva come PNG Salva come JPEG
Città #
Ann Arbor 1.193
Woodbridge 531
Wilmington 476
Jacksonville 437
Chandler 407
Houston 343
Princeton 285
Dong Ket 118
Dublin 97
Andover 78
Nanjing 76
Seattle 73
Pellezzano 69
Izmir 52
Ashburn 48
Boardman 45
Mestre 38
Fairfield 30
Cava 27
Shenyang 26
Nanchang 25
Changsha 21
Norwalk 21
Hebei 20
Düsseldorf 19
Ottawa 19
Beijing 17
Dearborn 17
Jiaxing 16
Giugliano In Campania 12
Salerno 11
Falls Church 9
Cambridge 7
Tianjin 7
Pune 6
Indiana 5
Jinan 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
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
Haikou 1
Los Angeles 1
Luxembourg 1
Mcallen 1
Melbourne 1
Mexico City 1
Mountain View 1
Napoli 1
New York 1
Ningbo 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.769
Salva come PNG Salva come JPEG
Nome #
Diagnosis determination: decision trees optimizing simultaneously worst and expected testing cost 354
Binary Identification Problems for Weighted Trees 116
Binary Search with Delayed and Missing Answers 109
Bounding the Average Length of Optimal Source Codes 104
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 100
Two Batch Search With Lie Cost 99
Supermodularity and Subadditivity Properties of the Entropy on the Majorization Lattice 97
Information Theoretic Measures of Distances and their Econometric Applications 96
A Linear Algorithm for String Reconstruction in the Reverse Complement Equivalence Model 95
Ulam-Renyi game with constrained lies 93
Superselectors: Efficient Constructions and Applications 93
A Fuzzy Evolutionary Approach to the Classification Problem 92
Approximating the maximum consecutive subsums of a sequence 90
Q-Ary Ulam-Renyi Game with Weighted Constrained Lies 89
Combinatorial Pattern Matching- Proceedings of 26th Annual Symposium on Combinatorial Pattern Matching, CPM 2015 89
Searching with lies under error cost constraints 88
The Multi-interval Ulam-Rényi Game 86
Recent developments of feedback coding, and its relations with many-valued logic 85
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 85
Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs 84
On the competitive ratio of evaluating priced functions 84
The Binary Identification Problems for Weighted Trees 82
Optimal Group Testing Strategies with Interval Queries and their Application to Splice Site Detection 81
Combinatorics of Searching, Sorting and Coding 81
Rota-Metropolis cubic logic and Ulam-Renyi games 80
Tunstall Parse Trees Optimum under Various Criteria 79
Searching with lie under error cost constraints 78
Perfect, Minimally Adaptive, Error-Correcting Searching Strategies 78
Competitive Evaluation of Threshold Functions in the Priced Information Model 77
On Searching Strategies, Parallel Questions, and Delayed Answers 76
An Optimal Algorithm for Querying Priced Information 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 74
Bounding the Average Length of Optimal Source Codes via Majorization Theory 73
Optimal Strategies Against a Liar 73
On the Complexity of Searching in Trees: Average-Case Minimization 73
Algorithms for Jumbled Pattern Matching in Strings 73
Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence 73
A fuzzy evolutionary approach to the classification problem 71
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
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 68
Can Actors learn by evolving models of fuzzy reasoning? 67
Overlaps Help: Improved Bounds for Group Testing with Interval Queries 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
On Approximate Jumbled Pattern Matching in Strings 65
Improved Approximation Algorithms for the Average-Case Tree Searching Problem 65
Faster Centralized Communication in Radio Networks 64
2-Stage Fault Tolerant Interval Group Testing 61
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences 61
On the complexity of searching in trees and partially ordered structures 61
QUASI -PERFECT MINIMALLY ADAPTIVE Q-ARY SEARCH WITH UNRELIABLE TESTS 60
An Improved Heuristic for Ulam-Renyi Game 59
A new strategy for querying priced information 58
Least Adaptive Optimal Search with Unreliable Tests 54
Coping with Delays and Time-Outs in Binary Search Procedures 54
The Entropy is Supermodular on the Majorization Lattice 53
Q-ary searching with lies 53
A Better Bouncer's Algorithm 53
Efficient Reconstruction of RC-Equivalent Strings 53
Q-ary Ulam-Rényi game with constrained lies 50
Overlaps Help: Improved Bounds for Group Testing with Interval Queries'' 50
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness 49
Fault-Tolerant Search Algorithms 48
Optimal coding with one asymmetric error: Below the Sphere Packing Bound 45
Computing with Priced Information: When the Value Makes the Price 44
On Searching Strategies, Parallel Questions, and Delayed Answers 41
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.849
Salva come PNG Salva come JPEG
Categoria #
all - tutte 10.860
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 10.860
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019302 0 0 0 0 0 95 45 62 20 16 63 1
2019/2020931 188 3 79 1 153 206 90 6 82 20 88 15
2020/2021593 5 78 58 0 75 9 76 0 81 2 82 127
2021/2022513 0 0 1 8 17 20 7 25 81 67 61 226
2022/2023865 87 57 13 134 110 195 0 81 134 2 39 13
2023/2024157 41 42 10 11 23 30 0 0 0 0 0 0
Totale 5.849