LEUCCI, STEFANO
 Distribuzione geografica
Continente #
NA - Nord America 1.308
EU - Europa 782
AS - Asia 396
Continente sconosciuto - Info sul continente non disponibili 3
SA - Sud America 3
AF - Africa 1
OC - Oceania 1
Totale 2.494
Nazione #
US - Stati Uniti d'America 1.300
IE - Irlanda 401
CN - Cina 156
TR - Turchia 127
SG - Singapore 86
IT - Italia 76
SE - Svezia 73
UA - Ucraina 60
DE - Germania 57
GB - Regno Unito 40
FI - Finlandia 28
FR - Francia 23
IN - India 12
VN - Vietnam 8
CA - Canada 7
BE - Belgio 6
A2 - ???statistics.table.value.countryCode.A2??? 2
CH - Svizzera 2
CO - Colombia 2
DK - Danimarca 2
HU - Ungheria 2
JP - Giappone 2
MD - Moldavia 2
NL - Olanda 2
NO - Norvegia 2
AE - Emirati Arabi Uniti 1
AU - Australia 1
BD - Bangladesh 1
ES - Italia 1
EU - Europa 1
GR - Grecia 1
IQ - Iraq 1
IR - Iran 1
KR - Corea 1
MX - Messico 1
PL - Polonia 1
RO - Romania 1
RS - Serbia 1
RU - Federazione Russa 1
VE - Venezuela 1
ZA - Sudafrica 1
Totale 2.494
Città #
Dublin 401
Chandler 301
Jacksonville 244
Singapore 76
Izmir 66
New York 58
Lawrence 52
Princeton 52
Ashburn 50
Nanjing 50
Wilmington 48
Boardman 33
San Mateo 33
L'aquila 26
Los Angeles 19
Nanchang 18
Shenyang 16
Santa Clara 14
Cedar Knolls 13
Milan 13
Tianjin 11
Kunming 10
Des Moines 9
Mountain View 9
Rome 9
Seattle 9
Ann Arbor 8
Dallas 7
Helsinki 7
Brussels 6
Centrale 6
Dong Ket 6
Falls Church 6
Washington 6
Changchun 5
Guangzhou 5
Jinan 5
Shanghai 5
Tappahannock 5
Verona 5
Hebei 4
Ottawa 4
Pune 4
Venezia 4
Zhengzhou 4
Changsha 3
Edinburgh 3
Norwalk 3
Stockholm 3
Woodbridge 3
Aquila 2
Atlanta 2
Beijing 2
Berlin 2
Bremen 2
Budapest 2
Chicago 2
Copenhagen 2
Denver 2
Fremont 2
Houston 2
Jiaxing 2
Lanzhou 2
Lappeenranta 2
London 2
Miami 2
Oslo 2
Andover 1
Auburn Hills 1
Belgrade 1
Chisinau 1
Clifton 1
Cormeilles-en-Parisis 1
Den Haag 1
Distrito Federal 1
Dubai 1
Fort Saskatchewan 1
Giulianova 1
Grafing 1
Haikou 1
Hangzhou 1
Hanoi 1
Istanbul 1
Johannesburg 1
Madrid 1
Mumbai 1
Niagara Falls 1
Ningbo 1
Paris 1
Philadelphia 1
Phoenix 1
Piraeus 1
Quanzhou 1
Redwood City 1
Saigon 1
San Jose 1
Staten Island 1
Teramo 1
Tokyo 1
Toronto 1
Totale 1.824
Nome #
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 85
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 82
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 80
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 72
The Max-Distance Network Creation Game on General Host Graphs 72
The max-distance network creation game on general host graphs 70
Exact and approximate algorithms for movement problems on (special classes of) graphs 70
Fault-Tolerant Approximate Shortest-Path Trees 69
Network Creation Games with Traceroute-Based Strategies 69
Dynamically Maintaining Shortest Path Trees under Batches of Updates 68
On the clustered shortest-path tree problem 66
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 66
Fault-Tolerant Approximate Shortest-Path Trees 66
Compact and fast sensitivity oracles for single-source distances 65
An improved algorithm for computing all the best swap edges of a tree spanner 65
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 64
A faster computation of all the best swap edges of a tree spanner 64
Multiple-edge-fault-tolerant approximate shortest-path trees 64
Locality-Based Network Creation Games 61
Improved Purely Additive Fault-Tolerant Spanners 59
Locality-based Network Creation Games 59
Path-Fault-Tolerant Approximate Shortest-Path Trees 56
Effcient oracles and routing schemes for replacement paths 53
Dual-mode greedy algorithms can save energy 53
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 52
Optimal sorting with persistent comparison errors 49
Cutting Bamboo Down to Size 45
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 43
Approximate Minimum Selection with Unreliable Comparisons 41
Tracking Routes in Communication Networks 38
Bejeweled, candy crush and other match-three games are (NP-)hard 38
Faster motif counting via succinct color coding and adaptive sampling 36
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 34
Tracking routes in communication networks 33
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 31
Network creation games with traceroute-based strategies 31
Trainyard is NP-Hard 30
Trainyard is NP-hard 29
Resilient dictionaries for randomly unreliable memory 28
On the complexity of two dots for narrow boards and few colors 28
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 28
Cutting bamboo down to size 28
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling 27
No truthful mechanism can be better than n approximate for two natural problems 27
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 26
Optimal dislocation with persistent errors in subquadratic time 26
Tracks from hell — When finding a proof may be easier than checking it 25
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 25
Sorting with recurrent comparison errors 25
Motif counting beyond five nodes 25
Optimal Dislocation with Persistent Errors in Subquadratic Time 23
Tracks from hell - When finding a proof may be easier than checking it 23
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 19
Blackout-Tolerant Temporal Spanners 16
New approximation algorithms for the heterogeneous weighted delivery problem 16
Sparse Temporal Spanners with Low Stretch 15
Blackout-tolerant temporal spanners 6
Finding Diameter-Reducing Shortcuts in Trees 3
Totale 2.567
Categoria #
all - tutte 12.291
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 12.291


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/2020150 0 3 26 0 1 26 39 0 26 1 1 27
2020/2021291 9 34 6 35 34 5 35 1 48 17 56 11
2021/2022231 5 12 23 12 16 5 12 19 17 10 14 86
2022/20231.036 59 52 16 94 64 100 1 80 495 6 49 20
2023/2024244 35 15 20 23 27 93 3 2 0 16 4 6
2024/2025125 83 42 0 0 0 0 0 0 0 0 0 0
Totale 2.567