MANZINI, GIOVANNI
 Distribuzione geografica
Continente #
NA - Nord America 7.447
AS - Asia 3.547
EU - Europa 2.086
SA - Sud America 600
Continente sconosciuto - Info sul continente non disponibili 244
AF - Africa 66
OC - Oceania 5
Totale 13.995
Nazione #
US - Stati Uniti d'America 7.249
SG - Singapore 1.138
CN - Cina 890
IT - Italia 783
HK - Hong Kong 770
BR - Brasile 500
VN - Vietnam 280
SE - Svezia 271
BG - Bulgaria 247
FR - Francia 154
TR - Turchia 148
CA - Canada 125
RU - Federazione Russa 125
DE - Germania 118
UA - Ucraina 93
GB - Regno Unito 85
KR - Corea 69
FI - Finlandia 56
JP - Giappone 56
BD - Bangladesh 38
PL - Polonia 35
CH - Svizzera 34
AR - Argentina 32
IN - India 32
NL - Olanda 30
IQ - Iraq 22
MX - Messico 22
CI - Costa d'Avorio 21
JM - Giamaica 20
CO - Colombia 16
EC - Ecuador 16
ZA - Sudafrica 15
BE - Belgio 14
VE - Venezuela 14
CL - Cile 12
ES - Italia 11
SA - Arabia Saudita 11
CR - Costa Rica 10
LB - Libano 10
PK - Pakistan 10
AT - Austria 9
UZ - Uzbekistan 9
ID - Indonesia 8
PH - Filippine 7
AE - Emirati Arabi Uniti 6
MY - Malesia 6
AU - Australia 5
HN - Honduras 5
IR - Iran 5
LT - Lituania 5
MA - Marocco 5
SN - Senegal 5
TW - Taiwan 5
BJ - Benin 4
IL - Israele 4
KE - Kenya 4
NP - Nepal 4
AZ - Azerbaigian 3
BB - Barbados 3
CZ - Repubblica Ceca 3
DZ - Algeria 3
EG - Egitto 3
GT - Guatemala 3
NG - Nigeria 3
NI - Nicaragua 3
PE - Perù 3
PS - Palestinian Territory 3
PY - Paraguay 3
UY - Uruguay 3
CY - Cipro 2
HR - Croazia 2
IE - Irlanda 2
KZ - Kazakistan 2
OM - Oman 2
PT - Portogallo 2
RS - Serbia 2
SV - El Salvador 2
TN - Tunisia 2
TT - Trinidad e Tobago 2
AL - Albania 1
BH - Bahrain 1
BO - Bolivia 1
DO - Repubblica Dominicana 1
EE - Estonia 1
JO - Giordania 1
KG - Kirghizistan 1
KW - Kuwait 1
KY - Cayman, isole 1
LK - Sri Lanka 1
LU - Lussemburgo 1
MK - Macedonia 1
MM - Myanmar 1
PA - Panama 1
RO - Romania 1
SC - Seychelles 1
TH - Thailandia 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 13.752
Città #
Ashburn 868
Hong Kong 766
Singapore 600
Santa Clara 552
San Jose 537
Woodbridge 485
Fairfield 455
Ann Arbor 407
Houston 286
Shanghai 271
Chandler 259
Sofia 246
New York 223
Beijing 211
Council Bluffs 192
Dallas 188
Seattle 183
Milan 179
Wilmington 169
Cambridge 156
Jacksonville 124
Boardman 120
Princeton 119
Staranzano 116
Lawrence 107
Los Angeles 105
Lauterbourg 95
Hefei 81
Ho Chi Minh City 81
Istanbul 77
Ottawa 75
Serra 71
Seoul 66
Medford 58
Florence 56
San Diego 56
Tokyo 55
Buffalo 50
Dong Ket 48
Nanjing 44
Redondo Beach 37
Izmir 36
Pisa 34
Bern 33
Hanoi 33
Rome 31
Des Moines 30
Warsaw 30
Marseille 27
Chicago 25
São Paulo 25
Washington 23
Munich 22
Abidjan 21
Frankfurt am Main 20
Jüchen 19
Nanchang 19
Kocaeli 16
Springfield 16
San Salvo 15
Atlanta 14
Helsinki 14
Los Lunas 14
Ogden 14
Montreal 13
Norwalk 13
Redwood City 13
Rio de Janeiro 13
San Francisco 13
Altoona 12
Brussels 12
Prineville 12
Baltimore 11
Belo Horizonte 11
Düsseldorf 11
Bologna 10
Boston 10
Brasília 10
Columbus 10
Dearborn 10
Kingston 10
London 10
Shenyang 10
The Dalles 10
Baghdad 9
Boulder 9
Brooklyn 9
Fort Worth 9
Nuremberg 9
Phoenix 9
Porto Alegre 9
San Giuliano Terme 9
Tashkent 9
Toronto 9
Amsterdam 8
Garland 8
Hebei 8
Jiaxing 8
North Bergen 8
Piscataway 8
Totale 9.767
Nome #
Compressed Representations of sequences and full-text indexes 314
An alphabet friendly FM-index 289
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices 236
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression 212
Estimating an Eigenvector by the power method with a random start 209
On the randomized error of polynomial methods for eigenvector and eigenvalue estimates 203
Compressing and Indexing Labeled Trees, with Applications 197
Inversion of Circulant matrices over Z_m 192
Compressing and Searching XML Data Via Two Zips 191
Compressing and indexing labeled trees, with applications 189
Theoretical Computer Science: Special Issue on the Burrows-Wheeler Transform 186
METHOD OF STRUCTURING AND COMPRESSING LABELED TREES OF ARBITRARY DEGREE AND SHAPE 186
Structuring labeled trees for optimal succinctness, and beyond 186
Engineering a lightweight suffix array construction algorithm 185
The Myriad Virtues of Wavelet Trees 185
Kolmogorov Complexity, Information Theory and Compression Based Classification of Biological Sequences and Structures: Theory versus Practice 182
Boosting Textual Compression 182
Boosting Textual Compression 175
Lightweight Data Indexing and Compression in External Memory 174
Compression boosting in optimal linear time 170
An experimental study of an opportunistic index 169
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates: Numerical Tests. 166
Burrows-Wheeler Transform 165
Matrix rank and communication complexity 163
Engineering a Lightweight Suffix Array Construction Algorithm 160
An experimental study of a compressed index 158
An encoding for order-preserving matching 157
On compressing the textual web 155
Indexing compressed texts 154
The myriad virtues of wavelet trees 150
Lightweight data indexing and compression in external memory 148
The Alternating BWT: An algorithmic perspective 144
Computing matching statistics on Wheeler DFAs 139
Inversion of Circulant Matrices over Zm 139
Finding Exact Solutions to the Bandwidth Minimization Problem 139
Opportunistic Data Structures with Applications 122
null 120
Repetition- and Linearity-Aware Rank/Select Dictionaries 118
EZcount: An all-in-one software for microRNA expression quantification from NGS sequencing data 117
Compressing and Querying Integer Dictionaries Under Linearities and Repetitions 117
PHONI: Streamed Matching Statistics with Multi-Genome References 115
Compression boosting in optimal linear time using the Burrows-Wheeler Trasform 112
Procedimento di Compressione e ricerca su un insieme di dati basato su strategie multiple 112
Efficiently Merging r-indexes 111
Space Efficient Merging of de Bruijn Graphs and Wheeler Graphs 110
Compressing and indexing aligned readsets 110
A new class of searchable and provably highly compressible string transformations 109
Practical Random Access to SLP-Compressed Texts 103
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment 100
PFP compressed suffix trees 99
A Compact Index for Order-Preserving Pattern Matching 95
External memory BWT and LCP computation for sequence collections with applications 94
Computing the LCP Array of a Labeled Graph 94
The Burrows-Wheeler Transform: Theory and Practice 93
Spaced Seeds Design Using Perfect Rulers 91
A compact index for order-preserving pattern matching 90
Rpair: Rescaling RePair with Rsync 89
Compressed Spaced Suffix Arrays 89
Space-Efficient Merging of Succinct de Bruijn Graphs 88
XBWT Tricks 88
A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm 88
An Analysis of the Burrows-Wheeler Transform 86
Wheeler graphs: A framework for BWT-based data structures 86
Matching Reads to Many Genomes with the r-Index 86
Algebraic techniques in communication complexity 83
Efficient and compact representations of some non-canonical prefix-free codes 83
The Landscape of Compressibility Measures for Two-Dimensional Data 82
Efficient Construction of a Complete Index for Pan-Genomics Read Alignment 82
Encyclopedia of Algorithms: Dictionary-Based Data Compression 82
Compression of Low Entropy Strings with Lempel-Ziv Algorithms 82
BIDA*: an Improved Perimeter Search Algorithm 81
A Simple and Fast DNA Compression Algorithm 81
A new class of string transformations for compressed text indexing 80
Block Sorting-Based Transformations on Words: Beyond the Magic BWT 80
Compressibility Measures for Two-Dimensional Data 80
On the Ordering of Sparse Linear Systems 80
Computational Biology 80
Generalization of Repetitiveness Measures for Two-Dimensional Strings 79
Global Strategies for Augmenting the Efficiency of TSP Heuristics 79
Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP 79
Ergodicity, Transitivity, and Regularity for Additive Cellular Automata over Zm 79
Better Spaced Seeds Using Quadratic Residues 79
Move-to-Front, Distance Coding, and Inversion Frequencies Revisited 78
Succinct representations of trees 78
Two Space Saving Tricks for Linear Time LCP Array Computation 78
A census of tandemly repeated polymorphic loci in genic regions through the comparative integration of human genome assemblies 78
Lightweight BWT and LCP merging via the gap algorithm 77
On Computing the Entropy of Cellular Automata 77
Prefix-free parsing for building big BWTs 77
External memory BWT and LCP computation for sequence collections with applications 77
Inversion of two-level Circulan Matrices over Zp 77
The Rational Construction of a Wheeler DFA 76
Lightweight merging of compressed indices based on BWT variants 75
Sparse Matrix Computations on the Hypercube and Related Networks 75
Attractors of Linear Cellular Automata 74
Parallel Complexity of Numerically Accurate Linear System Solvers 74
Compressed Spaced Suffix Arrays 73
Ergodicity, transitivity, and regularity for linear cellular automata over Zm 73
Inducing the Lyndon Array 72
Efficient and Compact Representations of Some Non-Canonical Prefix-Free Codes 72
Totale 12.093
Categoria #
all - tutte 44.854
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 44.854


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022961 0 0 40 43 186 140 75 53 71 30 110 213
2022/2023832 167 85 36 74 79 93 7 72 148 1 60 10
2023/20241.030 78 92 185 55 140 243 33 19 20 31 31 103
2024/20253.328 16 131 29 134 349 314 319 188 403 460 416 569
2025/20263.536 219 380 303 371 321 327 549 193 251 374 67 181
2026/20271.077 82 239 756 0 0 0 0 0 0 0 0 0
Totale 13.995