IRIS
DI STEFANO, GABRIELE
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 3.913
EU - Europa 2.816
AS - Asia 1.317
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 6
SA - Sud America 4
AF - Africa 2
Totale 8.065
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 3.896
IE - Irlanda 959
CN - Cina 765
TR - Turchia 503
SE - Svezia 494
IT - Italia 395
DE - Germania 259
UA - Ucraina 246
GB - Regno Unito 236
FI - Finlandia 120
FR - Francia 66
IN - India 27
BE - Belgio 15
CA - Canada 14
RU - Federazione Russa 9
JP - Giappone 7
EU - Europa 6
IL - Israele 6
AU - Australia 5
BR - Brasile 4
MX - Messico 3
NL - Olanda 3
RO - Romania 3
ES - Italia 2
IR - Iran 2
KR - Corea 2
TW - Taiwan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AT - Austria 1
BG - Bulgaria 1
DK - Danimarca 1
EE - Estonia 1
HK - Hong Kong 1
IM - Isola di Man 1
LU - Lussemburgo 1
MA - Marocco 1
MD - Moldavia 1
MY - Malesia 1
NO - Norvegia 1
NZ - Nuova Zelanda 1
PL - Polonia 1
SA - Arabia Saudita 1
SN - Senegal 1
Totale 8.065
Salva come PNG Salva come JPEG
Città #
Jacksonville 970
Dublin 959
Chandler 841
Izmir 251
Nanjing 225
San Mateo 176
Boardman 174
L’Aquila 164
Wilmington 145
Lawrence 132
Princeton 132
Hangzhou 117
New York 112
Ashburn 107
Woodbridge 78
Beijing 68
Nanchang 63
Ann Arbor 61
L'aquila 53
Milan 53
Kunming 52
Shenyang 34
Tianjin 34
Verona 33
Jiaxing 31
Hebei 29
Des Moines 26
Los Angeles 26
Mountain View 26
Seattle 24
Houston 19
Jinan 18
Ningbo 17
Norwalk 15
Changsha 13
Falls Church 13
Brussels 12
Helsinki 12
Pescara 12
Perugia 10
Lanzhou 9
Montesilvano Marina 9
Pune 9
Zhengzhou 9
Auburn Hills 7
Guangzhou 7
Grafing 6
Ottawa 6
Venezia 6
Changchun 5
Orange 5
Taizhou 5
Dearborn 4
Düsseldorf 4
Foggia 4
Fremont 4
Haikou 4
Paris 4
Shanghai 4
Toronto 4
Napoli 3
Redmond 3
Tappahannock 3
Washington 3
Aprilia 2
Aquila 2
Baldissero Torinese 2
Bremen 2
Buffalo 2
Cambridge 2
Edinburgh 2
Fairfield 2
Fuzhou 2
Gothenburg 2
Greenwich 2
Grotteria 2
Lappeenranta 2
Lawrenceville 2
Madrid 2
Mexico City 2
Philadelphia 2
Redwood City 2
Rome 2
West Jordan 2
Andover 1
Antwerpen 1
Atlanta 1
Auckland 1
Bangalore 1
Barrea 1
Boston 1
Brasov 1
Burnaby 1
Casablanca 1
Cedar Knolls 1
Cedar Park 1
Central District 1
Charlotte 1
Chengdu 1
Chisinau 1
Totale 5.520
Salva come PNG Salva come JPEG
Nome #
The Online Track Assignment Problem. 182
A Fully Dynamic Algorithm for Distributed Shortest Paths 160
(k,+)-distance hereditary graphs (extended abstract) 159
Gathering of Robots on Meeting-Points 92
Recoverable robustness in shunting and timetabling 89
Asynchronous embedded pattern formation without orientation 87
Track assignment 82
Gathering a swarm of robots through shortest paths 82
About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings 80
Decomposing Octilinear Polygons into Triangles and Rectangles 79
Delay Management Problem: Complexity Results and Robust Algorithms 76
Minimum-Traveled-Distance Gathering of Oblivious Robots over given Meeting Points 75
Graph classes between parity and distance-hereditary graphs 74
Graphs with bounded induced distance 73
Graphs with bounded induced distance 73
MinMax-Distance Gathering on given Meeting Points 73
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach 73
Min-Max Coverage in Multi-Interface Networks. 72
Static and Dynamic Low-Congested Interval Routing Schemes 72
Gathering of oblivious robots on infinite grids with minimum traveled distance 72
How to Gather Asynchronous Oblivious Robots on Anonymous Rings 71
Compact-port routing models and applications to distance-hereditary graphs 71
Bamboo Garden Trimming Problem: Priority Schedulings 71
Multi-stage recovery robustness for optimization problems: a new concept for planning under disturbances 70
Gathering Six Oblivious Robots on Anonymous Symmetric Rings” 70
Networks with Small Stretch Number 70
Computing on rings by oblivious robots: a unified approach for different tasks 69
Self-spanner graphs 68
An electronic system for integrated management of patients’ data and radiological images 68
Analysis and implementation of a vlsi neural network 68
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation 68
(k,+)-distance-hereditary graphs 68
What the Mantis shrimp's eye (possibly) tells its raptorial appendages 68
A model for the dynamic properties of integrating fibers: target localization in a three-dimentional space - I mathematical description 67
Gathering of Six Robots on Anonymous Symmetric Rings. 67
New results for neural networks and genetic algorithms in visual field diagnosis 67
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 66
Gathering of Robots on Anonymous Grids and Trees without Multiplicity Detection 66
On the equivalence in complexity among basic problems on bipartite and parity graphs 66
A unified approach for different tasks on rings in robot-based computing systems 66
A routing algorithm for networks based on distance-hereditary topologies 66
Evaluation of recoverable-robust timetables on tree networks. 66
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms 66
Robust Algorithms and Price of Robustness in Shunting Problems 66
The game of Scintillae: From cellular automata to computing and cryptography systems 65
A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation 65
Bandwidth constrained multi-interface networks. 65
Maintenance of Multi-level Overlay Graphs for Timetable Queries 65
Recoverable Robustness for Train Shunting Problems 64
Gathering of Robots on Anonymous Grids without Multiplicity Detection. 64
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks 63
Gathering on rings under the Look-Compute-Move model 63
Platform assignment 63
A graph theoretical approach to the shunting problem. 63
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings 63
Improved protocols for luminous asynchronous robots 63
A model for the dynamic properties of integrating fibers: target localization in a three-dimentional space - II computer simulation 62
A neural model for localizing targets in space accomplished by the eye of a Mantis shrimp 62
A workstation for image processing and digitalization of conventional films 61
Treelike comparability graphs: Characterization, recognition and applications. 61
Consequences of limitation on weights in feed-forward multi-layer neural networks 61
A multimodal interface for a medical workstation 61
Engineering a new algorithm for distributed shortest paths on dynamic networks 61
Graph classes between parity and distance-hereditary graphs 60
Online Bounded Coloring of Permutations and Overlap Graphs 60
Minimize the Maximum Duty in Multi-interface Networks 59
An Extension to the Back-Propagation Algorithm 59
Functional integration of digital radiological equipment 59
An Extension to the Back-Propagation Algorithm 59
Partially Dynamic Concurrent Update of Distributed Shortest Paths 59
On minimum $k$-modal partition of permutations 58
On the representation and management of medical records in a knowledge based systems 58
Distributed Positioning Algorithms for Ad-hoc Networks 58
Milord: Advanced database technology for implementing a multimedia medical workstation 57
Survivable Networks with Bounded Delay: The Edge Failure Case 57
Multi-Interface Wireless Networks: Complexity and Algorithms 56
A Fully Dynamic Algorithm for Distributed Shortest Paths 55
Distributed positioning algorithm for ad-hoc networks. 55
COFLEX: FLEXIBLE BRACELET ANTI COVID-19 to PROTECT CONSTRUCTION WORKERS 55
Robust Algorithms and Price of Robustness in Shunting Problems 54
Static and Dynamic Low-Congested Interval Routing Schemes 54
Dynamic Algorithms for Recoverable Robustness Problems 54
Characterizing the Computational Power of Mobile Robots on Graphs and Implications for the Euclidean Plane 54
Asynchronous Robots on graphs: Gathering 54
Approximation algorithms for decomposing octilinear polygons 54
Distance-Hereditary Comparability Graphs 53
Flow problems in Multi-Interface Networks 53
Gathering robots in graphs: The central role of synchronicity 53
On the online track assignment problem 52
Partially dynamic efficient algorithms for distributed shortest paths 52
Milord: Project result and future work. 52
Compact-Port Routing Models and Applications to Distance-Hereditary Graphs 52
Recoverable Robust Timetables: An Algorithmic Approach on Trees 51
Optimal Gathering of Oblivious Robots in Anonymous Graphs 50
Recoverable robust timetables on trees. 50
Embedded pattern formation by asynchronous robots without chirality 50
Target localization in different luminous environments 49
Gathering Asynchronous and Oblivious Robots on basic Graph Topologies under the Look-Compute-Move model 49
Recoverable-robust timetables for trains on single line corridors 49
Partially dynamic efficient algorithms for distributed shortest paths 49
Totale 6.661
Salva come PNG Salva come JPEG
Categoria #
all - tutte 27.025
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 27.025
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/2019352 0 0 0 0 0 0 0 0 0 0 23 329
2019/20201.036 225 6 148 8 8 128 158 13 147 11 45 139
2020/20211.083 32 122 1 128 126 55 129 1 129 78 229 53
2021/2022882 62 86 181 66 53 8 30 45 57 10 43 241
2022/20232.506 175 114 41 236 221 267 6 161 1.175 12 57 41
2023/2024771 243 42 34 110 39 214 12 24 3 42 8 0
Totale 8.189