Finocchi, Irene
 Distribuzione geografica
Continente #
EU - Europa 2792
NA - Nord America 1937
AS - Asia 186
OC - Oceania 21
Continente sconosciuto - Info sul continente non disponibili 15
AF - Africa 4
Totale 4955
Nazione #
US - Stati Uniti d'America 1911
GB - Regno Unito 1225
UA - Ucraina 544
SE - Svezia 330
IT - Italia 256
FR - Francia 245
DE - Germania 136
CN - Cina 74
VN - Vietnam 35
IN - India 32
CA - Canada 25
IR - Iran 23
AU - Australia 21
BE - Belgio 16
EU - Europa 15
CH - Svizzera 8
RU - Federazione Russa 8
HK - Hong Kong 7
FI - Finlandia 5
SI - Slovenia 5
TW - Taiwan 5
AT - Austria 3
JP - Giappone 3
NL - Olanda 3
ES - Italia 2
GR - Grecia 2
IL - Israele 2
KR - Corea 2
NO - Norvegia 2
SC - Seychelles 2
AE - Emirati Arabi Uniti 1
EG - Egitto 1
ET - Etiopia 1
PA - Panama 1
PK - Pakistan 1
RO - Romania 1
SK - Slovacchia (Repubblica Slovacca) 1
TR - Turchia 1
Totale 4955
Città #
Southend 1220
Jacksonville 361
Chandler 269
Fairfield 203
Ann Arbor 161
Wilmington 116
Princeton 94
Guido 93
Beijing 68
Redmond 66
Ashburn 64
Houston 59
Seattle 55
Cambridge 54
Woodbridge 52
San Diego 48
Redwood City 36
Dong Ket 34
Rome 28
Brussels 16
Norwalk 12
Pozzuoli 9
Ottawa 8
Pescara 8
Milan 7
Weimar 7
Zanjan 7
Toronto 6
Andover 5
Leawood 5
Taipei 5
Vittuone 5
Central District 4
Civitavecchia 4
Craco 4
San Jose 4
San Mateo 4
Ardabil 3
Bari 3
Brescia 3
Helsinki 3
Hohenems 3
Kingston 3
Strasbourg 3
Vancouver 3
Alleghe 2
Amsterdam 2
Bangalore 2
Castrovillari 2
Central 2
Corfu 2
Duncan 2
Genova 2
Henderson 2
Kaliningrad 2
Kiev 2
Kista 2
London 2
Lugo 2
Manchester 2
Monmouth Junction 2
Mountain View 2
Mumbai 2
Munich 2
Philadelphia 2
Pisa 2
Pittsburgh 2
Tehran 2
Washington 2
Watervliet 2
Antony 1
Benton 1
Bologna 1
Buffalo 1
Cairo 1
Camparada 1
Chengdu 1
Chicago 1
Ciciliano 1
Ciudad De Panamá 1
College Station 1
Delhi 1
Dortmund 1
Etobicoke 1
Firat 1
Florence 1
Forlì 1
Francavilla Fontana 1
Grosseto 1
Guangzhou 1
Hangyang 1
Hanoi 1
Hanover 1
Harrow 1
Irkutsk 1
Kagoya 1
Kashan 1
Latham 1
Linden 1
Livorno 1
Totale 3305
Nome #
null 153
Efficient pruning of large knowledge graphs 138
Optimal Resilient Dynamic Dictionaries 112
Tree Partitioning via Vertex Deletion 93
Special Issue on the European Symposium on Algorithms 91
On bibliometrics in academic promotions: a case study in computer science and engineering in Italy 89
Clique counting in MapReduce: Algorithms and experiments 88
Algoritmi e strutture dati (seconda edizione) 85
Trading off space for passes in graph streaming problems 84
Experimental Study of Resilient Algorithms and Data Structures 82
k-BLPP - Ball-Larus path profiling across multiple loop iterations 78
Proceedings of the 16th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes 76
Progetto di algoritmi e strutture dati in Java 73
K-calling context profiling 73
CrumbTrail: an Efficient Methodology to Reduce Multiple Inheritance in Knowledge Graphs 73
Editorial: Preface to the special issue 73
Designing Reliable Algorithms in Unreliable Memories 70
A Survey of Symbolic Execution Techniques 68
Trading off space for passes in graph streaming problems 68
The Price of Resiliency: A Case Study on Sorting with Memory Faults 67
Algorithm Engineering and Experiments 67
WebIsAGraph: A Very Large Hypernymy Graph from a Web Corpus 67
Visual editing of animated algorithms: The leonardo web builder 67
Dynamic Trees 66
Engineering and visualizing algorithms 66
Algorithms and Complexity 66
K-calling context profiling 64
Special issue of ACM Journal on Experimental Algorithmics devoted to papers selected from ALENEX 2009. Guest editors' foreword 63
Algorithms ESA 2015: 23rd annual European Symposium Patras, Greece, September 14-16, 2015 proceedings 62
Dynamic Graphs 62
Algorithm Engineering 60
Resilient Dictionaries 59
Reactive imperative programming with dataflow constraints 58
A Java-based system for building animated presentations over the Web 57
Input-sensitive profiling 57
Breaking cycles for minimizing crossings 57
Experimental analysis of simple, distributed vertex coloring algorithms 56
Reactive imperative programming with dataflow constraints 56
Cache-Oblivious Dynamic Programming in Faulty Memory Hierarchies 55
Input-sensitive profiling 54
A Note on Algebraic Hypercube Colorings 53
Sorting and searching in the presence of memory faults (without redundancy) 52
Counting cliques in parallel without a cluster: engineering a fork/join algorithm for shared-memory platforms 51
Reversible execution and visualization of programs with LEONARDO 50
Layered drawings of graphs with crossing constraints 50
A data-driven graphical toolkit for software visualization 49
Optimal Resilient Sorting and Searching in the presence of Dynamic Memory Faults 49
Resilient Search Trees 49
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs 49
An experimental study of simple, distributed vertex colouring algorithms 48
Crossing-constrained hierarchical drawings 48
A System for Building Animated Presentations over the Web 48
Conflict-free star-access in parallel memory systems 47
On data skewness, stragglers, and MapReduce progress indicators 47
Sorting and searching in faulty memories 47
Parallel generation of large bipartite subgraphs in cubic graphs 46
Resilient Dynamic Programming 46
Engineering Tree Labeling Schemes: a Case Study on Least Common Ancestor 45
Mining Hot Calling Contexts in Small Space 45
Welcome from the Chairs 45
Input-Sensitive Profiling 45
Hands on Algorithms:an Experience with Algorithm Animation in Advanced Computer Science Classes 44
Smooth animation of algorithms in a declarative framework 44
Specifying algorithm visualizations: Interesting events or state mapping? 44
Algorithms for Data Streams 43
Infinite Trees and the Future 43
Algoritmi Animati per un Apprendimento Interattivo 43
Mining Hot Calling Contexts in Small Space 43
Break the `Right' Cycles and Get the `Best' Drawing' 42
Visualizing Algorithms over the Web with the Publication-Driven Approach 42
Portraying algorithms with Leonardo Web 41
Estimating the empirical cost function of routines with dynamic workloads 41
Reactive imperative programming with dataflow constraints 41
Smooth animation of algorithms in a declarative framework 41
Star-coloring of graphs for conflict-free access to parallel memory systems 41
Graph Coloring with Distance Constraints 40
Graph sketches 40
Hierarchical Clustering of trees: Algorithms and Experiments 40
Dynamic programming in faulty memory hierarchies (cache-obliviously) 40
On coding labeled trees 40
Structure-preserving hierarchical decompositions 39
A portable virtual machine for program debugging and directing 39
On the validity of hierarchical decompositions 39
Combinatorial algorithms for feedback problems in directed graphs 39
Software streams: Big data challenges in dynamic program analysis 38
Divider-based algorithms for hierarchical tree partitioning 38
A unified approach to coding labeled trees 37
Optimal Resilient Sorting and Searching in the presence of Memory Faults 37
LEONARDO: a software visualization system 36
Local dependency dynamic programming in the presence of memory faults 36
Which conference is that? A case study in computer science 36
On max-cut in cubic graphs 32
On computer science research and its temporal evolution 27
Bibliometria e reclutamento: uno studio empirico nelle discipline informatiche 26
2020 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX) 16
Totale 5270
Categoria #
all - tutte 12633
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 12633


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201065 0000 00 0433 31316712923
2020/20212194 10022616162 491101 19197 13762428138
2021/20221070 14812141119 5184 5795 709189104
2022/2023941 328186302125 00 00 0000
Totale 5270