CINECA IRIS Institutional Research Information System

GROSSI, ROBERTO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 12.666
EU - Europa 5.584
AS - Asia 2.624
AF - Africa 252
SA - Sud America 25
OC - Oceania 13
Continente sconosciuto - Info sul continente non disponibili 4
Totale 21.168
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 12.324
IT - Italia 1.520
CN - Cina 1.428
PL - Polonia 1.387
SE - Svezia 691
BG - Bulgaria 592
SG - Singapore 516
CA - Canada 338
DE - Germania 297
TR - Turchia 251
UA - Ucraina 232
RU - Federazione Russa 205
VN - Vietnam 197
FI - Finlandia 178
GB - Regno Unito 169
CI - Costa d'Avorio 131
FR - Francia 86
HK - Hong Kong 82
CH - Svizzera 80
SN - Senegal 56
NG - Nigeria 47
IN - India 44
BE - Belgio 43
JP - Giappone 38
AT - Austria 26
NL - Olanda 22
BR - Brasile 17
KR - Corea 12
RO - Romania 12
BJ - Benin 11
GR - Grecia 11
IL - Israele 11
IR - Iran 11
AU - Australia 10
TW - Taiwan 9
CL - Cile 7
PH - Filippine 7
SK - Slovacchia (Repubblica Slovacca) 6
CZ - Repubblica Ceca 4
DZ - Algeria 4
ES - Italia 4
EU - Europa 4
IE - Irlanda 4
LT - Lituania 4
AE - Emirati Arabi Uniti 3
HU - Ungheria 3
NZ - Nuova Zelanda 3
SA - Arabia Saudita 3
DK - Danimarca 2
EE - Estonia 2
LK - Sri Lanka 2
MY - Malesia 2
PK - Pakistan 2
UZ - Uzbekistan 2
AL - Albania 1
AR - Argentina 1
AZ - Azerbaigian 1
BY - Bielorussia 1
DO - Repubblica Dominicana 1
GL - Groenlandia 1
IQ - Iraq 1
JO - Giordania 1
LU - Lussemburgo 1
MA - Marocco 1
MX - Messico 1
PA - Panama 1
RS - Serbia 1
TH - Thailandia 1
TN - Tunisia 1
ZA - Sudafrica 1
Totale 21.168
Salva come PNG Salva come JPEG
Città #
Woodbridge 1.654
Fairfield 1.512
Houston 1.119
Chandler 957
Ann Arbor 899
Santa Clara 729
Ashburn 690
Sofia 591
Seattle 564
Cambridge 515
Wilmington 509
Milan 480
Shanghai 426
Beijing 378
Ottawa 322
Jacksonville 305
Singapore 295
New York 290
Boardman 265
Princeton 241
Lawrence 212
Serra 175
Izmir 174
Des Moines 151
Nanjing 147
Medford 140
Abidjan 131
Pisa 102
Florence 96
Dong Ket 85
San Diego 81
Bern 80
Istanbul 69
Dearborn 66
Hong Kong 65
Nanchang 65
Rome 57
Dakar 56
Redwood City 52
Marseille 50
Lagos 47
Jüchen 45
Brussels 43
Chicago 40
Bremen 38
Düsseldorf 37
Ogden 37
Shenyang 37
Boulder 35
Changsha 32
Hebei 31
London 31
Kunming 26
Pune 26
Hefei 25
Jiaxing 25
Torino 25
Tianjin 24
Los Angeles 20
Guangzhou 19
Fuzhou 18
Norwalk 17
Tokyo 17
Auburn Hills 16
Livorno 16
Hangzhou 14
Helsinki 14
Hyde 14
Jinan 14
Vienna 13
Cotonou 11
Falls Church 11
Chengdu 10
Marigliano 10
San Jose 10
Council Bluffs 9
Washington 9
Alessandria 8
Frankfurt am Main 8
Karlsruhe 7
Lanzhou 7
North Bergen 7
Phoenix 7
Rho 7
Xian 7
Central 6
Central District 6
Dallas 6
Las Vegas 6
Ningbo 6
Orange 6
Valdivia 6
Verona 6
Zhengzhou 6
Capannori 5
Changchun 5
Lucca 5
Padova 5
San Francisco 5
Taipei 5
Totale 15.803
Salva come PNG Salva come JPEG
Nome #
Strutture di dati e algoritmi: progettazione, analisi e visualizzazione 1.448
On-line pattern matching on similar texts 222
A Note on Updating Suffix Tree Labels 198
Sequence sorting in secondary storage 183
CSC: Circular Strings Comparison 178
Mobilomics in Saccharomyces cerevisiae Strains 170
A fully-dynamic data structure for external substring search 161
A note on updating suffix tree labels 156
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching 153
Amortized Rigidness in Dynamic Cartesian Trees 152
Motif Trie: An Efficient Text Index for Pattern Discovery with Don't Cares 152
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms 150
Circular Sequence Comparison with q-grams 150
Masking Patterns in Sequences: A New Class of Motif Discovery with Don't Cares 149
A Basis of Tiling Motifs for Generating Repeated Patterns and its Complexity for Higher Quorum 148
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications 146
Mining Biological Sequences with Masks 146
Theory of Computing System: Special Issue on selected papers of the conference "FUN with Algorithms 2004" 141
A Trie-Based Approach for Compacting Automata 140
Optimal In-place Sorting of Vectors and Records 140
On computing the diameter of real-world undirected graphs 138
Optimal Implicit Dictionaries over Unbounded Universes 137
Semi-Indexing Semi-Structured Data in Tiny Space 137
On Updating Suffix Tree Labels 134
Improved dynamic text indexing 133
Bases of Motifs for Generating Repeated Patterns with Wild Cards 132
Longest property-preserved common factor 131
Enumerating Cyclic Orientations of a Graph 129
Efficient bubble enumeration in directed graphs 128
Squeezing succinct data structures into entropy bounds 127
No Sorting? Better Searching! 127
Pattern Discovery and Listing in Graphs 127
EXTENSIVE ANALYSIS OF T CELL RECEPTOR GAMMA (TCRG) GENE REARRANGEMENTS REVEALS A SIMILAR REPERTOIRE IN EOSINOPHILIC GRANULOMATOSIS WITH POLYANGIITIS (EGPA) AND IN HYPEREOSINOPHILIC SYNDROME (HES) 127
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 126
Optimal On-Line Search and Sublinear Time Update in String Matching 124
On the Size of Succinct Indices 124
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries 124
On Searching Compressed String Collections Cache-Obliviously 124
Circular sequence comparison: Algorithms and applications 123
The String B-Tree: A New Data Structure for String Search in External Memory and its Applications 122
Directing road networks by listing strong orientations 122
Optimal Deterministic Protocols for Mobile Robots on a Grid 121
null 120
Parallel construction and query of suffix trees for two-dimensional matrices 120
Dynamic Compressed Strings with Random Access 119
A Quick Tour on Suffix Arrays and Compressed Suffix Arrays 119
Optimal Trade-Offs for Succinct String Indexes 117
Random Access to High-Order Entropy Compressed Text 117
Simple Planar Graph Partition into Three Forests 116
Efficient Splitting and Merging Algorithms for Order Decomposable Problems 116
Output-Sensitive Pattern Extraction in Sequences 116
A General Technique for Managing Strings in Comparison-Driven Data Structures 116
Towards Mobilome Inference in Yeast Genomes 115
Optimal On-Line Search and Sublinear Time Update in String Matching 115
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 114
Large-scale clique cover of real-world networks 114
Implicit B-trees: New Results for the Dictionary Problem 113
A Comparative Study of Bases for Motif Inference in String Algorithmics 113
Preface 112
null 111
Search data structures for skewed strings 110
New Bounds for Approximating Extremal Distances in Undirected Graphs 109
IP Address Lookup Made Fast and Simple 107
On computing the diameter of real-world directed (weighted) graphs 107
Efficient cross-trees for external memory 106
INFERRING MOBILE ELEMENTS IN S. CEREVISIAE STRAINS 106
Clique covering of large real-world networks 106
Node Similarity with q-Grams for Real-World Labeled Networks 106
Listing maximal subgraphs satisfying strongly accessible properties∗ 106
On Sorting Strings in External Memory 105
Optimal Cache-Aware Suffix Selection 105
Simple Real-Time Constant-Space String Matching 105
String sanitization: a combinatorial approach 105
Text Sparsification via Local Maxima 104
Optimal in-place sorting of vectors and records 103
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform 103
TCR GAMMA CLONALITY ASSESSED BY NGS DOES NOT HELP TO DISTINGUISH EGPA FROM HES 103
Fun with Olympiad in algorithmics 102
Implicit B-trees: a new data structure for the dictionary problem 101
A fast H. 261 software codec for high quality videoconferencing on PCs 101
Simple real-time constant-space string matching 101
MADMX: A Novel Strategy for Maximal Dense Motif Extraction 100
Optimal implicit dictionaries over unbounded universes 100
Amortized rigidness in dynamic Cartesian Trees 100
Longest property-preserved common factor: A new string-processing framework 100
Comparing Degenerate Strings 100
A fast VLSI solution for approximate string matching 99
Discovering K-Trusses in Large-Scale Networks 99
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 99
Encodings for Range Selection and Top-k Queries 98
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices 98
Degenerate String Comparison and Applications 97
Polynomial-Delay Enumeration of Maximal Common Subsequences 97
A Comparative Study of Bases for Motif Inference 96
MADMX 96
A note on the subtree isomorphism for ordered trees and related problems 96
CLONOTYPE AND MUTATIONAL PATTERN IN TCRGD LARGE GRANULAR LYMPHOCYTE LEUKEMIA 96
A fast VLSI solution for approximate string matching 95
Colored range searching in linear space 95
Erratum to: Circular sequence comparison: algorithms and applications 94
Totale 13.439
Salva come PNG Salva come JPEG
Categoria #
all - tutte 59.591
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 59.591
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.695 0 0 0 0 0 0 443 296 371 233 269 83
2020/20211.960 134 142 114 89 179 127 155 255 229 128 146 262
2021/20222.306 72 200 83 128 443 313 72 108 78 55 127 627
2022/20232.603 366 307 137 250 322 307 14 182 503 17 162 36
2023/20243.497 282 222 276 132 325 344 70 46 41 1.431 62 266
2024/20252.159 50 250 152 268 522 524 393 0 0 0 0 0
Totale 21.580