IRIS - Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.065 0 0 0 0 0 0 0 433 313 167 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/2025900 146 81 124 122 251 176 0 0 0 0 0 0
Totale 8.465