CINECA IRIS Institutional Research Information System

PAGLI, LINDA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 10.332
AS - Asia 4.625
EU - Europa 3.643
SA - Sud America 531
AF - Africa 166
OC - Oceania 10
Continente sconosciuto - Info sul continente non disponibili 4
Totale 19.311
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 10.049
SG - Singapore 1.535
CN - Cina 1.534
IT - Italia 1.134
SE - Svezia 669
HK - Hong Kong 530
BR - Brasile 465
BG - Bulgaria 341
FR - Francia 303
VN - Vietnam 277
DE - Germania 247
CA - Canada 224
UA - Ucraina 214
TR - Turchia 195
FI - Finlandia 193
KR - Corea 188
GB - Regno Unito 174
RU - Federazione Russa 147
CH - Svizzera 85
IN - India 78
JP - Giappone 77
BD - Bangladesh 52
NG - Nigeria 41
IQ - Iraq 31
MX - Messico 29
BE - Belgio 28
CI - Costa d'Avorio 27
SN - Senegal 24
AR - Argentina 23
PL - Polonia 21
NL - Olanda 18
SA - Arabia Saudita 18
ZA - Sudafrica 18
VE - Venezuela 14
ES - Italia 13
MA - Marocco 11
PK - Pakistan 11
UZ - Uzbekistan 11
BJ - Benin 10
KE - Kenya 10
AT - Austria 9
RO - Romania 9
IL - Israele 8
DZ - Algeria 7
JM - Giamaica 7
TT - Trinidad e Tobago 7
AE - Emirati Arabi Uniti 6
CL - Cile 6
EC - Ecuador 6
NZ - Nuova Zelanda 6
DK - Danimarca 5
DO - Repubblica Dominicana 5
ID - Indonesia 5
KG - Kirghizistan 5
MY - Malesia 5
NP - Nepal 5
PY - Paraguay 5
UY - Uruguay 5
AU - Australia 4
BY - Bielorussia 4
CZ - Repubblica Ceca 4
JO - Giordania 4
LK - Sri Lanka 4
PH - Filippine 4
PS - Palestinian Territory 4
QA - Qatar 4
TH - Thailandia 4
AZ - Azerbaigian 3
BB - Barbados 3
CO - Colombia 3
EG - Egitto 3
ET - Etiopia 3
IE - Irlanda 3
IR - Iran 3
KZ - Kazakistan 3
LB - Libano 3
LT - Lituania 3
NO - Norvegia 3
OM - Oman 3
PE - Perù 3
PT - Portogallo 3
RS - Serbia 3
SY - Repubblica araba siriana 3
TN - Tunisia 3
GH - Ghana 2
KH - Cambogia 2
KW - Kuwait 2
LU - Lussemburgo 2
NI - Nicaragua 2
PA - Panama 2
SI - Slovenia 2
TW - Taiwan 2
XK - ???statistics.table.value.countryCode.XK??? 2
AL - Albania 1
AM - Armenia 1
BA - Bosnia-Erzegovina 1
BO - Bolivia 1
CM - Camerun 1
EE - Estonia 1
EU - Europa 1
Totale 19.292
Salva come PNG Salva come JPEG
Città #
Woodbridge 1.332
Ashburn 899
Singapore 888
Ann Arbor 805
Houston 789
Fairfield 788
Chandler 663
San Jose 531
Santa Clara 528
Hong Kong 521
Milan 422
Beijing 349
Sofia 339
Seattle 318
Dallas 297
Cambridge 284
Wilmington 283
Jacksonville 272
Shanghai 262
Hefei 261
New York 188
Ottawa 188
Seoul 188
Boardman 139
Izmir 126
Princeton 121
Lawrence 120
Los Angeles 120
Nanjing 113
Lauterbourg 105
Medford 93
Bern 84
Des Moines 73
Serra 68
Dearborn 67
Marseille 66
Ho Chi Minh City 65
Tokyo 61
The Dalles 58
Buffalo 56
Helsinki 54
Dong Ket 52
Istanbul 52
Rome 47
Jüchen 44
Lagos 41
Redondo Beach 41
San Diego 40
Nanchang 39
Council Bluffs 38
Hanoi 32
Frankfurt am Main 30
Ogden 30
Columbus 29
Munich 28
São Paulo 28
Abidjan 27
Brussels 26
Dakar 24
Kunming 22
Florence 21
Quartu Sant'elena 20
Verona 20
Redwood City 19
Tianjin 18
Shenyang 17
Boulder 16
Changsha 16
Düsseldorf 16
Pisa 16
Hebei 15
Norwalk 15
Orange 15
Pune 15
Belo Horizonte 13
Fuzhou 13
Phoenix 13
San Francisco 13
Trento 13
Turku 13
Haiphong 12
Dhaka 11
Jiaxing 11
London 11
Auburn Hills 10
Baghdad 10
Cotonou 10
Da Nang 10
Falls Church 10
Porto Alegre 10
Brasília 9
Nairobi 9
Rio de Janeiro 9
Stockholm 9
Tashkent 9
Toronto 9
Atlanta 8
Bialystok 8
Busto Arsizio 8
Hangzhou 8
Totale 14.162
Salva come PNG Salva come JPEG
Nome #
A LINEAR ALGORITHM TO DETERMINE MINIMAL SPANNING FORESTS IN CHAIN GRAPHS 262
Compact DSOP and Partial DSOP Forms 249
SELF-ADJUSTING HASH-TABLES 236
L'informatica: non è un paese per donne. 232
Getting close without touching: near-gathering for autonomous mobile robots 231
9th International Conference on Fun with Algorithms (FUN) 227
HEIGHT OF HEIGHT-BALANCED TREES 226
k-Restricted Rotation with Application to Search Tree Rebalancing 221
A PRELIMINARY-STUDY OF A DIAGONAL CHANNEL-ROUTING MODEL 220
Point-of-failure shortest-path rerouting: Computing The Optimal Swap Edges Distributively 220
Fun at a Department Store: Data Mining Meets Switching Theory 219
A VLSI SOLUTION TO THE VERTICAL SEGMENT VISIBILITY PROBLEM 218
A Rotation Algortihm based on induced Equivalent Edges 215
Exploiting Regularities for Boolean Function Synthesis 214
HEIGHT-BALANCED MULTIWAY TREES 211
A PARALLEL SOLUTION TO THE APPROXIMATE STRING MATCHING PROBLEM 208
Complete Balancing via Rotation 208
ON THE UPPER BOUND ON THE ROTATION DISTANCE OF BINARY-TREES 205
EFFICIENT CONSTRUCTION OF CATASTROPHIC PATTERNS FOR VLSI RECONFIGURABLE ARRAYS 204
AN EFFICIENT ALGORITHM FOR SOME TREE MATCHING PROBLEMS 203
Point-of-Failure Swap Rerouting: Computing the Optimal Swaps Distributively 202
Optimal Network Decontamination with Threshold Immunity 200
SOME NEW RESULTS ON A RESTRICTED CHANNEL ROUTING PROBLEM 199
SIMPLE SOLUTIONS FOR APPROXIMATE TREE MATCHING PROBLEMS 197
A MODEL OF SEQUENTIAL-COMPUTATION WITH PIPELINED ACCESS TO MEMORY 196
VLSI MESH OF TREES FOR DATA-BASE PROCESSING 192
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy 188
Chain Rotations: a New Look at Tree Distance 188
REBALANCING HEIGHT BALANCED TREES 187
Network Decontamination in Presence of Local Immunity 186
STRING MATCHING WITH WEIGHTED ERRORS 185
APPROXIMATE MATCHING FOR 2 FAMILIES OF TREES 184
Linear time distributed swap edge algorithms 184
The Connection Layout in a Lattice of Four-Terminal Switches 183
Network Decontamination with local immunization 182
Two Combinatorial Problems on the Layout of Switching Lattices 181
A General Approach to Toroidal Mesh Decontamination with Local Immunity 180
COUNTING THE NUMBER OF FAULT PATTERNS IN REDUNDANT VLSI ARRAYS 177
Fast Three-Level Logic Minimization Based on Autosymmetry 176
ROUTING IN TIMES SQUARE MODE 175
Literal Selection in Switching Lattice Design 175
Compacting and Grouping Mobile Agents on Dynamic Rings 175
Brief Announcement: Distributed Swap Edges computation for Minimum Cost Spanning Trees 173
Getting Close Without Touching 172
CHANNEL ROUTING FOR STRICTLY MULTITERMINAL NETS 171
An insight on PRAM computational bounds 170
Implicit B-trees: New Results for the Dictionary Problem 169
Fast Three-Level Logic Minimization Based on Autosimmetry 168
Implicit Test of Regularity for Incompletely Specified Boolean Functions 168
Dense trees: a new look at degenerate graphs 166
Algoritmi ricorsivi da lavorare ai ferri 165
Three-Level Logic Minimization Based on Function Regularities 165
POWER TREES 164
A 4D CHANNEL ROUTER FOR A 2 LAYER DIAGONAL MODEL 164
Computing All The Best Swap Edges Distributively 163
Web Marshals Fighting Curly Link Farms 163
Random access in a list environment 162
Computing with time-varying data: sequential complexity and parallel speed up 161
A NOTE ON OPTIMAL ALLOCATION OF FILES IN A SYMMETRIC AND HOMOGENEOUS NETWORK 160
Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees 159
Diagonal channel routing with vias at unit distance 159
VLSI algorithms and architecture for relational operations 159
Testing and reconfiguration of VLSI linear arrays 158
Distributed Computation of All Node Replacements of a Minimum Spanning Tree 157
A New Heuristic for DSOP Minimization 156
Network decontamination under m-immunity 154
Lower Bounds on the Rotation Distance of Binary Trees 153
On Formal Descriptions for Knitting Recursive Patterns 152
Analyzing and comparing on-line news sources via (Two-Layer) incremental clustering 151
Synthesis of integer multipliers in sum of pseudoproducts form 149
Three-level logic minimization based on function regularities 149
Knitting for Fun: A Recursive Sweater 149
Computing All the Best Swap Edges Distributively 145
The death of the monster 4, 31 (2000) 130-133 143
EXTERNAL SORTING IN VLSI 143
Distributed Computation for Swapping a Failing Edge 143
Text Sparsification via Local Maxima 142
K-restricted rotation distance between binary trees 142
Bottom-up Subtree Isomorphism for Unordered Labeled Trees 142
Capture on grids and tori with different number of Cops 142
Literal Selection in Switching Lattice Design 141
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree 140
On a new Boolean function with applications 140
Problemi, Algoritmi e Coding 140
Exact Rooted Subtree Matching in Sublinear Time 139
Implicit B-trees: A New Data Structure for the Dictionary Problem 139
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures 138
Getting Close Without Touching 136
Masked Interval Routing: A New Routing Scheme 136
Implicit B-trees: a new data structure for the dictionary problem 136
Synthesis of Autosymmetric Functions in a New Three-Level Form 136
E-commerce, Intermediation and Intelligent Software Agents 135
Gathering in dynamic rings 135
A new model for large memories 134
Algoritmi, divinità e gente comune 133
From Algorithms to Criptography. A Tutorial 131
Gathering in Dynamic Rings 131
The Fermat Star of Binary Trees 127
The problem of quasi sorting 127
Soulmate Algorithms 126
Totale 17.192
Salva come PNG Salva come JPEG
Categoria #
all - tutte 52.804
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.804
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021140 0 0 0 0 0 0 0 0 0 0 0 140
2021/20221.251 15 62 20 77 275 192 24 57 77 32 53 367
2022/20231.773 210 237 122 187 207 253 16 122 303 25 77 14
2023/20241.353 235 163 206 86 173 194 94 23 24 30 32 93
2024/20253.816 12 153 44 192 436 327 260 236 320 465 505 866
2025/20263.806 342 586 362 165 359 399 678 132 140 471 110 62
Totale 19.442