IRIS
ITALIANO, GIUSEPPE FRANCESCO
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 31.559
EU - Europa 1.716
AS - Asia 998
SA - Sud America 18
OC - Oceania 8
Continente sconosciuto - Info sul continente non disponibili 7
AF - Africa 1
Totale 34.307
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 31.548
SG - Singapore 615
UA - Ucraina 405
IE - Irlanda 308
DE - Germania 279
CN - Cina 264
RU - Federazione Russa 175
IT - Italia 161
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
BR - Brasile 8
CH - Svizzera 8
AU - Australia 7
BE - Belgio 7
EC - Ecuador 5
GR - Grecia 5
NL - Olanda 5
A1 - Anonimo 4
BY - Bielorussia 4
ES - Italia 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
ZA - Sudafrica 1
Totale 34.307
Salva come PNG Salva come JPEG
Città #
Wilmington 8.868
Woodbridge 8.697
Houston 8.505
Fairfield 1.123
Ann Arbor 617
Singapore 511
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.222
Salva come PNG Salva come JPEG
Nome #
Finding strong bridges and strong articulation points in linear time 460
Experimental study of resilient algorithms and data structures 453
Design of trees in the hose model: The balanced case 442
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 427
The price of resiliency: a case study on sorting with memory faults 422
Computing graph spanners in small memory: fault-tolerance and streaming 419
CHECKCOL: improved local search for graph coloring 415
Designing reliable algorithms in unreliable memories 415
2-Vertex connectivity in directed graphs 412
2-Connectivity in directed graphs: an experimental study 412
Optimal resilient sorting and searching in the presence of memory faults 408
A traffic-based evolutionary algorithm for network clustering 408
Sorting and searching in faulty memories 405
On a facility location problem with applications to tele-diagnostic 404
Exploiting GPS data in public transport journey planners 404
Penalized second price: a new pricing algorithm for advertising in search engines 401
Data structures resilient to memory faults: An experimental study of dictionaries 401
Better transit routing by exploiting vehicle GPS data 401
Design of dynamic algorithms via primal-dual method 401
Computing graph spanners in small memory: fault-tolerance and streaming 398
A Forensic-as-a-servicedelivery platform for law enforcement agencies 398
SAVED: Secure Android Value addED services 396
Dynamic shortest paths and transitive closure: algorithmic techniques and data structures 395
High capacity colored two dimensional codes 394
Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs 394
Handwritten signature verification with 2D color barcodes 393
The value of location in keyword auctions 392
Data structures resilient to memory faults: an experimental study of dictionaries 391
Reliability and data density in high capacity color barcodes 385
Traffic-based network clustering 384
Near real-time suffix tree construction via the fringe marked ancestor problem 381
A stochastic location problem with applications to tele-diagnostic 377
Maintaining dynamic minimum spanning trees: an experimental study 376
Traffic vs topology in network clustering: Does it matter? 376
On suffix extensions in suffix trees 375
Finding strong articulation points and strong bridges in linear time 375
Topic 12: Theory and Algorithms for Parallel Computation 373
Resilient algorithms and data structures 372
Facial recognition with 2D color barcodes 372
AMachine Learning-based approach to Digital Triage 371
The competitor busting strategy in keyword auctions: who’s worst hit? 369
Small stretch spanners on dynamic graphs 368
Distributed simulation of Electronic Warfare command and control scenarios 367
On Suffix Extensions in Suffix Trees 367
Resilient dictionaries 365
Engineering color barcode algorithms for mobile applications 365
Fully dynamic all pairs shortest paths with real edge weights 363
A new approach to dynamic all pairs shortest paths 361
On Resilient Graph Spanners 359
Small stretch (alpha, beta)-spanners in the streaming model 354
Improved algorithms for min cut and max flow in undirected planar graphs 354
Deterministic fully dynamic data structures for vertex cover and matching 354
2D Color Barcodes for Mobile Phones 352
A simulator of a mobile ad-hoc network in a hostile environment 352
Shared backup & restore: save, recover and share personal information into closed groups of smartphones 351
Facial biometrics for 2D barcodes 350
Experimental analysis of dynamic all pairs shortest path algorithms 349
Computing strong articulation points and strong bridges in large scale graphs 349
Near real-time suffix tree construction via the fringe marked ancestor problem 347
Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs 346
A model for the dynamics of bidders in the simulation of keyword auctions 345
Mantaining dynamic matrices for fully dynamic transitive closure 343
An evolutionary algorithm for network clustering through traffic matrices 343
New Algorithms for Examination Timetabling 340
The Quest for the shortest route 334
2-Edge connectivity in directed graphs 333
On a Facility Location Problem with Applications to Tele-Diagnostic 331
Is timetabling routing always reliable for public transport? 330
Novel local-search-based approaches to university examination timetabling 322
Sparse subgraphs for 2-connectivity in directed graphs 315
Frequency domain analysis of large-scale proxy logs for botnet traffic detection 312
On resilient graph spanners 308
Graph spanners in the streaming model: an experimental study 305
Incremental strong connectivity and 2 connectivity in directed graphs 303
Dynamic algorithms via the primal-dual method 296
SecureMyDroid: enforcing security in the mobile devices lifecycle 293
Sparse certificates for 2-connectivity in directed graphs 288
Tropical paths in vertex-colored graphs 284
A data streaming approach to link mining in criminal networks 282
Computing critical nodes in directed graphs 280
Online handwritten signature verification for low-end devices 278
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 274
Fast mining of large-scale logs for Botnet detection: a field study 257
Strong articulation points and strong bridges in large scale graphs 253
Strong connectivity in directed graphs under failures, with applications 253
Maximum colorful cycles in vertex-colored graphs 253
All-pairs 2-reachability in O(nωlog n) time 248
Decremental data structures for connectivity and dominators in directed graphs 243
Contracting a planar graph efficiently 236
Computing 2-Connected components and maximal 2-Connected subgraphs in directed graphs: An experimental study 233
An operational framework for incident handling 229
Approximating the smallest 2-vertex-connected spanning subgraph via low-high orders 219
Preventing ransomware attacks through file system filter drivers 197
What's inside a bow-tie: Analyzing the core of the web and of social networks 195
On bubble generators in directed graphs 188
2-vertex connectivity in directed graphs 186
Decremental single-source reachability in planar digraphs 167
Totale 34.453
Salva come PNG Salva come JPEG
Categoria #
all - tutte 61.771
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 61.771
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20206.723 0 0 0 0 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/20251.085 76 619 263 115 12 0 0 0 0 0 0 0
Totale 34.473