IRIS - Institutional Research Information System

Finocchi, Irene
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
EU - Europa 4.301
NA - Nord America 3.524
AS - Asia 946
SA - Sud America 140
OC - Oceania 35
AF - Africa 17
Continente sconosciuto - Info sul continente non disponibili 16
Totale 8.979
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.454
GB - Regno Unito 1.365
IT - Italia 679
UA - Ucraina 546
SG - Singapore 529
SE - Svezia 481
FR - Francia 360
DE - Germania 289
CN - Cina 141
BR - Brasile 127
RU - Federazione Russa 111
FI - Finlandia 106
IE - Irlanda 82
NL - Olanda 80
CA - Canada 60
BE - Belgio 54
HK - Hong Kong 43
IN - India 42
VN - Vietnam 35
AU - Australia 33
IR - Iran 25
JP - Giappone 25
CZ - Repubblica Ceca 23
TW - Taiwan 22
ES - Italia 19
AT - Austria 18
CH - Svizzera 18
KR - Corea 17
EU - Europa 15
IS - Islanda 11
LT - Lituania 10
NO - Norvegia 9
TR - Turchia 9
ID - Indonesia 8
BD - Bangladesh 7
IL - Israele 7
AR - Argentina 6
IQ - Iraq 5
SI - Slovenia 5
AL - Albania 4
BW - Botswana 4
GR - Grecia 4
PK - Pakistan 4
PL - Polonia 4
TH - Thailandia 4
DK - Danimarca 3
EC - Ecuador 3
EG - Egitto 3
HU - Ungheria 3
MX - Messico 3
RO - Romania 3
RS - Serbia 3
UZ - Uzbekistan 3
ZA - Sudafrica 3
AE - Emirati Arabi Uniti 2
AM - Armenia 2
AZ - Azerbaigian 2
CR - Costa Rica 2
DO - Repubblica Dominicana 2
HR - Croazia 2
MA - Marocco 2
ME - Montenegro 2
NZ - Nuova Zelanda 2
OM - Oman 2
PA - Panama 2
PH - Filippine 2
PT - Portogallo 2
SC - Seychelles 2
SK - Slovacchia (Repubblica Slovacca) 2
BG - Bulgaria 1
BN - Brunei Darussalam 1
BO - Bolivia 1
CO - Colombia 1
CY - Cipro 1
ET - Etiopia 1
GA - Gabon 1
GE - Georgia 1
GT - Guatemala 1
IM - Isola di Man 1
JO - Giordania 1
KE - Kenya 1
KG - Kirghizistan 1
KZ - Kazakistan 1
LA - Repubblica Popolare Democratica del Laos 1
LK - Sri Lanka 1
MD - Moldavia 1
NP - Nepal 1
PY - Paraguay 1
TJ - Tagikistan 1
UY - Uruguay 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 8.979
Salva come PNG Salva come JPEG
Città #
Southend 1.220
Chandler 658
Jacksonville 361
Singapore 341
Ashburn 250
Fairfield 203
Ann Arbor 161
Rome 145
Wilmington 116
Munich 103
Guido 93
Princeton 93
Dublin 82
Helsinki 82
Beijing 74
Seattle 74
Redmond 66
Houston 60
New York 58
Cambridge 55
Brussels 54
Milan 54
Woodbridge 52
London 50
San Diego 48
Dallas 39
Redwood City 36
Dong Ket 34
Boardman 28
Los Angeles 26
North Bergen 25
Moscow 24
Easley 22
Council Bluffs 20
Santa Clara 19
New Bedfont 17
Ottawa 17
Tokyo 17
Toronto 17
Brno 16
Naples 16
Bologna 15
Hong Kong 15
San Jose 15
Florence 14
The Dalles 14
Norwalk 12
Pescara 12
Vienna 12
West Jordan 12
Taipei 11
Turin 11
Frankfurt am Main 10
Keflavik 10
West Lafayette 10
Amsterdam 9
Granada 9
Kilburn 9
Pozzuoli 9
São Paulo 9
Atlanta 7
Central 7
Denver 7
Espoo 7
Hergiswil 7
Islington 7
Jyväskylä 7
Shanghai 7
Washington 7
Weimar 7
Zanjan 7
Chiswick 6
Dhaka 6
Edinburgh 6
Montreal 6
Nuremberg 6
Phoenix 6
Southwark 6
Tappahannock 6
Andover 5
Bari 5
Belo Horizonte 5
Brasília 5
Brescia 5
Buffalo 5
Cagliari 5
Catania 5
Genoa 5
Hobart 5
Jakarta 5
Lappeenranta 5
Leawood 5
Olomouc 5
Prescot 5
Rudersberg 5
Stockholm 5
Venice 5
Vittuone 5
Wandsworth 5
Central District 4
Totale 5.373
Salva come PNG Salva come JPEG
Nome #
Efficient pruning of large knowledge graphs 415
Algoritmi e strutture dati (seconda edizione) 304
2020 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX) 200
Progetto di algoritmi e strutture dati in Java 170
Preface 163
A Survey of Symbolic Execution Techniques 136
k-BLPP - Ball-Larus path profiling across multiple loop iterations 135
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy 131
Trading off space for passes in graph streaming problems 128
Clique counting in MapReduce: Algorithms and experiments 128
Optimal Resilient Dynamic Dictionaries 122
Tree Partitioning via Vertex Deletion 118
Special Issue on the European Symposium on Algorithms 118
Algorithm Engineering 115
Algorithm Engineering and Experiments 114
CrumbTrail: an Efficient Methodology to Reduce Multiple Inheritance in Knowledge Graphs 111
Proceedings of the 16th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes 110
Editorial: Preface to the special issue 110
Experimental Study of Resilient Algorithms and Data Structures 110
K-calling context profiling 106
K-calling context profiling 106
A Java-based system for building animated presentations over the Web 105
Algorithms ESA 2015: 23rd annual European Symposium Patras, Greece, September 14-16, 2015 proceedings 100
Engineering and visualizing algorithms 99
Trading off space for passes in graph streaming problems 98
Designing Reliable Algorithms in Unreliable Memories 98
Visual editing of animated algorithms: The leonardo web builder 98
Algorithms for Data Streams 97
Special issue of ACM Journal on Experimental Algorithmics devoted to papers selected from ALENEX 2009. Guest editors' foreword 97
Reactive imperative programming with dataflow constraints 96
Resilient Dictionaries 95
Smooth animation of algorithms in a declarative framework 95
Conflict-free star-access in parallel memory systems 94
The Price of Resiliency: A Case Study on Sorting with Memory Faults 93
Dynamic Graphs 93
Algorithms and Complexity 93
A data-driven graphical toolkit for software visualization 92
Input-sensitive profiling 92
Experimental analysis of simple, distributed vertex coloring algorithms 91
On computer science research and its temporal evolution 90
Mining Hot Calling Contexts in Small Space 90
On data skewness, stragglers, and MapReduce progress indicators 89
Dynamic Trees 88
Welcome from the Chairs 88
Breaking cycles for minimizing crossings 88
A Note on Algebraic Hypercube Colorings 87
Cache-Oblivious Dynamic Programming in Faulty Memory Hierarchies 87
Parallel generation of large bipartite subgraphs in cubic graphs 86
Estimating the empirical cost function of routines with dynamic workloads 86
Reversible execution and visualization of programs with LEONARDO 86
An experimental study of simple, distributed vertex colouring algorithms 85
Algoritmi Animati per un Apprendimento Interattivo 84
Counting cliques in parallel without a cluster: engineering a fork/join algorithm for shared-memory platforms 84
Sorting and searching in faulty memories 83
WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus 83
Portraying algorithms with Leonardo Web 82
Input-sensitive profiling 82
Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults 82
Break the `Right' Cycles and Get the `Best' Drawing' 80
Reactive imperative programming with dataflow constraints 80
Layered drawings of graphs with crossing constraints 79
Resilient Search Trees 78
Reactive imperative programming with dataflow constraints 78
Specifying algorithm visualizations: Interesting events or state mapping? 78
Sorting and searching in the presence of memory faults (without redundancy) 76
Infinite Trees and the Future 75
Crossing-constrained hierarchical drawings 75
A portable virtual machine for program debugging and directing 75
Visualizing Algorithms over the Web with the Publication-Driven Approach 74
Combinatorial algorithms for feedback problems in directed graphs 74
A System for Building Animated Presentations over the Web 74
Hands on Algorithms:an Experience with Algorithm Animation in Advanced Computer Science Classes 71
Engineering Tree Labeling Schemes: a Case Study on Least Common Ancestor 70
Software streams: Big data challenges in dynamic program analysis 70
Resilient Dynamic Programming 70
Graph sketches 70
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs 69
Input-Sensitive Profiling 69
Structure-preserving hierarchical decompositions 67
On the validity of hierarchical decompositions 66
Optimal Resilient Sorting and Searching in the presence of Memory Faults 66
LEONARDO: a software visualization system 65
Which conference is that? A case study in computer science 64
Graph Coloring with Distance Constraints 63
Divider-based algorithms for hierarchical tree partitioning 62
From Stars to Diamonds: Counting and Listing Almost Complete Subgraphs in Large Networks 61
Bibliometria e reclutamento: uno studio empirico nelle discipline informatiche 61
A unified approach to coding labeled trees 59
Mining Hot Calling Contexts in Small Space 59
Smooth animation of algorithms in a declarative framework 56
Hierarchical Clustering of trees: Algorithms and Experiments 54
Local dependency dynamic programming in the presence of memory faults 53
Star-coloring of graphs for conflict-free access to parallel memory systems 53
On max-cut in cubic graphs 52
Dynamic programming in faulty memory hierarchies (cache-obliviously) 51
On coding labeled trees 51
A technique for generating graphical abstractions of program data structures 44
An analysis of international mobility and research productivity in computer science 43
Algorithms and Complexity: 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings 34
Preface 31
Totale 9.206
Salva come PNG Salva come JPEG
Categoria #
all - tutte 59.494
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.494
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020152 0 0 0 0 0 0 0 0 0 0 129 23
2020/20212.194 100 226 161 62 491 101 191 97 137 62 428 138
2021/20221.069 148 121 41 119 51 84 57 95 70 91 89 103
2022/20232.217 322 182 298 377 117 220 70 189 203 61 107 71
2023/20241.020 39 27 150 50 162 174 69 107 43 49 23 127
2024/20251.784 146 81 124 122 251 200 115 201 327 211 6 0
Totale 9.349