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


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/2025130 130 0 0 0 0 0 0 0 0 0 0 0
Totale 7.695