PAGLI, LINDA
 Distribuzione geografica
Continente #
NA - Nord America 7.501
EU - Europa 3.077
AS - Asia 923
AF - Africa 94
SA - Sud America 34
OC - Oceania 7
Continente sconosciuto - Info sul continente non disponibili 1
Totale 11.637
Nazione #
US - Stati Uniti d'America 7.308
IT - Italia 1.084
SE - Svezia 661
CN - Cina 559
BG - Bulgaria 337
UA - Ucraina 205
CA - Canada 192
DE - Germania 177
FI - Finlandia 150
TR - Turchia 131
GB - Regno Unito 122
FR - Francia 108
VN - Vietnam 102
CH - Svizzera 84
SG - Singapore 76
BE - Belgio 57
NG - Nigeria 41
RU - Federazione Russa 38
BR - Brasile 34
CI - Costa d'Avorio 26
SN - Senegal 23
HK - Hong Kong 22
IN - India 15
NL - Olanda 13
PL - Polonia 11
RO - Romania 9
NZ - Nuova Zelanda 6
AT - Austria 4
DZ - Algeria 4
JP - Giappone 4
CZ - Repubblica Ceca 3
DK - Danimarca 3
ES - Italia 3
IE - Irlanda 3
IL - Israele 3
IR - Iran 2
LK - Sri Lanka 2
LU - Lussemburgo 2
TW - Taiwan 2
UZ - Uzbekistan 2
AU - Australia 1
BD - Bangladesh 1
EU - Europa 1
HR - Croazia 1
KZ - Kazakistan 1
MX - Messico 1
NO - Norvegia 1
PT - Portogallo 1
TH - Thailandia 1
Totale 11.637
Città #
Woodbridge 1.332
Ann Arbor 805
Fairfield 788
Houston 783
Chandler 663
Milan 437
Sofia 337
Ashburn 334
Seattle 317
Cambridge 283
Wilmington 283
Jacksonville 270
Beijing 199
Ottawa 186
New York 172
Izmir 125
Princeton 121
Lawrence 120
Nanjing 113
Medford 93
Bern 84
Des Moines 69
Serra 68
Dearborn 67
Marseille 65
Brussels 56
Dong Ket 52
Rome 45
Jüchen 44
Philadelphia 42
Lagos 41
Nanchang 39
San Diego 39
Abidjan 26
Helsinki 24
Dakar 23
Kunming 22
Hong Kong 20
Quartu Sant'elena 20
Redwood City 19
Verona 18
Florence 17
Shanghai 17
Shenyang 17
Tianjin 17
Boardman 16
Boulder 16
Changsha 15
Hebei 15
Norwalk 15
Orange 15
Pune 14
Trento 13
Frankfurt am Main 11
Jiaxing 11
Auburn Hills 10
Falls Church 10
Hefei 10
Los Angeles 10
Pisa 10
Düsseldorf 9
Bialystok 8
Busto Arsizio 8
Tappahannock 8
Arlington 7
Indiana 7
Lake Forest 7
Hangzhou 6
London 6
Torino 6
Changchun 5
Jinan 5
Livorno 5
Portoferraio 5
Washington 5
Bologna 4
Catania 4
Chengdu 4
Foggia 4
Genova 4
Istanbul 4
Nürnberg 4
Sacile 4
San Francisco 4
Vienna 4
Auckland 3
Chiswick 3
Copenhagen 3
Dublin 3
Fuzhou 3
Islington 3
Lanzhou 3
Leipzig 3
Madrid 3
Palermo 3
Phoenix 3
Toronto 3
Wuhan 3
Baotou 2
Bari 2
Totale 9.083
Nome #
A LINEAR ALGORITHM TO DETERMINE MINIMAL SPANNING FORESTS IN CHAIN GRAPHS 183
SELF-ADJUSTING HASH-TABLES 172
k-Restricted Rotation with Application to Search Tree Rebalancing 160
HEIGHT OF HEIGHT-BALANCED TREES 155
A VLSI SOLUTION TO THE VERTICAL SEGMENT VISIBILITY PROBLEM 151
A PRELIMINARY-STUDY OF A DIAGONAL CHANNEL-ROUTING MODEL 148
A MODEL OF SEQUENTIAL-COMPUTATION WITH PIPELINED ACCESS TO MEMORY 147
Exploiting Regularities for Boolean Function Synthesis 146
Fun at a Department Store: Data Mining Meets Switching Theory 146
Point-of-failure shortest-path rerouting: Computing The Optimal Swap Edges Distributively 145
Getting close without touching: near-gathering for autonomous mobile robots 143
EFFICIENT CONSTRUCTION OF CATASTROPHIC PATTERNS FOR VLSI RECONFIGURABLE ARRAYS 142
ON THE UPPER BOUND ON THE ROTATION DISTANCE OF BINARY-TREES 141
AN EFFICIENT ALGORITHM FOR SOME TREE MATCHING PROBLEMS 140
A PARALLEL SOLUTION TO THE APPROXIMATE STRING MATCHING PROBLEM 140
HEIGHT-BALANCED MULTIWAY TREES 139
Network Decontamination with local immunization 138
A General Approach to Toroidal Mesh Decontamination with Local Immunity 136
APPROXIMATE MATCHING FOR 2 FAMILIES OF TREES 131
Network Decontamination in Presence of Local Immunity 131
Compact DSOP and Partial DSOP Forms 131
Point-of-Failure Swap Rerouting: Computing the Optimal Swaps Distributively 130
STRING MATCHING WITH WEIGHTED ERRORS 129
SOME NEW RESULTS ON A RESTRICTED CHANNEL ROUTING PROBLEM 129
An insight on PRAM computational bounds 128
SIMPLE SOLUTIONS FOR APPROXIMATE TREE MATCHING PROBLEMS 126
VLSI MESH OF TREES FOR DATA-BASE PROCESSING 124
Brief Announcement: Distributed Swap Edges computation for Minimum Cost Spanning Trees 124
Fast Three-Level Logic Minimization Based on Autosymmetry 123
L'informatica: non è un paese per donne. 120
REBALANCING HEIGHT BALANCED TREES 118
Diagonal channel routing with vias at unit distance 118
COUNTING THE NUMBER OF FAULT PATTERNS IN REDUNDANT VLSI ARRAYS 117
Random access in a list environment 117
A NOTE ON OPTIMAL ALLOCATION OF FILES IN A SYMMETRIC AND HOMOGENEOUS NETWORK 116
ROUTING IN TIMES SQUARE MODE 114
Getting Close Without Touching 114
Distributed Computation of All Node Replacements of a Minimum Spanning Tree 111
On testing for catastrophic faults in reconfigurable arrays with arbitrary link redundancy 110
Testing and reconfiguration of VLSI linear arrays 110
Three-Level Logic Minimization Based on Function Regularities 110
Computing with time-varying data: sequential complexity and parallel speed up 110
Web Marshals Fighting Curly Link Farms 108
VLSI algorithms and architecture for relational operations 107
null 107
CHANNEL ROUTING FOR STRICTLY MULTITERMINAL NETS 105
Synthesis of integer multipliers in sum of pseudoproducts form 105
Complete Balancing via Rotation 105
Optimal Network Decontamination with Threshold Immunity 104
Linear time distributed swap edge algorithms 104
Implicit B-trees: New Results for the Dictionary Problem 103
Algoritmi ricorsivi da lavorare ai ferri 102
Computing All The Best Swap Edges Distributively 102
Implicit Test of Regularity for Incompletely Specified Boolean Functions 102
9th International Conference on Fun with Algorithms (FUN) 102
Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees 101
Knitting for Fun: A Recursive Sweater 101
On a new Boolean function with applications 101
EXTERNAL SORTING IN VLSI 100
Dense trees: a new look at degenerate graphs 98
POWER TREES 97
Masked Interval Routing: A New Routing Scheme 97
Text Sparsification via Local Maxima 94
A new model for large memories 92
Implicit B-trees: a new data structure for the dictionary problem 92
Three-level logic minimization based on function regularities 91
The death of the monster 4, 31 (2000) 130-133 91
On Formal Descriptions for Knitting Recursive Patterns 91
Bottom-up Subtree Isomorphism for Unordered Labeled Trees 90
The Connection Layout in a Lattice of Four-Terminal Switches 90
Computing All the Best Swap Edges Distributively 89
Distributed Computation for Swapping a Failing Edge 89
Compacting and Grouping Mobile Agents on Dynamic Rings 89
Chain Rotations: a New Look at Tree Distance 87
A New Heuristic for DSOP Minimization 86
Analyzing and comparing on-line news sources via (Two-Layer) incremental clustering 86
A 4D CHANNEL ROUTER FOR A 2 LAYER DIAGONAL MODEL 85
Fast Three-Level Logic Minimization Based on Autosimmetry 83
Two Combinatorial Problems on the Layout of Switching Lattices 83
Algoritmi, divinità e gente comune 81
K-restricted rotation distance between binary trees 81
Implicit B-trees: a new data structure for the dictionary problem 81
The problem of quasi sorting 80
Coding trees as strings for approximate tree matching 80
Storia matematica della rete 78
Text Sparsification via Local Maxima 78
Distributed Minimum Spanning Tree Maintenance for Transient Node Failures 78
Getting Close Without Touching 78
E-commerce, Intermediation and Intelligent Software Agents 77
Exact Rooted Subtree Matching in Sublinear Time 77
A Rotation Algortihm based on induced Equivalent Edges 76
Lower Bounds on the Rotation Distance of Binary Trees 75
Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree 74
From Algorithms to Criptography. A Tutorial 73
Literal Selection in Switching Lattice Design 70
Implicit B-trees: A New Data Structure for the Dictionary Problem 70
COMMENT ON GENERALIZED AVL TREES 68
Synthesis of Autosymmetric Functions in a New Three-Level Form 67
The Fermat Star of Binary Trees 66
Network Decontamination under m-Immunity 65
Totale 10.695
Categoria #
all - tutte 26.105
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 26.105


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019898 0 0 0 0 0 0 0 15 22 272 323 266
2019/20202.087 266 177 71 141 209 219 264 164 233 119 176 48
2020/20211.033 104 48 67 48 136 86 65 103 98 80 58 140
2021/20221.251 15 62 20 77 275 192 24 57 77 32 53 367
2022/20231.833 210 237 122 187 207 253 58 125 309 27 80 18
2023/20241.237 269 172 216 89 180 194 94 23 0 0 0 0
Totale 11.764