IRIS - Institutional Research Information System

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