ITALIANO, GIUSEPPE FRANCESCO
 Distribuzione geografica
Continente #
NA - Nord America 33.470
AS - Asia 3.059
EU - Europa 2.217
SA - Sud America 498
Continente sconosciuto - Info sul continente non disponibili 192
AF - Africa 34
OC - Oceania 9
Totale 39.479
Nazione #
US - Stati Uniti d'America 33.341
SG - Singapore 1.711
CN - Cina 526
BR - Brasile 406
UA - Ucraina 404
RU - Federazione Russa 375
DE - Germania 305
IE - Irlanda 305
IT - Italia 261
HK - Hong Kong 217
VN - Vietnam 196
FR - Francia 151
JP - Giappone 114
FI - Finlandia 94
SE - Svezia 90
GB - Regno Unito 89
KR - Corea 74
BD - Bangladesh 54
PL - Polonia 46
CA - Canada 41
IN - India 40
MX - Messico 35
AR - Argentina 32
EC - Ecuador 27
ES - Italia 20
TR - Turchia 20
NL - Olanda 16
ID - Indonesia 15
IQ - Iraq 14
CO - Colombia 13
PH - Filippine 12
JM - Giamaica 11
CR - Costa Rica 10
PK - Pakistan 10
CH - Svizzera 9
CL - Cile 9
AU - Australia 8
GR - Grecia 8
MY - Malesia 8
ZA - Sudafrica 8
AT - Austria 7
BE - Belgio 7
TN - Tunisia 7
IL - Israele 6
NI - Nicaragua 6
SA - Arabia Saudita 6
BY - Bielorussia 5
TH - Thailandia 5
VE - Venezuela 5
A1 - Anonimo 4
AL - Albania 4
BB - Barbados 4
CI - Costa d'Avorio 4
EG - Egitto 4
LT - Lituania 4
MA - Marocco 4
SY - Repubblica araba siriana 4
AE - Emirati Arabi Uniti 3
DK - Danimarca 3
HN - Honduras 3
HU - Ungheria 3
KE - Kenya 3
KZ - Kazakistan 3
PY - Paraguay 3
TT - Trinidad e Tobago 3
UZ - Uzbekistan 3
DO - Repubblica Dominicana 2
EU - Europa 2
GT - Guatemala 2
IS - Islanda 2
KG - Kirghizistan 2
KH - Cambogia 2
LC - Santa Lucia 2
LK - Sri Lanka 2
PA - Panama 2
PR - Porto Rico 2
PT - Portogallo 2
RS - Serbia 2
SX - ???statistics.table.value.countryCode.SX??? 2
TW - Taiwan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AG - Antigua e Barbuda 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
BN - Brunei Darussalam 1
BS - Bahamas 1
CG - Congo 1
CZ - Repubblica Ceca 1
DM - Dominica 1
DZ - Algeria 1
ET - Etiopia 1
GE - Georgia 1
GF - Guiana Francese 1
IR - Iran 1
JO - Giordania 1
KN - Saint Kitts e Nevis 1
LB - Libano 1
MK - Macedonia 1
NP - Nepal 1
Totale 39.286
Città #
Wilmington 8.817
Woodbridge 8.571
Houston 8.424
Fairfield 1.107
Singapore 823
Ashburn 635
Ann Arbor 616
Seattle 438
Chandler 369
San Jose 369
Jacksonville 368
Cambridge 367
Dublin 294
Dearborn 233
Hong Kong 213
Medford 204
Beijing 173
Santa Clara 147
New York 141
The Dalles 125
Council Bluffs 102
Lawrence 99
Tokyo 98
Rome 87
Los Angeles 73
Lauterbourg 69
Moscow 69
Ho Chi Minh City 67
Buffalo 59
Menlo Park 52
Mülheim 48
San Diego 45
Hanoi 43
São Paulo 41
Zhengzhou 41
Kraków 36
Milan 32
Chicago 26
Denver 26
Des Moines 26
Dallas 25
Helsinki 22
San Francisco 20
Norwalk 19
Falls Church 18
Guangzhou 18
Phoenix 18
London 17
Atlanta 16
Palo Alto 16
Rio de Janeiro 16
Hangzhou 15
Verona 15
Brooklyn 14
Mexico City 13
Kunming 12
Orem 12
Belo Horizonte 11
Hefei 11
Nuremberg 11
Quito 11
Redondo Beach 11
University Park 11
Columbus 10
Saint Petersburg 10
San Mateo 10
Shanghai 10
Toronto 10
Da Nang 9
Naples 9
Haiphong 8
Nanjing 8
Redwood City 8
Boston 7
Brasília 7
Brussels 7
Chennai 7
Dhaka 7
Salvador 7
San José 7
Amsterdam 6
Heiwajima 6
Jinan 6
Kyoto 6
Munich 6
Nanchang 6
Stockholm 6
Warsaw 6
Bangkok 5
Florence 5
Frankfurt am Main 5
Fuzhou 5
Goiânia 5
Hải Dương 5
Kingston 5
Kuala Lumpur 5
Managua 5
Manchester 5
Marabá 5
Minsk 5
Totale 34.174
Nome #
Novel local-search-based approaches to university examination timetabling 524
Finding strong bridges and strong articulation points in linear time 512
2-Connectivity in directed graphs: an experimental study 499
Design of trees in the hose model: The balanced case 496
Experimental study of resilient algorithms and data structures 484
2-Vertex connectivity in directed graphs 482
An experimental study of dynamic dominators 481
The price of resiliency: a case study on sorting with memory faults 479
Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n(2)) barrier 478
A traffic-based evolutionary algorithm for network clustering 476
Algorithmic techniques for maintaining shortest routes in dynamic networks 474
2D Color Barcodes for Mobile Phones 473
A stochastic location problem with applications to tele-diagnostic 473
Penalized second price: a new pricing algorithm for advertising in search engines 470
Designing reliable algorithms in unreliable memories 467
CHECKCOL: improved local search for graph coloring 464
SAVED: Secure Android Value addED services 464
Optimal resilient sorting and searching in the presence of memory faults 463
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures 461
Computing graph spanners in small memory: fault-tolerance and streaming 460
On a facility location problem with applications to tele-diagnostic 458
The value of location in keyword auctions 454
A new approach to dynamic all pairs shortest paths 452
Sorting and searching in faulty memories 452
A Forensic-as-a-servicedelivery platform for law enforcement agencies 451
Data structures resilient to memory faults: An experimental study of dictionaries 440
Data structures resilient to memory faults: an experimental study of dictionaries 438
Better transit routing by exploiting vehicle GPS data 437
Design of dynamic algorithms via primal-dual method 437
Exploiting GPS data in public transport journey planners 435
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs 435
High capacity colored two dimensional codes 433
Computing graph spanners in small memory: fault-tolerance and streaming 433
2-Edge connectivity in directed graphs 433
Handwritten signature verification with 2D color barcodes 429
AMachine Learning-based approach to Digital Triage 426
Traffic-based network clustering 425
Distributed simulation of Electronic Warfare command and control scenarios 423
Finding strong articulation points and strong bridges in linear time 423
Facial recognition with 2D color barcodes 422
Reliability and data density in high capacity color barcodes 422
Traffic vs topology in network clustering: Does it matter? 420
On suffix extensions in suffix trees 414
Maintaining dynamic minimum spanning trees: an experimental study 413
The competitor busting strategy in keyword auctions: who’s worst hit? 411
Resilient dictionaries 410
A simulator of a mobile ad-hoc network in a hostile environment 409
Topic 12: Theory and Algorithms for Parallel Computation 409
On Suffix Extensions in Suffix Trees 409
Near real-time suffix tree construction via the fringe marked ancestor problem 409
An evolutionary algorithm for network clustering through traffic matrices 407
On Resilient Graph Spanners 406
Engineering color barcode algorithms for mobile applications 405
Fully dynamic all pairs shortest paths with real edge weights 403
Small stretch spanners on dynamic graphs 402
Resilient algorithms and data structures 401
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs 398
Computing strong articulation points and strong bridges in large scale graphs 397
Deterministic fully dynamic data structures for vertex cover and matching 397
Improved algorithms for min cut and max flow in undirected planar graphs 394
Facial biometrics for 2D barcodes 393
Mantaining dynamic matrices for fully dynamic transitive closure 392
Small stretch (alpha, beta)-spanners in the streaming model 390
A model for the dynamics of bidders in the simulation of keyword auctions 390
Near real-time suffix tree construction via the fringe marked ancestor problem 390
Experimental analysis of dynamic all pairs shortest path algorithms 389
Shared backup & restore: save, recover and share personal information into closed groups of smartphones 389
SecureMyDroid: enforcing security in the mobile devices lifecycle 383
New Algorithms for Examination Timetabling 380
The Quest for the shortest route 376
Is timetabling routing always reliable for public transport? 371
Sparse subgraphs for 2-connectivity in directed graphs 365
Frequency domain analysis of large-scale proxy logs for botnet traffic detection 353
A data streaming approach to link mining in criminal networks 352
Incremental strong connectivity and 2 connectivity in directed graphs 349
On resilient graph spanners 348
Graph spanners in the streaming model: an experimental study 346
Dynamic algorithms via the primal-dual method 343
Sparse certificates for 2-connectivity in directed graphs 334
Strong articulation points and strong bridges in large scale graphs 333
Tropical paths in vertex-colored graphs 322
Computing critical nodes in directed graphs 321
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs 318
Decremental single-source reachability and strongly connected components in Õ(m√n) total update time 315
Online handwritten signature verification for low-end devices 313
Fast mining of large-scale logs for Botnet detection: a field study 305
All-pairs 2-reachability in O(nωlog n) time 296
Strong connectivity in directed graphs under failures, with applications 295
Maximum colorful cycles in vertex-colored graphs 287
An operational framework for incident handling 285
2-vertex connectivity in directed graphs 283
Computing 2-Connected components and maximal 2-Connected subgraphs in directed graphs: An experimental study 280
Decremental data structures for connectivity and dominators in directed graphs 278
Contracting a planar graph efficiently 267
Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders 255
Preventing ransomware attacks through file system filter drivers 242
What's inside a bow-tie: Analyzing the core of the web and of social networks 232
On bubble generators in directed graphs 230
Decremental single-source reachability in planar digraphs 209
All-Pairs LCA in DAGs: breaking through the O(n2.5) barrier 84
Totale 39.235
Categoria #
all - tutte 85.123
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 85.123


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022710 0 0 0 39 30 63 51 51 55 91 63 267
2022/20231.028 128 80 42 121 51 273 92 61 71 8 68 33
2023/2024374 28 19 14 13 22 135 13 0 9 13 8 100
2024/20252.436 76 618 261 114 22 78 168 155 198 227 241 278
2025/20262.851 202 125 363 160 217 69 452 396 407 277 98 85
2026/20271.131 102 185 623 221 0 0 0 0 0 0 0 0
Totale 39.479