DI STEFANO, GABRIELE
 Distribuzione geografica
Continente #
NA - Nord America 4.486
EU - Europa 2.933
AS - Asia 2.276
SA - Sud America 165
AF - Africa 14
Continente sconosciuto - Info sul continente non disponibili 7
OC - Oceania 6
Totale 9.887
Nazione #
US - Stati Uniti d'America 4.462
IE - Irlanda 959
CN - Cina 836
SG - Singapore 585
TR - Turchia 506
SE - Svezia 494
IT - Italia 458
DE - Germania 287
HK - Hong Kong 277
UA - Ucraina 246
GB - Regno Unito 237
BR - Brasile 149
FI - Finlandia 128
FR - Francia 67
IN - India 27
BE - Belgio 15
CA - Canada 14
RU - Federazione Russa 14
IL - Israele 8
JP - Giappone 7
EC - Ecuador 6
EU - Europa 6
IQ - Iraq 6
AU - Australia 5
MX - Messico 5
VE - Venezuela 5
NL - Olanda 4
AT - Austria 3
BD - Bangladesh 3
KR - Corea 3
MA - Marocco 3
RO - Romania 3
TN - Tunisia 3
ZA - Sudafrica 3
AR - Argentina 2
BG - Bulgaria 2
DK - Danimarca 2
DZ - Algeria 2
ES - Italia 2
GE - Georgia 2
GT - Guatemala 2
IR - Iran 2
KE - Kenya 2
LU - Lussemburgo 2
PA - Panama 2
PK - Pakistan 2
TW - Taiwan 2
A2 - ???statistics.table.value.countryCode.A2??? 1
AZ - Azerbaigian 1
BH - Bahrain 1
BO - Bolivia 1
CO - Colombia 1
CZ - Repubblica Ceca 1
DO - Repubblica Dominicana 1
EE - Estonia 1
HU - Ungheria 1
IM - Isola di Man 1
KW - Kuwait 1
KZ - Kazakistan 1
LV - Lettonia 1
MD - Moldavia 1
MY - Malesia 1
NO - Norvegia 1
NP - Nepal 1
NZ - Nuova Zelanda 1
OM - Oman 1
PL - Polonia 1
PT - Portogallo 1
SA - Arabia Saudita 1
SK - Slovacchia (Repubblica Slovacca) 1
SN - Senegal 1
SY - Repubblica araba siriana 1
UY - Uruguay 1
UZ - Uzbekistan 1
Totale 9.887
Città #
Jacksonville 970
Dublin 959
Chandler 841
Singapore 492
Boardman 324
Santa Clara 319
Hong Kong 274
Izmir 251
Nanjing 227
San Mateo 176
L’Aquila 170
Wilmington 145
Lawrence 132
Princeton 132
Hangzhou 117
New York 114
Ashburn 109
Woodbridge 78
Beijing 71
Milan 67
Nanchang 63
Ann Arbor 61
L'aquila 53
Kunming 52
Shenyang 35
Tianjin 34
Verona 33
Jiaxing 32
Hebei 29
Los Angeles 28
Des Moines 26
Mountain View 26
Seattle 24
North Bergen 23
Kitzingen 20
Houston 19
Helsinki 18
Jinan 18
Ningbo 17
Council Bluffs 16
Norwalk 15
Pescara 15
Changsha 14
Dallas 14
São Paulo 14
Falls Church 13
Rome 13
Brussels 12
Perugia 10
Guangzhou 9
Lanzhou 9
Montesilvano Marina 9
Pune 9
Zhengzhou 9
Shanghai 8
Auburn Hills 7
Changchun 6
Grafing 6
Ottawa 6
Rio de Janeiro 6
Shenzhen 6
Venezia 6
Orange 5
Paris 5
Taizhou 5
Baghdad 4
Belo Horizonte 4
Brasília 4
Chengdu 4
Dearborn 4
Düsseldorf 4
Foggia 4
Fremont 4
Haikou 4
Lappeenranta 4
Quito 4
Toronto 4
Campinas 3
Napoli 3
Redmond 3
Tappahannock 3
Washington 3
Americana 2
Ancona 2
Aprilia 2
Aquila 2
Baldissero Torinese 2
Belford Roxo 2
Berlin 2
Bremen 2
Buffalo 2
Cambridge 2
Edinburgh 2
Fairfield 2
Fuzhou 2
Gothenburg 2
Gravataí 2
Greenwich 2
Grotteria 2
Guatemala City 2
Totale 6.925
Nome #
The Online Track Assignment Problem. 192
(k,+)-distance hereditary graphs (extended abstract) 170
A Fully Dynamic Algorithm for Distributed Shortest Paths 168
Asynchronous embedded pattern formation without orientation 143
Recoverable robustness in shunting and timetabling 102
Gathering of Robots on Meeting-Points 101
About Ungatherability of Oblivious and Asynchronous Robots on Anonymous Rings 98
Gathering a swarm of robots through shortest paths 96
Gathering of oblivious robots on infinite grids with minimum traveled distance 95
Track assignment 91
Asynchronous Arbitrary Pattern Formation: the effects of a rigorous approach 90
Delay Management Problem: Complexity Results and Robust Algorithms 89
Gathering of robots on meeting-points: feasibility and optimal resolution algorithms 88
Decomposing Octilinear Polygons into Triangles and Rectangles 87
Min-Max Coverage in Multi-Interface Networks. 85
Minimum-Traveled-Distance Gathering of Oblivious Robots over given Meeting Points 84
Graphs with bounded induced distance 83
Graph classes between parity and distance-hereditary graphs 83
Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases 82
Graphs with bounded induced distance 82
MinMax-Distance Gathering on given Meeting Points 82
Multi-stage recovery robustness for optimization problems: a new concept for planning under disturbances 82
(k,+)-distance-hereditary graphs 82
How to Gather Asynchronous Oblivious Robots on Anonymous Rings 81
Static and Dynamic Low-Congested Interval Routing Schemes 81
Compact-port routing models and applications to distance-hereditary graphs 81
Bamboo Garden Trimming Problem: Priority Schedulings 81
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation 80
Gathering Six Oblivious Robots on Anonymous Symmetric Rings” 79
Networks with Small Stretch Number 79
Computing on rings by oblivious robots: a unified approach for different tasks 78
Gathering robots in graphs: The central role of synchronicity 78
A model for the dynamic properties of integrating fibers: target localization in a three-dimentional space - I mathematical description 77
Gathering of Robots on Anonymous Grids and Trees without Multiplicity Detection 77
A New Fully Dynamic Algorithm for Distributed Shortest Paths and its Experimental Evaluation 77
What the Mantis shrimp's eye (possibly) tells its raptorial appendages 77
Self-spanner graphs 76
Analysis and implementation of a vlsi neural network 76
Gathering of Six Robots on Anonymous Symmetric Rings. 76
A routing algorithm for networks based on distance-hereditary topologies 76
Evaluation of recoverable-robust timetables on tree networks. 76
New results for neural networks and genetic algorithms in visual field diagnosis 76
A Distributed AOA Based Localization Algorithm for Wireless Sensor Networks 75
A unified approach for different tasks on rings in robot-based computing systems 75
Maintenance of Multi-level Overlay Graphs for Timetable Queries 75
Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings 75
On the equivalence in complexity among basic problems on bipartite and parity graphs 74
An electronic system for integrated management of patients’ data and radiological images 74
Bandwidth constrained multi-interface networks. 74
Robust Algorithms and Price of Robustness in Shunting Problems 74
Improved protocols for luminous asynchronous robots 74
The game of Scintillae: From cellular automata to computing and cryptography systems 73
Recoverable Robustness for Train Shunting Problems 72
A neural model for localizing targets in space accomplished by the eye of a Mantis shrimp 72
Consequences of limitation on weights in feed-forward multi-layer neural networks 72
A multimodal interface for a medical workstation 72
Gathering of Robots on Anonymous Grids without Multiplicity Detection. 72
Solving the Pattern Formation by Mobile Robots with Chirality 72
Minimize the Maximum Duty in Multi-interface Networks 71
Gathering on rings under the Look-Compute-Move model 71
Platform assignment 71
Characterizing the Computational Power of Mobile Robots on Graphs and Implications for the Euclidean Plane 71
Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements 71
A model for the dynamic properties of integrating fibers: target localization in a three-dimentional space - II computer simulation 70
Graph classes between parity and distance-hereditary graphs 70
Asynchronous Robots on graphs: Gathering 70
COFLEX: FLEXIBLE BRACELET ANTI COVID-19 to PROTECT CONSTRUCTION WORKERS 70
A Fully Dynamic Algorithm for Distributed Shortest Paths 69
Treelike comparability graphs: Characterization, recognition and applications. 69
Engineering a new algorithm for distributed shortest paths on dynamic networks 69
Online Bounded Coloring of Permutations and Overlap Graphs 69
Survivable Networks with Bounded Delay: The Edge Failure Case 69
A workstation for image processing and digitalization of conventional films 68
A graph theoretical approach to the shunting problem. 68
Embedded pattern formation by asynchronous robots without chirality 68
Partially Dynamic Concurrent Update of Distributed Shortest Paths 68
On minimum $k$-modal partition of permutations 67
An Extension to the Back-Propagation Algorithm 67
Functional integration of digital radiological equipment 67
On the representation and management of medical records in a knowledge based systems 67
On minimum k-modal partition of permutations 67
An Extension to the Back-Propagation Algorithm 67
Approximation algorithms for decomposing octilinear polygons 67
“Semi-Asynchronous”: a new scheduler in distributed computing 67
Distributed Positioning Algorithms for Ad-hoc Networks 66
Multi-Interface Wireless Networks: Complexity and Algorithms 65
Milord: Advanced database technology for implementing a multimedia medical workstation 65
Robust Algorithms and Price of Robustness in Shunting Problems 65
Dynamic Algorithms for Recoverable Robustness Problems 64
Partially dynamic efficient algorithms for distributed shortest paths 63
Asynchronous rendezvous with different maps 63
Distance-Hereditary Comparability Graphs 62
Distributed positioning algorithm for ad-hoc networks. 61
Recoverable robust timetables on trees. 61
Flow problems in Multi-Interface Networks 61
Static and Dynamic Low-Congested Interval Routing Schemes 61
Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies 61
Milord: Project result and future work. 60
On the online track assignment problem 59
Recoverable Robust Timetables: An Algorithmic Approach on Trees 59
Totale 7.796
Categoria #
all - tutte 41.651
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 41.651


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020355 0 0 0 0 0 0 0 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/2024824 243 42 34 110 39 214 12 24 3 42 14 47
2024/20251.791 164 67 238 122 367 295 437 101 0 0 0 0
Totale 10.033