CINECA IRIS Institutional Research Information System

PAGLI, LINDA
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 8.701
EU - Europa 3.262
AS - Asia 2.456
SA - Sud America 371
AF - Africa 117
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 3
Totale 14.918
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 8.488
IT - Italia 1.097
CN - Cina 1.064
SG - Singapore 687
SE - Svezia 659
BR - Brasile 351
BG - Bulgaria 331
HK - Hong Kong 311
DE - Germania 209
UA - Ucraina 209
CA - Canada 201
TR - Turchia 184
FI - Finlandia 177
GB - Regno Unito 137
RU - Federazione Russa 133
FR - Francia 127
VN - Vietnam 102
CH - Svizzera 84
NG - Nigeria 40
KR - Corea 29
BE - Belgio 25
CI - Costa d'Avorio 25
IN - India 25
SN - Senegal 22
PL - Polonia 15
NL - Olanda 14
BD - Bangladesh 13
BJ - Benin 10
AR - Argentina 9
RO - Romania 9
AT - Austria 8
MX - Messico 8
JP - Giappone 7
IQ - Iraq 6
MA - Marocco 6
NZ - Nuova Zelanda 6
ES - Italia 5
IL - Israele 5
ZA - Sudafrica 5
DZ - Algeria 4
UZ - Uzbekistan 4
CZ - Repubblica Ceca 3
DK - Danimarca 3
IE - Irlanda 3
KG - Kirghizistan 3
LK - Sri Lanka 3
LT - Lituania 3
VE - Venezuela 3
AU - Australia 2
CL - Cile 2
DO - Repubblica Dominicana 2
EC - Ecuador 2
EG - Egitto 2
IR - Iran 2
LU - Lussemburgo 2
NO - Norvegia 2
NP - Nepal 2
PY - Paraguay 2
SI - Slovenia 2
TW - Taiwan 2
XK - ???statistics.table.value.countryCode.XK??? 2
AM - Armenia 1
AZ - Azerbaigian 1
BB - Barbados 1
BY - Bielorussia 1
CO - Colombia 1
EE - Estonia 1
EU - Europa 1
GA - Gabon 1
HR - Croazia 1
KE - Kenya 1
KZ - Kazakistan 1
LA - Repubblica Popolare Democratica del Laos 1
ML - Mali 1
PK - Pakistan 1
PT - Portogallo 1
RS - Serbia 1
SA - Arabia Saudita 1
TH - Thailandia 1
TT - Trinidad e Tobago 1
UY - Uruguay 1
Totale 14.918
Salva come PNG Salva come JPEG
Città #
Woodbridge 1.316
Ann Arbor 794
Fairfield 788
Houston 783
Ashburn 694
Chandler 652
Santa Clara 513
Milan 414
Sofia 331
Seattle 317
Hong Kong 309
Singapore 295
Cambridge 283
Wilmington 281
Jacksonville 271
Shanghai 257
Beijing 227
Ottawa 187
New York 176
Boardman 138
Izmir 125
Princeton 120
Lawrence 119
Nanjing 113
Hefei 109
Medford 93
Bern 84
Des Moines 68
Serra 68
Dearborn 67
Marseille 64
Dong Ket 51
Istanbul 50
Los Angeles 47
Rome 47
Jüchen 44
Helsinki 40
Lagos 40
Nanchang 39
San Diego 39
The Dalles 33
Seoul 29
Ogden 28
Abidjan 25
Brussels 24
Council Bluffs 24
Frankfurt am Main 24
Dakar 22
Kunming 22
São Paulo 21
Quartu Sant'elena 20
Redwood City 19
Verona 19
Florence 18
Tianjin 18
Boulder 16
Düsseldorf 16
Shenyang 16
Changsha 15
Hebei 15
Norwalk 15
Orange 15
Pisa 15
Pune 14
Fuzhou 13
Trento 13
Turku 12
Belo Horizonte 11
Jiaxing 11
Auburn Hills 10
Cotonou 10
Falls Church 10
London 10
Bialystok 8
Busto Arsizio 8
Hangzhou 8
North Bergen 8
Phoenix 8
San Francisco 8
Tappahannock 8
Arlington 7
Indiana 7
Lake Forest 7
Porto Alegre 7
Rio de Janeiro 7
Brasília 6
Dhaka 6
Guangzhou 6
Munich 6
Torino 6
Toronto 6
Washington 6
Wuhan 6
Bari 5
Changchun 5
Curitiba 5
Dallas 5
Jinan 5
Livorno 5
Palermo 5
Totale 11.210
Salva come PNG Salva come JPEG
Nome #
A LINEAR ALGORITHM TO DETERMINE MINIMAL SPANNING FORESTS IN CHAIN GRAPHS 217
SELF-ADJUSTING HASH-TABLES 201
Compact DSOP and Partial DSOP Forms 193
k-Restricted Rotation with Application to Search Tree Rebalancing 187
Getting close without touching: near-gathering for autonomous mobile robots 185
HEIGHT OF HEIGHT-BALANCED TREES 183
A PRELIMINARY-STUDY OF A DIAGONAL CHANNEL-ROUTING MODEL 182
Exploiting Regularities for Boolean Function Synthesis 179
A VLSI SOLUTION TO THE VERTICAL SEGMENT VISIBILITY PROBLEM 178
Fun at a Department Store: Data Mining Meets Switching Theory 171
HEIGHT-BALANCED MULTIWAY TREES 170
Point-of-failure shortest-path rerouting: Computing The Optimal Swap Edges Distributively 170
ON THE UPPER BOUND ON THE ROTATION DISTANCE OF BINARY-TREES 168
AN EFFICIENT ALGORITHM FOR SOME TREE MATCHING PROBLEMS 168
A PARALLEL SOLUTION TO THE APPROXIMATE STRING MATCHING PROBLEM 168
A MODEL OF SEQUENTIAL-COMPUTATION WITH PIPELINED ACCESS TO MEMORY 168
SOME NEW RESULTS ON A RESTRICTED CHANNEL ROUTING PROBLEM 165
EFFICIENT CONSTRUCTION OF CATASTROPHIC PATTERNS FOR VLSI RECONFIGURABLE ARRAYS 162
Network Decontamination with local immunization 162
SIMPLE SOLUTIONS FOR APPROXIMATE TREE MATCHING PROBLEMS 160
Point-of-Failure Swap Rerouting: Computing the Optimal Swaps Distributively 157
Network Decontamination in Presence of Local Immunity 156
A General Approach to Toroidal Mesh Decontamination with Local Immunity 156
9th International Conference on Fun with Algorithms (FUN) 156
L'informatica: non è un paese per donne. 155
APPROXIMATE MATCHING FOR 2 FAMILIES OF TREES 152
STRING MATCHING WITH WEIGHTED ERRORS 151
REBALANCING HEIGHT BALANCED TREES 148
VLSI MESH OF TREES FOR DATA-BASE PROCESSING 148
Brief Announcement: Distributed Swap Edges computation for Minimum Cost Spanning Trees 147
ROUTING IN TIMES SQUARE MODE 145
A Rotation Algortihm based on induced Equivalent Edges 145
Linear time distributed swap edge algorithms 144
COUNTING THE NUMBER OF FAULT PATTERNS IN REDUNDANT VLSI ARRAYS 143
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy 143
An insight on PRAM computational bounds 143
Optimal Network Decontamination with Threshold Immunity 143
Getting Close Without Touching 142
Complete Balancing via Rotation 142
Fast Three-Level Logic Minimization Based on Autosymmetry 140
A NOTE ON OPTIMAL ALLOCATION OF FILES IN A SYMMETRIC AND HOMOGENEOUS NETWORK 140
Random access in a list environment 139
VLSI algorithms and architecture for relational operations 137
CHANNEL ROUTING FOR STRICTLY MULTITERMINAL NETS 136
Dense trees: a new look at degenerate graphs 135
Chain Rotations: a New Look at Tree Distance 135
Diagonal channel routing with vias at unit distance 135
Three-Level Logic Minimization Based on Function Regularities 132
Distributed Computation of All Node Replacements of a Minimum Spanning Tree 132
Implicit B-trees: New Results for the Dictionary Problem 131
Computing with time-varying data: sequential complexity and parallel speed up 130
Web Marshals Fighting Curly Link Farms 129
POWER TREES 128
Testing and reconfiguration of VLSI linear arrays 127
Algoritmi ricorsivi da lavorare ai ferri 127
Computing All The Best Swap Edges Distributively 127
Implicit Test of Regularity for Incompletely Specified Boolean Functions 127
Three-level logic minimization based on function regularities 126
Knitting for Fun: A Recursive Sweater 126
The Connection Layout in a Lattice of Four-Terminal Switches 126
Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees 125
Two Combinatorial Problems on the Layout of Switching Lattices 125
Synthesis of integer multipliers in sum of pseudoproducts form 124
On Formal Descriptions for Knitting Recursive Patterns 124
Compacting and Grouping Mobile Agents on Dynamic Rings 123
On a new Boolean function with applications 122
Bottom-up Subtree Isomorphism for Unordered Labeled Trees 121
Text Sparsification via Local Maxima 120
EXTERNAL SORTING IN VLSI 119
The death of the monster 4, 31 (2000) 130-133 118
A New Heuristic for DSOP Minimization 115
Masked Interval Routing: A New Routing Scheme 115
Literal Selection in Switching Lattice Design 115
Implicit B-trees: a new data structure for the dictionary problem 113
A 4D CHANNEL ROUTER FOR A 2 LAYER DIAGONAL MODEL 112
Computing All the Best Swap Edges Distributively 112
K-restricted rotation distance between binary trees 112
A new model for large memories 112
E-commerce, Intermediation and Intelligent Software Agents 110
Exact Rooted Subtree Matching in Sublinear Time 109
Lower Bounds on the Rotation Distance of Binary Trees 109
Distributed Computation for Swapping a Failing Edge 107
null 107
From Algorithms to Criptography. A Tutorial 104
Algoritmi, divinità e gente comune 104
Fast Three-Level Logic Minimization Based on Autosimmetry 104
Storia matematica della rete 103
Implicit B-trees: a new data structure for the dictionary problem 103
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures 102
The Fermat Star of Binary Trees 102
Implicit B-trees: A New Data Structure for the Dictionary Problem 102
Getting Close Without Touching 101
The problem of quasi sorting 101
Coding trees as strings for approximate tree matching 100
Synthesis of Autosymmetric Functions in a New Three-Level Form 99
Text Sparsification via Local Maxima 97
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree 96
Dynamic Monopolies in Tori 95
Soulmate Algorithms 95
COMMENT ON GENERALIZED AVL TREES 91
Totale 13.486
Salva come PNG Salva come JPEG
Categoria #
all - tutte 40.691
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 40.691
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/202048 0 0 0 0 0 0 0 0 0 0 0 48
2020/20211.032 104 48 67 48 136 86 65 103 98 80 58 139
2021/20221.238 15 61 20 76 270 191 22 57 77 32 53 364
2022/20231.747 209 233 121 185 205 250 16 118 299 25 73 13
2023/20241.342 233 163 204 85 173 192 93 23 24 29 31 92
2024/20253.316 12 152 44 191 432 325 257 234 316 458 500 395
Totale 15.047