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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.004 0 0 0 0 0 0 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.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/20251.330 12 153 44 192 436 327 166 0 0 0 0 0
Totale 13.150