CINECA IRIS Institutional Research Information System

GROSSI, ROBERTO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 11.486
EU - Europa 5.313
AS - Asia 1.638
AF - Africa 238
OC - Oceania 11
SA - Sud America 11
Continente sconosciuto - Info sul continente non disponibili 4
Totale 18.701
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 11.147
IT - Italia 1.387
PL - Polonia 1.383
CN - Cina 943
SE - Svezia 690
BG - Bulgaria 592
CA - Canada 337
DE - Germania 288
UA - Ucraina 232
VN - Vietnam 197
TR - Turchia 185
FI - Finlandia 171
GB - Regno Unito 150
CI - Costa d'Avorio 131
RU - Federazione Russa 130
SG - Singapore 110
FR - Francia 81
CH - Svizzera 80
HK - Hong Kong 69
SN - Senegal 56
NG - Nigeria 47
IN - India 44
BE - Belgio 40
JP - Giappone 34
AT - Austria 21
NL - Olanda 19
KR - Corea 12
RO - Romania 12
GR - Grecia 11
IR - Iran 11
IL - Israele 9
AU - Australia 8
CL - Cile 7
PH - Filippine 7
TW - Taiwan 7
SK - Slovacchia (Repubblica Slovacca) 6
BR - Brasile 4
DZ - Algeria 4
ES - Italia 4
EU - Europa 4
IE - Irlanda 4
NZ - Nuova Zelanda 3
SA - Arabia Saudita 3
AE - Emirati Arabi Uniti 2
CZ - Repubblica Ceca 2
DK - Danimarca 2
EE - Estonia 2
HU - Ungheria 2
LK - Sri Lanka 2
PK - Pakistan 2
AL - Albania 1
BY - Bielorussia 1
GL - Groenlandia 1
LU - Lussemburgo 1
PA - Panama 1
RS - Serbia 1
UZ - Uzbekistan 1
Totale 18.701
Salva come PNG Salva come JPEG
Città #
Woodbridge 1.654
Fairfield 1.512
Houston 1.119
Chandler 957
Ann Arbor 898
Ashburn 677
Sofia 591
Seattle 564
Cambridge 515
Wilmington 509
Milan 471
Beijing 376
Ottawa 322
Jacksonville 305
New York 288
Princeton 241
Lawrence 212
Serra 175
Izmir 174
Des Moines 151
Nanjing 147
Medford 140
Abidjan 131
Florence 87
Dong Ket 85
San Diego 81
Bern 80
Dearborn 66
Nanchang 65
Dakar 56
Hong Kong 55
Rome 53
Redwood City 52
Marseille 50
Lagos 47
Jüchen 45
Brussels 40
Bremen 38
Düsseldorf 37
Shenyang 37
Pisa 36
Boulder 35
Changsha 32
Hebei 31
Kunming 26
Pune 26
Hefei 25
Jiaxing 25
Ogden 25
Torino 25
Tianjin 24
London 17
Norwalk 17
Tokyo 17
Auburn Hills 16
Guangzhou 16
Hyde 14
Jinan 14
Hangzhou 13
Vienna 12
Falls Church 11
Helsinki 11
Boardman 10
Chengdu 10
Shanghai 10
Council Bluffs 9
Livorno 9
San Jose 9
Washington 9
Alessandria 8
Los Angeles 8
Karlsruhe 7
Lanzhou 7
Phoenix 7
Rho 7
Xian 7
Central 6
Central District 6
Frankfurt am Main 6
Las Vegas 6
Ningbo 6
Orange 6
Valdivia 6
Verona 6
Capannori 5
Changchun 5
Fuzhou 5
Padova 5
San Francisco 5
Taiyuan 5
Tappahannock 5
Zhengzhou 5
Bratislava 4
Cascina 4
Chiesina Uzzanese 4
Delaware 4
Dublin 4
Indiana 4
Leawood 4
Mountain View 4
Totale 13.808
Salva come PNG Salva come JPEG
Nome #
Strutture di dati e algoritmi: progettazione, analisi e visualizzazione 1.437
A Note on Updating Suffix Tree Labels 189
On-line pattern matching on similar texts 185
Sequence sorting in secondary storage 173
Mobilomics in Saccharomyces cerevisiae Strains 157
A fully-dynamic data structure for external substring search 148
A note on updating suffix tree labels 147
Amortized Rigidness in Dynamic Cartesian Trees 143
Motif Trie: An Efficient Text Index for Pattern Discovery with Don't Cares 142
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms 141
A Basis of Tiling Motifs for Generating Repeated Patterns and its Complexity for Higher Quorum 141
Circular Sequence Comparison with q-grams 138
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching 136
Mining Biological Sequences with Masks 136
On the Construction of Classes of Suffix Trees for Square Matrices: Algorithms and Applications 135
Masking Patterns in Sequences: A New Class of Motif Discovery with Don't Cares 135
CSC: Circular Strings Comparison 134
A Trie-Based Approach for Compacting Automata 131
Optimal In-place Sorting of Vectors and Records 130
Theory of Computing System: Special Issue on selected papers of the conference "FUN with Algorithms 2004" 130
Optimal Implicit Dictionaries over Unbounded Universes 128
Semi-Indexing Semi-Structured Data in Tiny Space 127
On computing the diameter of real-world undirected graphs 126
On Updating Suffix Tree Labels 125
Improved dynamic text indexing 123
Longest property-preserved common factor 121
null 120
Bases of Motifs for Generating Repeated Patterns with Wild Cards 120
Pattern Discovery and Listing in Graphs 119
Enumerating Cyclic Orientations of a Graph 119
Squeezing succinct data structures into entropy bounds 118
No Sorting? Better Searching! 117
Efficient bubble enumeration in directed graphs 116
Circular sequence comparison: Algorithms and applications 115
On the Size of Succinct Indices 114
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries 114
Optimal On-Line Search and Sublinear Time Update in String Matching 113
ECC: Heuristic algorithms for computing an Edge Clique Cover of a graph 113
On Searching Compressed String Collections Cache-Obliviously 112
The String B-Tree: A New Data Structure for String Search in External Memory and its Applications 111
null 111
Directing road networks by listing strong orientations 111
Optimal Deterministic Protocols for Mobile Robots on a Grid 110
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) 110
A Quick Tour on Suffix Arrays and Compressed Suffix Arrays 109
Simple Planar Graph Partition into Three Forests 108
Optimal Trade-Offs for Succinct String Indexes 108
Efficient Splitting and Merging Algorithms for Order Decomposable Problems 108
Dynamic Compressed Strings with Random Access 108
Random Access to High-Order Entropy Compressed Text 108
Parallel construction and query of suffix trees for two-dimensional matrices 107
A General Technique for Managing Strings in Comparison-Driven Data Structures 105
Optimal On-Line Search and Sublinear Time Update in String Matching 105
Implicit B-trees: New Results for the Dictionary Problem 103
A Comparative Study of Bases for Motif Inference in String Algorithmics 103
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 103
Towards Mobilome Inference in Yeast Genomes 103
Output-Sensitive Pattern Extraction in Sequences 102
Search data structures for skewed strings 100
New Bounds for Approximating Extremal Distances in Undirected Graphs 100
IP Address Lookup Made Fast and Simple 98
Simple Real-Time Constant-Space String Matching 96
Efficient cross-trees for external memory 96
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform 96
Clique covering of large real-world networks 96
Node Similarity with q-Grams for Real-World Labeled Networks 96
INFERRING MOBILE ELEMENTS IN S. CEREVISIAE STRAINS 95
Text Sparsification via Local Maxima 94
Optimal Cache-Aware Suffix Selection 93
Fun with Olympiad in algorithmics 92
Implicit B-trees: a new data structure for the dictionary problem 92
On computing the diameter of real-world directed (weighted) graphs 92
Amortized rigidness in dynamic Cartesian Trees 92
Listing maximal subgraphs satisfying strongly accessible properties∗ 92
Large-scale clique cover of real-world networks 92
On Sorting Strings in External Memory 91
MADMX: A Novel Strategy for Maximal Dense Motif Extraction 90
Optimal in-place sorting of vectors and records 90
Simple real-time constant-space string matching 90
Optimal implicit dictionaries over unbounded universes 89
A fast H. 261 software codec for high quality videoconferencing on PCs 89
Comparing Degenerate Strings 89
Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices 88
A fast VLSI solution for approximate string matching 88
Discovering K-Trusses in Large-Scale Networks 88
D2K: Scalable Community Detection in Massive Networks via Small-Diameter K-Plexes 87
Longest property-preserved common factor: A new string-processing framework 87
A Comparative Study of Bases for Motif Inference 86
Encodings for Range Selection and Top-k Queries 86
Colored range searching in linear space 86
Erratum to: Circular sequence comparison: algorithms and applications 86
A fast VLSI solution for approximate string matching 85
Degenerate String Comparison and Applications 85
MADMX 84
A note on the subtree isomorphism for ordered trees and related problems 84
Polynomial-Delay Enumeration of Maximal Common Subsequences 84
Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees 83
A general technique for managing strings in comparison-driven data structures 83
A trie-based approach for compacting automata 83
Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler Transform 83
Totale 12.277
Salva come PNG Salva come JPEG
Categoria #
all - tutte 45.040
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 45.040
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/20191.502 0 0 0 0 0 0 0 0 0 447 585 470
2019/20203.585 465 337 114 271 347 356 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.129 282 222 276 132 325 344 70 46 41 1.391 0 0
Totale 19.053