CANTONE, Domenico
 Distribuzione geografica
Continente #
NA - Nord America 3.509
EU - Europa 2.579
AS - Asia 607
AF - Africa 283
Continente sconosciuto - Info sul continente non disponibili 5
OC - Oceania 4
SA - Sud America 2
Totale 6.989
Nazione #
US - Stati Uniti d'America 3.261
IE - Irlanda 801
UA - Ucraina 614
CN - Cina 535
IT - Italia 456
DE - Germania 289
CA - Canada 248
CI - Costa d'Avorio 175
RU - Federazione Russa 163
SE - Svezia 72
SN - Senegal 70
GB - Regno Unito 46
NG - Nigeria 33
CH - Svizzera 28
BE - Belgio 21
FR - Francia 18
JP - Giappone 15
CZ - Repubblica Ceca 13
UZ - Uzbekistan 13
IN - India 12
RO - Romania 12
VN - Vietnam 12
AT - Austria 10
NL - Olanda 9
PL - Polonia 9
LB - Libano 7
EU - Europa 5
TR - Turchia 4
ZA - Sudafrica 4
AU - Australia 3
EE - Estonia 3
ES - Italia 3
GR - Grecia 3
FI - Finlandia 2
HK - Hong Kong 2
OM - Oman 2
SA - Arabia Saudita 2
SK - Slovacchia (Repubblica Slovacca) 2
BG - Bulgaria 1
BR - Brasile 1
CL - Cile 1
DK - Danimarca 1
HU - Ungheria 1
IS - Islanda 1
LU - Lussemburgo 1
MA - Marocco 1
MN - Mongolia 1
NZ - Nuova Zelanda 1
TH - Thailandia 1
TW - Taiwan 1
Totale 6.989
Città #
Dublin 801
Chandler 794
Jacksonville 575
Andover 218
Lawrence 193
Cambridge 191
Nanjing 187
Abidjan 175
Toronto 169
Grafing 156
San Mateo 122
Bremen 114
Ashburn 99
Catania 99
Des Moines 92
Wilmington 82
Boardman 80
Ottawa 73
Dakar 70
Nanchang 66
Houston 57
Hebei 52
Shenyang 51
Saint Petersburg 38
Jiaxing 35
Changsha 34
Abuja 33
Tianjin 21
Brussels 19
Milan 18
Beijing 15
Rome 14
Palermo 12
Caltagirone 11
Horia 11
Norwalk 11
Dong Ket 10
Pune 10
San Francisco 10
Boydton 9
Brno 9
Carlentini 9
Kunming 9
Moscow 9
Civitavecchia 8
Jinan 8
Liberty Lake 8
Redwood City 8
Seattle 8
Washington 8
Den Haag 7
Hangzhou 7
Syracuse 7
Zhengzhou 7
Fairfield 6
Gela 6
Modica 6
Tokyo 6
Foligno 5
Lausanne 5
Niscemi 5
Reggio Calabria 5
Riposto 5
Sant'Agata di Militello 5
Taizhou 5
Turin 5
Caserta 4
Chicago 4
Edinburgh 4
Floridia 4
Hanover 4
Johannesburg 4
Kiev 4
London 4
Messina 4
Misterbianco 4
New York 4
Princeton 4
Ramacca 4
Tremestieri Etneo 4
Ancona 3
Ann Arbor 3
Changchun 3
Frankfurt Am Main 3
Lanzhou 3
Longobardi 3
Ningbo 3
Olgiate Olona 3
Padova 3
Porto Recanati 3
Tallinn 3
Venezia 3
Abbiategrasso 2
Bruges 2
Castel di Judica 2
Enna 2
Fiumefreddo Di Sicilia 2
Fort St. James 2
Garessio 2
Guangzhou 2
Totale 5.111
Nome #
Antipole Tree Indexing to Support Range Search and K-Nearest Neighbor Search in Metric Spaces 94
Congruence relations on a choice space 88
A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions, I: The Two-Level Case 86
Choice resolutions 76
A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions 61
A Computerized Referee 61
A C++ reasoner for the description logic DL4;× D? 61
A Sound Framework for delta-rule Variants in Free Variable Semantic Tableaux 56
Congruence Relations on a Choice Space: Revealed Indiscernibility 56
An efficient approximate algorithm for the 1-median problem in metric spaces 55
Decidability results for classes of purely universal formulae and quantifiers elimination in set theory. 55
A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions 55
Searching for a substring with constant extra space complexity 55
A certification of Lagrange's theorem with the proof assistant Ætnanova/Referee 54
A decidable fragment of the elementary theory of relations and some applications 54
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach 53
A Set-Based Reasoner for the Description Logic DL4, xD 53
Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate 52
The shape of a Benedictine monastery: The SaintGall ontology 52
A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem 49
Fast-Search algorithms: New efficient variants of the Boyer-Moore pattern-matching algorithm 49
A Combined Greedy-Walk Heuristic and Simulated Annealing Approach for the Closest String Problem 49
Solvable set/hyperset contexts: III. A tableau system for a fragment of hyperset theory 49
A certification of Lagrange's theorem with the proof assistant AEtnanova/Referee 49
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach 49
A Decidable Quantified Fragment of Set Theory Involving Ordered Pairs with Applications to Description Logics 49
A variant of Turing machines with no control states and its connection to bounded temporal memory 49
(m,n)-rationalizable choices 49
Effective memory fault injection attacks: formalization and properties 48
Towards an ontology-based framework for a behavior-oriented integration of the IoT 48
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs 47
Decision procedures for elementary sublanguages of set theory. VI. Multi‐level syllogistic extended by the powerset operator 47
A Decision Procedure for Monotone Functions over Bounded and Complete Lattices 47
The decision problem in graph theory with reachability related constructs 47
A graphical representation of relational formulae with complementation 47
Gerarchie Cumulative e Computabilità sopra Universi di Insiemi 47
On some combinatorial problems concerning the harmonic structure of musical chord sequences 46
A graphical representation of relational formulae with complementation 46
Text searching allowing for inversions and translocations of factors 46
Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts 46
A New Algorithm for Efficient Pattern Matching with Swaps 46
A General Proviso for Existential Quantifiers Elimination in Free Variable Semantic Tableaux 46
null 46
An ontology for the iconographic sources of la divina commedia 46
Cumulative hierarchies and computability over universes of sets 45
Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set‐theoretic formulae 45
Applications of formative processes to the decision problem in set theory 45
A set-theoretic approach to ABox reasoning services 45
Distant reading through ontologies: The case study of catania's benedictines monastery 45
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm 45
An Optimized KE-Tableau-Based System for Reasoning in the Description Logic $${\mathcal {DL}}_{{\mathbf {D}}}^{4, \!\times }$$ 45
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic 44
Conjunctive Query Answering via a Fragment of Set Theory 44
An Efficient Algorithm for Approximate Pattern Matching with Swaps 44
A decision procedure for a two-sorted extension of Multi-Level Syllogistic with the Cartesian product and some map constructs 44
A Space-Efficient Implementation of the Good-Suffix Heuristic 44
An OWL framework for rule-based recognition of places in Italian non-structured text 43
An Introduction to the Technique of Formative Processes in Set Theory 43
Decision procedures for elementary sublanguages of set theory. IV. Formulae involving a rank operator or one occurrence of (x) = { {y} | y Î x} 43
Compiling dyadic first-order specifications into map algebra 42
QuickHeapsort: an efficient mix of classical sorting algorithms 42
A Decision Procedure for Monotone Functions over Lattices 42
A fast saturation strategy for set-theoretic tableaux 42
Computational logic and set theory: Applying formalized logic to analysis 42
A Faster Algorithm for the Single Source Shortest Path Problem in the Presence of Few Sources or Destinations of Negative Arcs 42
Web Ontology Representation and Reasoning via Fragments of Set Theory 41
Bit-Parallelism$^2$: Getting to the Next Level of Parallelism 41
Techniques of computable set theory with applications to proof verification 41
Topological syllogistic with continuous and closed functions 41
OntoCeramic: an OWL ontology for ceramics classification 41
Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators 41
The ideal Benedictine Monastery: From the Saint Gall map to ontologies 41
28th Italian Conference on Computational Logic (CILC 2013) 40
Can a single equation witness that every r.e. set admits a finite-fold Diophantine representation? 40
A decidable theory treating addition of differentiable real functions 40
Efficient string-matching allowing for non-overlapping inversions 39
Improved and Self-Tuned Occurrence Heuristics 39
Decision procedures for elementary sublanguages of Set Theory. X. Multilevel syllogistic extended by the singleton and powerset 39
The Decision Problem for a Three-sorted Fragment of Set Theory with Restricted Quantification and Finite Enumerations. 39
Solving The (Delta, Alpha)-Approximate Matching Problem Under Transposition Invariance In Musical Sequences 39
A Dual Tableau-based Decision Procedure for a Relational Logic with the Universal Relation 39
A potential-based variant of the Bellman-Ford algorithm 39
A decidable theory of differentiable functions with convexities and concavities on real intervals 39
Blockchains through ontologies: the case study of the Ethereum ERC721 standard in OASIS 38
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns 38
Decision algorithms for some fragments of analysis and related areas 38
A Tableau Calculus for Integrating First-Order Reasoning with Elementary Set Theory Reasoning in the presence of Monotone Functions 38
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces 38
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts 38
Approximate String Matching Allowing for Inversions and Translocations 38
Herbrand-satisfiability of a Quantified Set-theoretic Fragment 38
Decision algorithms for fragments of real analysis. I. Continuous functions with strict convexity and concavity predicates 38
Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences 37
A new fast tableau-based decision procedure for an unquantified fragment of set theory 37
On existentially quantified conjunctions of atomic formulae of L+ 37
A Tableau-Based Decision Procedure for a Fragment of the Hyperset Theory 37
Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm 37
Computing efficiently the closeness of word sets in natural language texts 36
Set-theoretic reductions of Hilbert's tenth problem 36
A decidable quantified fragment of set theory with ordered pairs and some undecidable extensions 36
Totale 4.634
Categoria #
all - tutte 22.982
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 22.982


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201932 0 0 0 0 0 0 0 0 1 6 5 20
2019/2020994 375 55 75 22 70 25 60 18 101 13 143 37
2020/20211.156 48 98 132 12 289 22 116 24 259 9 100 47
2021/20221.448 164 197 5 15 208 0 243 61 158 5 46 346
2022/20232.577 224 105 51 316 236 414 7 399 634 12 109 70
2023/2024734 66 221 49 73 85 134 31 68 7 0 0 0
Totale 7.412