LEUCCI, STEFANO
 Distribuzione geografica
Continente #
NA - Nord America 1.283
EU - Europa 776
AS - Asia 295
Continente sconosciuto - Info sul continente non disponibili 3
SA - Sud America 3
AF - Africa 1
OC - Oceania 1
Totale 2.362
Nazione #
US - Stati Uniti d'America 1.275
IE - Irlanda 401
CN - Cina 140
TR - Turchia 127
IT - Italia 76
SE - Svezia 73
UA - Ucraina 60
DE - Germania 55
GB - Regno Unito 40
FI - Finlandia 24
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
SG - Singapore 1
VE - Venezuela 1
ZA - Sudafrica 1
Totale 2.362
Città #
Dublin 401
Chandler 301
Jacksonville 244
Izmir 66
New York 58
Lawrence 52
Princeton 52
Ashburn 50
Nanjing 50
Wilmington 48
San Mateo 33
Boardman 32
L'aquila 26
Los Angeles 19
Nanchang 18
Shenyang 15
Cedar Knolls 13
Milan 13
Tianjin 11
Kunming 10
Des Moines 9
Mountain View 9
Rome 9
Seattle 9
Ann Arbor 8
Brussels 6
Centrale 6
Dong Ket 6
Falls Church 6
Washington 6
Changchun 5
Jinan 5
Tappahannock 5
Verona 5
Hebei 4
Ottawa 4
Pune 4
Venezia 4
Zhengzhou 4
Changsha 3
Edinburgh 3
Helsinki 3
Norwalk 3
Stockholm 3
Woodbridge 3
Aquila 2
Atlanta 2
Beijing 2
Bremen 2
Budapest 2
Chicago 2
Copenhagen 2
Denver 2
Fremont 2
Guangzhou 2
Houston 2
Jiaxing 2
Lanzhou 2
Lappeenranta 2
London 2
Miami 2
Oslo 2
Andover 1
Auburn Hills 1
Belgrade 1
Chisinau 1
Cormeilles-en-Parisis 1
Dallas 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
Piraeus 1
Redwood City 1
Saigon 1
San Jose 1
Staten Island 1
Teramo 1
Tokyo 1
Toronto 1
Urbana 1
Totale 1.710
Nome #
Dynamic Maintenance of a Shortest-Path Tree on Homogeneous Batches of Updates: New Algorithms and Experiments 83
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 81
Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game 78
The Max-Distance Network Creation Game on General Host Graphs 71
Experimental Evaluation of Dynamic Shortest Path Tree Algorithms on Homogeneous Batches 70
The max-distance network creation game on general host graphs 69
Fault-Tolerant Approximate Shortest-Path Trees 68
Exact and approximate algorithms for movement problems on (special classes of) graphs 68
Network Creation Games with Traceroute-Based Strategies 68
Dynamically Maintaining Shortest Path Trees under Batches of Updates 67
An improved algorithm for computing all the best swap edges of a tree spanner 64
Effective edge-fault-tolerant single-source spanners via best (or good) swap edges 64
Fault-Tolerant Approximate Shortest-Path Trees 63
Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs 62
On the clustered shortest-path tree problem 62
Compact and fast sensitivity oracles for single-source distances 62
A faster computation of all the best swap edges of a tree spanner 62
Multiple-edge-fault-tolerant approximate shortest-path trees 60
Locality-Based Network Creation Games 59
Improved Purely Additive Fault-Tolerant Spanners 58
Locality-based Network Creation Games 58
Path-Fault-Tolerant Approximate Shortest-Path Trees 55
Effcient oracles and routing schemes for replacement paths 51
Dual-mode greedy algorithms can save energy 51
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem 49
Cutting Bamboo Down to Size 43
Optimal sorting with persistent comparison errors 43
On the PSPACE - Completeness of peg duotaire and other peg-jumping games 41
Approximate Minimum Selection with Unreliable Comparisons 38
Bejeweled, candy crush and other match-three games are (NP-)hard 35
Tracking Routes in Communication Networks 34
An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner 33
Tracking routes in communication networks 32
Faster motif counting via succinct color coding and adaptive sampling 31
Network creation games with traceroute-based strategies 29
Trainyard is NP-Hard 29
New Approximation Algorithms for the Heterogeneous Weighted Delivery Problem 27
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers 27
Cutting bamboo down to size 27
Resilient dictionaries for randomly unreliable memory 26
On the complexity of two dots for narrow boards and few colors 26
Motivo: Fast Motif Counting via Succinct Color Coding and Adaptive Sampling 24
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 24
Optimal dislocation with persistent errors in subquadratic time 24
Trainyard is NP-hard 24
Tracks from hell — When finding a proof may be easier than checking it 23
Multiple-Edge-Fault-Tolerant Approximate Shortest-Path Trees 23
Sorting with recurrent comparison errors 23
Motif counting beyond five nodes 23
Optimal Dislocation with Persistent Errors in Subquadratic Time 22
No truthful mechanism can be better than n approximate for two natural problems 21
Tracks from hell - When finding a proof may be easier than checking it 20
Resilient Level Ancestor, Bottleneck, and Lowest Common Ancestor Queries in Dynamic Trees 17
Blackout-Tolerant Temporal Spanners 14
Sparse Temporal Spanners with Low Stretch 13
New approximation algorithms for the heterogeneous weighted delivery problem 13
Blackout-tolerant temporal spanners 2
Finding Diameter-Reducing Shortcuts in Trees 1
Totale 2.435
Categoria #
all - tutte 10.516
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 10.516


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2018/201998 0 0 0 0 0 0 0 0 0 0 13 85
2019/2020192 42 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/2024237 35 15 20 23 27 93 3 2 0 16 3 0
Totale 2.435