IRIS
ITALIANO, GIUSEPPE FRANCESCO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 31.558
EU - Europa 1.632
AS - Asia 970
SA - Sud America 16
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 7
Totale 34.191
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 31.547
SG - Singapore 587
UA - Ucraina 405
IE - Irlanda 308
DE - Germania 279
CN - Cina 264
IT - Italia 161
RU - Federazione Russa 92
SE - Svezia 88
FI - Finlandia 79
FR - Francia 76
KR - Corea 73
GB - Regno Unito 65
PL - Polonia 38
JP - Giappone 16
IN - India 11
CA - Canada 9
CH - Svizzera 8
AU - Australia 7
BE - Belgio 7
BR - Brasile 7
GR - Grecia 5
A1 - Anonimo 4
BY - Bielorussia 4
EC - Ecuador 4
ES - Italia 4
NL - Olanda 4
AT - Austria 3
CL - Cile 3
HK - Hong Kong 3
IL - Israele 3
EU - Europa 2
ID - Indonesia 2
KG - Kirghizistan 2
MY - Malesia 2
VN - Vietnam 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AR - Argentina 1
BA - Bosnia-Erzegovina 1
BG - Bulgaria 1
DK - Danimarca 1
DM - Dominica 1
HU - Ungheria 1
IR - Iran 1
LT - Lituania 1
MX - Messico 1
NZ - Nuova Zelanda 1
PE - Perù 1
PH - Filippine 1
RO - Romania 1
TH - Thailandia 1
TR - Turchia 1
TW - Taiwan 1
Totale 34.191
Salva come PNG Salva come JPEG
Città #
Wilmington 8.868
Woodbridge 8.697
Houston 8.505
Fairfield 1.123
Ann Arbor 617
Singapore 502
Ashburn 459
Seattle 437
Cambridge 371
Jacksonville 371
Chandler 369
Dublin 297
Dearborn 235
Medford 206
New York 115
Santa Clara 114
Beijing 112
Lawrence 100
Moscow 57
Rome 54
Menlo Park 53
Mülheim 48
San Diego 44
Zhengzhou 41
Kraków 36
Milan 21
Falls Church 19
Norwalk 19
London 16
Palo Alto 16
Verona 15
Hangzhou 12
Kunming 12
Hefei 11
University Park 11
Saint Petersburg 10
San Mateo 10
Nanjing 8
Redwood City 8
Shanghai 8
Brussels 7
Helsinki 7
Heiwajima 6
Jinan 6
Nanchang 6
Fuzhou 5
Kyoto 5
Marabá 5
Nuremberg 5
Stockholm 5
Xian 5
Boardman 4
Florence 4
Guangzhou 4
Hebei 4
Minsk 4
Phoenix 4
Quito 4
Redmond 4
San Francisco 4
Toronto 4
Augusta 3
Hamburg 3
Harbin 3
Kilburn 3
Kyiv 3
Lausanne 3
Naples 3
Shenyang 3
Tokyo 3
Zurich 3
Andover 2
Ariccia 2
Atlanta 2
Auburn Hills 2
Chengdu 2
Chiswick 2
Clearwater 2
Dongguan 2
Karlsruhe 2
Klosterneuburg 2
Loreggia 2
Los Angeles 2
Madrid 2
Meylan 2
Munich 2
Ningbo 2
Novokuznetsk 2
Perugia 2
Povegliano 2
Prescot 2
Roebling 2
Taizhou 2
Terricciola 2
Trieste 2
Wuhan 2
Apo 1
Auckland 1
Bangkok 1
Begard 1
Totale 32.213
Salva come PNG Salva come JPEG
Nome #
Finding strong bridges and strong articulation points in linear time 459
Experimental study of resilient algorithms and data structures 452
Design of trees in the hose model: The balanced case 441
Trade-offs for fully dynamic transitive closure on DAGs: Breaking through the O(n(2)) barrier 433
Algorithmic techniques for maintaining shortest routes in dynamic networks 430
An experimental study of dynamic dominators 426
The price of resiliency: a case study on sorting with memory faults 421
Computing graph spanners in small memory: fault-tolerance and streaming 419
Designing reliable algorithms in unreliable memories 415
CHECKCOL: improved local search for graph coloring 413
2-Vertex connectivity in directed graphs 412
2-Connectivity in directed graphs: an experimental study 411
Optimal resilient sorting and searching in the presence of memory faults 408
A traffic-based evolutionary algorithm for network clustering 407
Exploiting GPS data in public transport journey planners 404
Sorting and searching in faulty memories 404
On a facility location problem with applications to tele-diagnostic 401
Penalized second price: a new pricing algorithm for advertising in search engines 400
Data structures resilient to memory faults: An experimental study of dictionaries 400
Better transit routing by exploiting vehicle GPS data 400
Design of dynamic algorithms via primal-dual method 400
Computing graph spanners in small memory: fault-tolerance and streaming 398
A Forensic-as-a-servicedelivery platform for law enforcement agencies 397
SAVED: Secure Android Value addED services 395
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures 394
High capacity colored two dimensional codes 393
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs 393
Handwritten signature verification with 2D color barcodes 392
The value of location in keyword auctions 391
Data structures resilient to memory faults: an experimental study of dictionaries 390
Traffic-based network clustering 384
Reliability and data density in high capacity color barcodes 384
Near real-time suffix tree construction via the fringe marked ancestor problem 380
Traffic vs topology in network clustering: Does it matter? 376
A stochastic location problem with applications to tele-diagnostic 376
Maintaining dynamic minimum spanning trees: an experimental study 375
On suffix extensions in suffix trees 374
Finding strong articulation points and strong bridges in linear time 374
Topic 12: Theory and Algorithms for Parallel Computation 372
Resilient algorithms and data structures 371
Facial recognition with 2D color barcodes 371
AMachine Learning-based approach to Digital Triage 370
The competitor busting strategy in keyword auctions: who’s worst hit? 369
Small stretch spanners on dynamic graphs 367
Distributed simulation of Electronic Warfare command and control scenarios 366
Resilient dictionaries 365
On Suffix Extensions in Suffix Trees 365
Engineering color barcode algorithms for mobile applications 364
Fully dynamic all pairs shortest paths with real edge weights 362
A new approach to dynamic all pairs shortest paths 360
On Resilient Graph Spanners 358
Small stretch (alpha, beta)-spanners in the streaming model 353
Improved algorithms for min cut and max flow in undirected planar graphs 353
Deterministic fully dynamic data structures for vertex cover and matching 353
2D Color Barcodes for Mobile Phones 351
A simulator of a mobile ad-hoc network in a hostile environment 351
Shared backup & restore: save, recover and share personal information into closed groups of smartphones 350
Facial biometrics for 2D barcodes 349
Experimental analysis of dynamic all pairs shortest path algorithms 348
Computing strong articulation points and strong bridges in large scale graphs 348
Near real-time suffix tree construction via the fringe marked ancestor problem 346
A model for the dynamics of bidders in the simulation of keyword auctions 344
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs 344
Mantaining dynamic matrices for fully dynamic transitive closure 342
An evolutionary algorithm for network clustering through traffic matrices 342
New Algorithms for Examination Timetabling 339
The Quest for the shortest route 333
Is timetabling routing always reliable for public transport? 330
On a Facility Location Problem with Applications to Tele-Diagnostic 330
Novel local-search-based approaches to university examination timetabling 321
2-Edge connectivity in directed graphs 318
Sparse subgraphs for 2-connectivity in directed graphs 315
Frequency domain analysis of large-scale proxy logs for botnet traffic detection 311
On resilient graph spanners 307
Graph spanners in the streaming model: an experimental study 304
Incremental strong connectivity and 2 connectivity in directed graphs 303
Dynamic algorithms via the primal-dual method 295
Sparse certificates for 2-connectivity in directed graphs 287
Tropical paths in vertex-colored graphs 283
A data streaming approach to link mining in criminal networks 280
SecureMyDroid: enforcing security in the mobile devices lifecycle 279
Computing critical nodes in directed graphs 279
Online handwritten signature verification for low-end devices 277
Decremental single-source reachability and strongly connected components in Õ(m√n) total update time 274
Faster algorithms for computing maximal 2-connected subgraphs in sparse directed graphs 272
Fast mining of large-scale logs for Botnet detection: a field study 256
Strong connectivity in directed graphs under failures, with applications 253
Maximum colorful cycles in vertex-colored graphs 253
Strong articulation points and strong bridges in large scale graphs 252
All-pairs 2-reachability in O(nωlog n) time 248
Decremental data structures for connectivity and dominators in directed graphs 242
Contracting a planar graph efficiently 235
Computing 2-Connected components and maximal 2-Connected subgraphs in directed graphs: An experimental study 232
An operational framework for incident handling 228
Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders 218
Preventing ransomware attacks through file system filter drivers 196
What's inside a bow-tie: Analyzing the core of the web and of social networks 194
On bubble generators in directed graphs 187
2-vertex connectivity in directed graphs 185
Decremental single-source reachability in planar digraphs 166
Totale 34.338
Salva come PNG Salva come JPEG
Categoria #
all - tutte 60.167
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 60.167
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20207.771 0 0 0 1.048 860 1.127 925 858 933 709 628 683
2020/20215.256 590 683 581 731 542 519 637 503 131 92 194 53
2021/2022883 45 100 22 39 30 63 52 52 55 91 64 270
2022/20231.033 129 80 42 121 51 275 93 61 71 8 69 33
2023/2024376 28 19 14 13 22 137 13 0 9 13 8 100
2024/2025969 76 619 263 11 0 0 0 0 0 0 0 0
Totale 34.357