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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022553 0 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/20265.260 242 259 1.429 268 769 881 533 113 227 194 198 147
2026/2027361 164 197 0 0 0 0 0 0 0 0 0 0
Totale 10.912