BONIFACI, VINCENZO
 Distribuzione geografica
Continente #
NA - Nord America 2.796
AS - Asia 1.860
EU - Europa 1.852
SA - Sud America 301
AF - Africa 29
Continente sconosciuto - Info sul continente non disponibili 14
OC - Oceania 6
Totale 6.858
Nazione #
US - Stati Uniti d'America 2.768
SG - Singapore 1.000
RU - Federazione Russa 678
CN - Cina 366
IT - Italia 362
SE - Svezia 280
BR - Brasile 249
VN - Vietnam 196
DE - Germania 179
KR - Corea 100
IE - Irlanda 85
GB - Regno Unito 73
FI - Finlandia 72
HK - Hong Kong 58
IN - India 38
ID - Indonesia 35
AT - Austria 22
AR - Argentina 16
FR - Francia 15
CA - Canada 14
BD - Bangladesh 13
EC - Ecuador 11
NL - Olanda 10
RO - Romania 10
TR - Turchia 9
CO - Colombia 8
ES - Italia 8
EU - Europa 8
MX - Messico 8
NO - Norvegia 8
ZA - Sudafrica 8
CH - Svizzera 7
PL - Polonia 7
A2 - ???statistics.table.value.countryCode.A2??? 6
AU - Australia 6
HU - Ungheria 5
IL - Israele 5
IQ - Iraq 5
JP - Giappone 5
MA - Marocco 5
UA - Ucraina 5
AE - Emirati Arabi Uniti 4
BG - Bulgaria 4
EG - Egitto 4
PY - Paraguay 4
SA - Arabia Saudita 4
VE - Venezuela 4
BE - Belgio 3
CL - Cile 3
CR - Costa Rica 3
HR - Croazia 3
JO - Giordania 3
KE - Kenya 3
PE - Perù 3
UZ - Uzbekistan 3
AL - Albania 2
AZ - Azerbaigian 2
BO - Bolivia 2
DZ - Algeria 2
KG - Kirghizistan 2
LB - Libano 2
ME - Montenegro 2
NG - Nigeria 2
PA - Panama 2
PK - Pakistan 2
PS - Palestinian Territory 2
RS - Serbia 2
TN - Tunisia 2
AF - Afghanistan, Repubblica islamica di 1
BA - Bosnia-Erzegovina 1
BN - Brunei Darussalam 1
CG - Congo 1
CZ - Repubblica Ceca 1
DK - Danimarca 1
EE - Estonia 1
GA - Gabon 1
GR - Grecia 1
GT - Guatemala 1
IR - Iran 1
LT - Lituania 1
LY - Libia 1
MK - Macedonia 1
MN - Mongolia 1
MT - Malta 1
OM - Oman 1
PH - Filippine 1
PT - Portogallo 1
SK - Slovacchia (Repubblica Slovacca) 1
UY - Uruguay 1
Totale 6.858
Città #
Singapore 477
Chandler 456
Ashburn 220
Fairfield 197
Boardman 156
Woodbridge 144
Milan 137
Dallas 122
Wilmington 118
Dong Ket 101
Munich 101
Seoul 100
Dublin 82
Moscow 81
Princeton 77
Cambridge 76
Beijing 69
Houston 65
Helsinki 62
New York 60
Seattle 60
The Dalles 59
Hong Kong 57
Falkenstein 53
Rome 52
Columbus 50
San Diego 48
Ho Chi Minh City 39
Alatri 38
Shanghai 31
Ancona 30
Jakarta 30
Ann Arbor 27
Chicago 27
Santa Clara 25
Hanoi 23
Hefei 22
Los Angeles 20
London 19
Council Bluffs 18
São Paulo 18
San Mateo 17
Pune 15
Mumbai 14
Falls Church 13
Jacksonville 13
San Jose 13
Guangzhou 11
Stockholm 10
North Bergen 9
Rio de Janeiro 9
Hangzhou 8
Los Lunas 8
Paris 8
Washington 8
Belo Horizonte 7
Chiswick 7
Edinburgh 7
Nuremberg 7
Quito 7
Springfield 7
Altoona 6
Boston 6
Brasília 6
Fort Worth 6
Kilburn 6
Prineville 6
Vienna 6
Amsterdam 5
Bauru 5
Bologna 5
Buffalo 5
Curitiba 5
Guarulhos 5
Jyväskylä 5
Pomezia 5
Tokyo 5
Warsaw 5
Andover 4
Atlanta 4
Brooklyn 4
Cairo 4
Campinas 4
Casperia 4
Elk Grove Village 4
Haiphong 4
Mexico City 4
Naples 4
O'Fallon 4
Padova 4
Phoenix 4
San Francisco 4
Toronto 4
Amman 3
Brugg 3
Brussels 3
Casablanca 3
Chennai 3
Cleveland 3
Da Nang 3
Totale 4.018
Nome #
Pooling or Sampling: Collective Dynamics for Electrical Flow Estimation 225
Algorithms and complexity for periodic real-time scheduling 124
Algorithms for hierarchical and semi-partitioned parallel scheduling 123
Complexity and approximation in reoptimization 122
Algorithms and complexity for periodic real-time scheduling 121
Stackelberg routing in arbitrary networks 115
An approximation algorithm for the wireless gathering problem 114
The on-line asymmetric traveling salesman problem 114
Two results on slime mold computations 114
A constant-approximate feasibility test for multiprocessor real-time scheduling 113
On the Convergence Time of a Natural Dynamics for Linear Programming 110
A Laplacian approach to L1-norm minimization 110
A constant-approximate feasibility test for multiprocessor real-time scheduling 109
An approximation algorithm for the wireless gathering problem 108
An Entropic Gradient Structure in the Network Dynamics of a Slime Mold 107
A Java-based system for building animated presentations over the Web 106
A generalized parallel task model for recurrent real-time processes 106
Algorithms for Hierarchical and Semi-Partitioned Parallel Scheduling 106
Budgeted matching and budgeted matroid intersection via the gasoline puzzle 103
Scheduling real-time mixed-criticality jobs 102
Algorithms for auctions and games 101
Physarum can compute shortest paths: A short proof 101
Game-theoretic analysis of Internet switching with selfish users 99
The distributed wireless gathering problem 98
Partitioned EDF scheduling on a few types of unrelated multiprocessors 95
Stackelberg routing in arbitrary networks 95
An adversarial queueing model for online server routing 94
A generalized parallel task model for recurrent real-time processes 94
Improved multiprocessor global schedulability analysis 93
A revised model of fluid transport optimization in Physarum polycephalum 92
Physarum can compute shortest paths 91
Polynomial-time exact schedulability tests for harmonic real-time tasks 89
The online Prize-Collecting Traveling Salesman Problem 89
On-line algorithms, real time, the virtue of laziness, and the power of clairvoyance 89
The complexity of uniform Nash equilibria and related regular subgraph problems 87
Efficiency of restricted tolls in non-atomic network routing games 86
On the complexity of uniformly mixed nash equilibria and related regular subgraph problems 86
Feasibility analysis in the sporadic DAG task model 86
Budgeted matching and budgeted matroid intersection via the gasoline puzzle 85
Prize-Collecting Traveling Salesman and Related Problems 85
Schedulability Analysis of Conditional Parallel Task Graphs in Multicore Systems 85
On the compatibility of exact schedulability tests for global fixed priority pre-emptive scheduling with Audsley’s optimal priority assignment algorithm 84
ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors 81
Multiprocessor Real-Time Scheduling with Hierarchical Processor Affinities 81
Minimizing average flow time in sensor data gathering 80
Physarum can compute shortest paths 80
The distributed wireless gathering problem 79
A scheduling model inspired by control theory 79
Efficient Certifying Algorithms for Linear Classification 78
Physarum can compute shortest paths: Convergence proofs and complexity bounds 77
Portraying algorithms with Leonardo Web 77
Data Gathering in Wireless Networks 77
Memory-processor co-scheduling in fixed priority systems 77
Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems 76
Algoritmi per aste e giochi 76
Visual editing of animated algorithms: The Leonardo Web builder 76
New results on the complexity of uniformly mixed Nash equilibria 76
Exact Response Time Analysis for Fixed Priority Memory-Processor Co-Scheduling 76
The Global EDF Scheduling of Systems of Conditional Sporadic DAG Tasks 75
Scheduling real-time mixed-criticality jobs 75
Experimental Algorithms – 12th International Symposium, SEA 2013 74
Online k-server routing problems 74
Physarum-inspired multi-commodity flow dynamics 74
Minimizing flow time in the wireless gathering problem 73
Implementation of a speedup-optimal global EDF schedulability test 73
On the power of lookahead in on-line server routing problems 71
Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems 71
The on-line asymmetric traveling salesman problem 71
Feasibility analysis of sporadic real-time multiprocessor task systems 70
On the convergence time of a natural dynamics for linear programming 69
Online k-server routing problems 68
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems 68
Minimizing flow time in the wireless gathering problem 65
Mixed-Criticality scheduling of sporadic task systems 64
ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors 64
Feasibility analysis of sporadic real-time multiprocessor task systems 62
Models and Algorithms for Online Server Routing 60
On a Voter Model with Context-Dependent Opinion Adoption 55
On explorers, chasers and cameramen 48
Feasibility analysis of recurrent DAG tasks is PSPACE-hard 39
Egalitarian roommate allocations: Complexity and stability 38
Totale 7.103
Categoria #
all - tutte 38.076
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 38.076


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2020/2021646 0 0 0 0 0 1 0 101 255 49 94 146
2021/2022854 93 40 17 17 113 72 99 34 68 62 40 199
2022/20231.154 139 140 50 114 90 257 1 126 154 5 58 20
2023/2024498 109 53 49 19 29 113 26 66 0 12 0 22
2024/20252.210 30 87 172 79 60 91 651 401 165 85 167 222
2025/20261.704 302 330 180 302 342 248 0 0 0 0 0 0
Totale 7.103