FARO, SIMONE
 Distribuzione geografica
Continente #
NA - Nord America 4.100
AS - Asia 1.555
EU - Europa 1.456
SA - Sud America 375
AF - Africa 155
OC - Oceania 9
Continente sconosciuto - Info sul continente non disponibili 5
Totale 7.655
Nazione #
US - Stati Uniti d'America 3.969
SG - Singapore 690
CN - Cina 604
IT - Italia 440
BR - Brasile 337
IE - Irlanda 299
UA - Ucraina 242
DE - Germania 143
CA - Canada 118
CI - Costa d'Avorio 106
FI - Finlandia 79
RU - Federazione Russa 75
KR - Corea 71
VN - Vietnam 60
GB - Regno Unito 36
NL - Olanda 28
FR - Francia 25
AR - Argentina 22
JP - Giappone 22
IN - India 16
CH - Svizzera 15
SE - Svezia 15
TR - Turchia 13
PL - Polonia 12
UZ - Uzbekistan 12
PK - Pakistan 11
ES - Italia 10
NG - Nigeria 10
SN - Senegal 9
AU - Australia 8
BJ - Benin 7
MA - Marocco 7
AT - Austria 6
EC - Ecuador 6
ID - Indonesia 6
IQ - Iraq 6
MX - Messico 6
SA - Arabia Saudita 6
ZA - Sudafrica 6
BD - Bangladesh 5
LT - Lituania 5
EU - Europa 4
KE - Kenya 4
LB - Libano 4
AZ - Azerbaigian 3
BE - Belgio 3
CO - Colombia 3
DK - Danimarca 3
HK - Hong Kong 3
HU - Ungheria 3
IL - Israele 3
IR - Iran 3
VE - Venezuela 3
AE - Emirati Arabi Uniti 2
AL - Albania 2
BG - Bulgaria 2
CZ - Repubblica Ceca 2
DO - Repubblica Dominicana 2
EE - Estonia 2
HN - Honduras 2
KZ - Kazakistan 2
OM - Oman 2
PH - Filippine 2
PY - Paraguay 2
SK - Slovacchia (Repubblica Slovacca) 2
TN - Tunisia 2
TW - Taiwan 2
AO - Angola 1
BA - Bosnia-Erzegovina 1
BN - Brunei Darussalam 1
BO - Bolivia 1
BY - Bielorussia 1
CL - Cile 1
CR - Costa Rica 1
DZ - Algeria 1
EG - Egitto 1
GE - Georgia 1
GR - Grecia 1
IS - Islanda 1
JM - Giamaica 1
JO - Giordania 1
KG - Kirghizistan 1
LK - Sri Lanka 1
MC - Monaco 1
MK - Macedonia 1
NE - Niger 1
NI - Nicaragua 1
NP - Nepal 1
NZ - Nuova Zelanda 1
RO - Romania 1
SY - Repubblica araba siriana 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 7.655
Città #
Dallas 1.391
Santa Clara 772
Singapore 328
Dublin 298
Chandler 247
Jacksonville 232
Hefei 173
Boardman 131
Catania 130
Abidjan 106
Lawrence 83
Toronto 83
Andover 82
Cambridge 82
Ashburn 77
Nanjing 73
Seoul 71
Beijing 67
Helsinki 61
Grafing 58
Council Bluffs 51
Des Moines 46
São Paulo 45
San Mateo 44
Bremen 33
Los Angeles 33
Messina 33
Wilmington 30
Columbus 29
Nanchang 29
Houston 25
The Dalles 25
Civitanova Marche 24
Munich 23
Shenyang 23
Hebei 21
Ottawa 21
Valverde 21
Chicago 20
Milan 18
Ho Chi Minh City 17
New York 17
San Francisco 17
Saint Petersburg 16
Buffalo 15
Jiaxing 15
Changsha 14
Palermo 14
Tianjin 14
Augusta 13
Lappeenranta 12
Nuremberg 12
Porto Alegre 11
Reggio Emilia 11
Tokyo 11
Montreal 10
Soccavo 10
Abuja 9
Amsterdam 9
Campinas 9
Dakar 9
Hanoi 9
San Giovanni la Punta 9
Turin 9
Belo Horizonte 8
Curitiba 8
Rio de Janeiro 8
Cotonou 7
Den Haag 7
Naples 7
Warsaw 7
Brooklyn 6
Norwalk 6
Palagonia 6
Phoenix 6
Rome 6
Salvador 6
Atlanta 5
Brasília 5
Licata 5
London 5
Moscow 5
Mumbai 5
Ragusa 5
Riyadh 5
Sorgono 5
West Jordan 5
Aracaju 4
Canicattì 4
Giardini-Naxos 4
Guangzhou 4
Guarulhos 4
Haiphong 4
Istanbul 4
Kunming 4
Liberty Lake 4
Madrid 4
Manchester 4
Melbourne 4
Milazzo 4
Totale 5.621
Nome #
Qutes: A High-Level Quantum Programming Language for Simplified Quantum Computing 456
Scaling Grover’s Search for Large Solution Spaces 424
Verifiable Pattern Matching on Outsourced Texts 128
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach 115
Text searching allowing for inversions and translocations of factors 112
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach 104
Adapting Boyer-Moore-like algorithms for searching Huffman encoded texts 100
Two-Levels Greedy: a generalization of Dijkstra's shortest path algorithm 97
A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem 92
2001-2010:Ten Years of Exact String Matching Algorithms 92
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs 90
A New Algorithm for Efficient Pattern Matching with Swaps 90
Searching for a substring with constant extra space complexity 90
A Faster Algorithm for the Single Source Shortest Path Problem in the Presence of Few Sources or Destinations of Negative Arcs 89
Compact suffix automata representations for searching long patterns 88
On some combinatorial problems concerning the harmonic structure of musical chord sequences 87
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns 87
An Efficient Algorithm for Approximate Pattern Matching with Swaps 86
Fast-Search algorithms: New efficient variants of the Boyer-Moore pattern-matching algorithm 81
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts 80
Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors 80
A Fast Suffix Automata Based Algorithm for Exact Online String Matching 79
String Matching with Inversions and Translocations in Linear Average Time (Most of the Time) 78
Efficient string-matching allowing for non-overlapping inversions 78
Improved and Self-Tuned Occurrence Heuristics 78
A Space-Efficient Implementation of the Good-Suffix Heuristic 78
The exact online string matching problem: A review of the most recent results 77
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm 77
An efficient matching algorithm for encoded DNA sequences and binary strings 74
New efficient bit-parallel algorithms for the (delta,alpha)-matching problem with applications in music information retrieval 73
The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples 72
An Efficient Algorithm for δ-Approximate-Matching with α-Bounded Gaps in Musical Sequences 72
A New Directly Accessible Compression Scheme 72
Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm 71
An Efficient Skip-Search Approach to Swap Matching 70
Efficient Online String Matching Based on Characters Distance Text Sampling 70
Practical Implementation of a Quantum String Matching Algorithm 69
Bit-Parallelism$^2$: Getting to the Next Level of Parallelism 69
Verifiable Pattern Matching on Outsourced Texts [2016] 69
Improved characters distance sampling for online and offline text searching 68
A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem 68
Efficient Variants of the Backward-Oracle-Matching Algorithm 68
18th International Symposium on Experimental Algorithms 67
Automatic Extraction of Semantic Relations by Using Web Statistical Information. 67
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem 66
Finite State Models for the Generation of Large Corpora of Natural Language Texts 66
On the Longest Common Cartesian Substring Problem 65
Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences 65
Efficient Algorithms for the Order Preserving Pattern Matching Problem 65
A Very Fast String Matching Algorithm Based on Condensed Alphabets 64
Quantum Path Parallelism: A Circuit-Based Approach to Text Searching 63
Il progetto Storage: dai dati al Web 63
Solving The (Delta, Alpha)-Approximate Matching Problem Under Transposition Invariance In Musical Sequences 63
The Range Automaton: An Efficient Approach to Text-Searching 63
Pattern matching with swaps in practice 62
Fast-insertion-sort: A new family of efficient variants of the insertion-sort algorithm 61
A weak approach to suffix automata simulation for exact and approximate string matching 61
Fast and flexible packed string matching 61
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms 61
The order-preserving pattern matching problem in practice 61
Quantum String Matching Unfolded and Extended 60
Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence 60
Improving Sampled Matching through Character Context Sampling 59
Pruned BNDM: Extending the Bit-Parallel Suffix Automaton to Long Strings 59
Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm 59
Approximate String Matching Allowing for Inversions and Translocations 59
Bit-Layers Text Encoding for Efficient Text Processing 59
On some combinatorial problems concerning the harmonic structure of musical chord sequences 57
Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences 57
Swap Matching in Strings by Simulating Reactive Automata 57
Fast Cartesian Tree Matching 57
Quantum Circuit Based Longest Common Substring 56
Pattern Matching for Control Chart Monitoring 56
Engineering order-preserving pattern matching with SIMD parallelism 56
Linear and efficient string matching algorithms based on weak factor recognition 56
Beyond Horspool: A Comparative Analysis in Sampled Matching 54
Fast Multiple String Matching Using Streaming SIMD Extensions Technology 54
On the Frequency of Characters in Natural Language Texts 54
Efficient Matching of Biological Sequences Allowing for Non-Overlapping Inversions 53
Towards a Very Fast Multiple String Matching Algorithm for Short Patterns 53
Speeding Up String Matching by Weak Factor Recognition 53
Fast algorithms for single and multiple pattern Cartesian tree matching 53
Enhancing Characters Distance Text Sampling by Condensed Alphabets 52
On Tuning The (Delta,Alpha)-Sequential-Sampling Algorithm For Delta-Approximate Matching With Alpha-Bounded Gaps In Musical Sequences 52
Fast Shortest Paths Algorithms in the Presence of Few Negative Arcs 52
Practical Quantum Combinatorial String Matching 51
The String Matching Algorithms Research Tool 51
Shape-preserving pattern matching 51
Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton 50
Efficient online abelian pattern matching in strings by simulating reactive multi-automata 49
New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences 49
Sequence searching allowing for non-overlapping adjacent unbalanced translocations 49
Nucleotide Sequence Alignment and Compression via Shortest Unique Substring 48
An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem 48
Families of Constant-Depth Quantum Circuits for Rotations and Permutations 47
Fast searching in biological sequences using multiple hash functions 47
Fast Packed String Matching for Short Patterns 47
Improved and Self-Tuned Occurrence Heuristics 47
Pattern matching with swaps for short patterns in linear time 46
Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm 44
Totale 7.463
Categoria #
all - tutte 26.293
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 26.293


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021297 0 0 0 0 124 5 35 1 103 0 25 4
2021/2022622 69 78 10 2 86 0 86 19 57 0 10 205
2022/2023870 85 8 22 83 89 155 1 140 228 8 29 22
2023/2024603 29 98 17 27 34 61 8 9 7 141 97 75
2024/20252.252 11 171 101 97 604 358 68 134 167 177 162 202
2025/20262.513 242 259 1.429 268 315 0 0 0 0 0 0 0
Totale 7.804