CINECA IRIS Institutional Research Information System

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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021544 0 0 0 0 0 0 65 103 98 80 58 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/20262.224 342 586 362 165 359 399 11 0 0 0 0 0
Totale 17.860