ITALIANO, GIUSEPPE FRANCESCO
 Distribuzione geografica
Continente #
NA - Nord America 32.298
AS - Asia 2.971
EU - Europa 2.137
SA - Sud America 479
AF - Africa 34
OC - Oceania 9
Continente sconosciuto - Info sul continente non disponibili 8
Totale 37.936
Nazione #
US - Stati Uniti d'America 32.225
SG - Singapore 1.703
CN - Cina 510
UA - Ucraina 403
BR - Brasile 399
RU - Federazione Russa 375
IE - Irlanda 305
DE - Germania 303
HK - Hong Kong 213
IT - Italia 203
VN - Vietnam 192
FR - Francia 151
JP - Giappone 112
FI - Finlandia 94
SE - Svezia 89
GB - Regno Unito 82
KR - Corea 73
PL - Polonia 46
IN - India 39
MX - Messico 33
AR - Argentina 31
EC - Ecuador 25
CA - Canada 23
BD - Bangladesh 22
TR - Turchia 19
ES - Italia 18
NL - Olanda 16
IQ - Iraq 14
ID - Indonesia 12
CH - Svizzera 9
PH - Filippine 9
PK - Pakistan 9
AU - Australia 8
CO - Colombia 8
ZA - Sudafrica 8
AT - Austria 7
BE - Belgio 7
CL - Cile 7
TN - Tunisia 7
GR - Grecia 6
IL - Israele 6
MY - Malesia 6
BY - Bielorussia 5
A1 - Anonimo 4
AL - Albania 4
CI - Costa d'Avorio 4
EG - Egitto 4
MA - Marocco 4
SA - Arabia Saudita 4
TH - Thailandia 4
VE - Venezuela 4
AE - Emirati Arabi Uniti 3
HU - Ungheria 3
JM - Giamaica 3
KE - Kenya 3
KZ - Kazakistan 3
LT - Lituania 3
PY - Paraguay 3
CR - Costa Rica 2
DO - Repubblica Dominicana 2
EU - Europa 2
HN - Honduras 2
KG - Kirghizistan 2
LK - Sri Lanka 2
PA - Panama 2
TT - Trinidad e Tobago 2
TW - Taiwan 2
UZ - Uzbekistan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AZ - Azerbaigian 1
BA - Bosnia-Erzegovina 1
BB - Barbados 1
BG - Bulgaria 1
BN - Brunei Darussalam 1
BS - Bahamas 1
CG - Congo 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
DM - Dominica 1
DZ - Algeria 1
ET - Etiopia 1
GE - Georgia 1
IR - Iran 1
JO - Giordania 1
LB - Libano 1
MK - Macedonia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
OM - Oman 1
PE - Perù 1
PS - Palestinian Territory 1
PT - Portogallo 1
QA - Qatar 1
RO - Romania 1
RS - Serbia 1
SN - Senegal 1
UY - Uruguay 1
VG - Isole Vergini Britanniche 1
XK - ???statistics.table.value.countryCode.XK??? 1
Totale 37.936
Città #
Wilmington 8.817
Woodbridge 8.571
Houston 8.421
Fairfield 1.107
Singapore 821
Ann Arbor 616
Ashburn 531
Seattle 435
Chandler 369
Cambridge 367
Jacksonville 366
Dublin 294
San Jose 292
Dearborn 232
Hong Kong 209
Medford 204
Beijing 169
New York 132
Santa Clara 131
The Dalles 123
Lawrence 99
Tokyo 97
Rome 73
Lauterbourg 69
Moscow 69
Ho Chi Minh City 65
Los Angeles 63
Buffalo 56
Menlo Park 52
Mülheim 48
San Diego 44
Hanoi 43
Zhengzhou 41
São Paulo 40
Kraków 36
Milan 26
Des Moines 24
Helsinki 22
Norwalk 19
Falls Church 18
Dallas 17
Guangzhou 17
London 17
Palo Alto 16
Rio de Janeiro 16
Hangzhou 15
Verona 15
Council Bluffs 14
Phoenix 14
San Francisco 14
Chicago 13
Mexico City 13
Kunming 12
Orem 12
Belo Horizonte 11
Hefei 11
Nuremberg 11
Redondo Beach 11
University Park 11
Atlanta 10
Quito 10
Saint Petersburg 10
San Mateo 10
Shanghai 10
Da Nang 9
Haiphong 8
Nanjing 8
Redwood City 8
Boston 7
Brussels 7
Chennai 7
Dhaka 7
Salvador 7
Toronto 7
Amsterdam 6
Brasília 6
Brooklyn 6
Columbus 6
Heiwajima 6
Jinan 6
Kyoto 6
Munich 6
Nanchang 6
Stockholm 6
Warsaw 6
Denver 5
Florence 5
Frankfurt am Main 5
Fuzhou 5
Goiânia 5
Hải Dương 5
Kuala Lumpur 5
Manchester 5
Marabá 5
Minsk 5
Xian 5
Bangkok 4
Boardman 4
Campinas 4
Can Tho 4
Totale 33.733
Nome #
Novel local-search-based approaches to university examination timetabling 511
Finding strong bridges and strong articulation points in linear time 498
Design of trees in the hose model: The balanced case 486
2-Connectivity in directed graphs: an experimental study 478
Experimental study of resilient algorithms and data structures 477
The price of resiliency: a case study on sorting with memory faults 472
2-Vertex connectivity in directed graphs 472
An experimental study of dynamic dominators 470
Algorithmic techniques for maintaining shortest routes in dynamic networks 466
Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n(2)) barrier 462
A traffic-based evolutionary algorithm for network clustering 458
Penalized second price: a new pricing algorithm for advertising in search engines 457
CHECKCOL: improved local search for graph coloring 455
Computing graph spanners in small memory: fault-tolerance and streaming 454
SAVED: Secure Android Value addED services 453
Designing reliable algorithms in unreliable memories 447
Optimal resilient sorting and searching in the presence of memory faults 444
A Forensic-as-a-servicedelivery platform for law enforcement agencies 440
On a facility location problem with applications to tele-diagnostic 439
The value of location in keyword auctions 438
Sorting and searching in faulty memories 438
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures 436
2D Color Barcodes for Mobile Phones 434
Data structures resilient to memory faults: An experimental study of dictionaries 431
A new approach to dynamic all pairs shortest paths 428
Exploiting GPS data in public transport journey planners 427
Better transit routing by exploiting vehicle GPS data 427
Data structures resilient to memory faults: an experimental study of dictionaries 426
A stochastic location problem with applications to tele-diagnostic 425
Design of dynamic algorithms via primal-dual method 424
High capacity colored two dimensional codes 423
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs 419
Traffic-based network clustering 417
Computing graph spanners in small memory: fault-tolerance and streaming 417
Handwritten signature verification with 2D color barcodes 417
Finding strong articulation points and strong bridges in linear time 414
AMachine Learning-based approach to Digital Triage 414
Reliability and data density in high capacity color barcodes 414
2-Edge connectivity in directed graphs 414
Traffic vs topology in network clustering: Does it matter? 412
Distributed simulation of Electronic Warfare command and control scenarios 409
Maintaining dynamic minimum spanning trees: an experimental study 408
On suffix extensions in suffix trees 407
Near real-time suffix tree construction via the fringe marked ancestor problem 404
The competitor busting strategy in keyword auctions: who’s worst hit? 403
Facial recognition with 2D color barcodes 402
Resilient dictionaries 401
Topic 12: Theory and Algorithms for Parallel Computation 401
On Suffix Extensions in Suffix Trees 400
A simulator of a mobile ad-hoc network in a hostile environment 398
An evolutionary algorithm for network clustering through traffic matrices 393
Small stretch spanners on dynamic graphs 392
Engineering color barcode algorithms for mobile applications 392
Resilient algorithms and data structures 391
Computing strong articulation points and strong bridges in large scale graphs 390
Fully dynamic all pairs shortest paths with real edge weights 388
On Resilient Graph Spanners 385
Improved algorithms for min cut and max flow in undirected planar graphs 384
Shared backup & restore: save, recover and share personal information into closed groups of smartphones 383
Near real-time suffix tree construction via the fringe marked ancestor problem 382
Facial biometrics for 2D barcodes 382
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs 382
Small stretch (alpha, beta)-spanners in the streaming model 381
Deterministic fully dynamic data structures for vertex cover and matching 381
A model for the dynamics of bidders in the simulation of keyword auctions 379
Mantaining dynamic matrices for fully dynamic transitive closure 378
Experimental analysis of dynamic all pairs shortest path algorithms 375
SecureMyDroid: enforcing security in the mobile devices lifecycle 371
New Algorithms for Examination Timetabling 369
The Quest for the shortest route 365
Is timetabling routing always reliable for public transport? 363
Sparse subgraphs for 2-connectivity in directed graphs 353
Frequency domain analysis of large-scale proxy logs for botnet traffic detection 342
Incremental strong connectivity and 2 connectivity in directed graphs 341
A data streaming approach to link mining in criminal networks 336
On resilient graph spanners 334
Graph spanners in the streaming model: an experimental study 334
Dynamic algorithms via the primal-dual method 331
Sparse certificates for 2-connectivity in directed graphs 323
Tropical paths in vertex-colored graphs 311
Strong articulation points and strong bridges in large scale graphs 309
Computing critical nodes in directed graphs 308
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs 304
Decremental single-source reachability and strongly connected components in Õ(m√n) total update time 302
Online handwritten signature verification for low-end devices 301
Fast mining of large-scale logs for Botnet detection: a field study 295
Strong connectivity in directed graphs under failures, with applications 285
All-pairs 2-reachability in O(nωlog n) time 281
Maximum colorful cycles in vertex-colored graphs 275
Computing 2-Connected components and maximal 2-Connected subgraphs in directed graphs: An experimental study 273
An operational framework for incident handling 272
Decremental data structures for connectivity and dominators in directed graphs 266
2-vertex connectivity in directed graphs 265
Contracting a planar graph efficiently 262
Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders 249
Preventing ransomware attacks through file system filter drivers 230
What's inside a bow-tie: Analyzing the core of the web and of social networks 221
On bubble generators in directed graphs 216
Decremental single-source reachability in planar digraphs 193
All-Pairs LCA in DAGs: breaking through the O(n2.5) barrier 63
Totale 37.948
Categoria #
all - tutte 77.098
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 77.098


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021335 0 0 0 0 0 0 0 0 0 91 192 52
2021/2022875 45 98 22 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.621 202 125 363 160 217 69 452 396 407 230 0 0
Totale 38.118