CINECA IRIS Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/20221.174 0 0 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.833 342 586 362 165 359 399 678 132 140 471 110 89
2026/2027948 99 460 389 0 0 0 0 0 0 0 0 0
Totale 20.417