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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/202129 0 0 0 0 0 0 0 0 0 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/20264.920 242 259 1.429 268 769 881 534 113 228 194 3 0
Totale 10.211