CRESCENZI, PIERLUIGI
 Distribuzione geografica
Continente #
NA - Nord America 12.510
EU - Europa 6.312
AS - Asia 4.133
SA - Sud America 483
Continente sconosciuto - Info sul continente non disponibili 138
AF - Africa 121
OC - Oceania 93
Totale 23.790
Nazione #
US - Stati Uniti d'America 12.392
IT - Italia 1.984
RU - Federazione Russa 1.676
SG - Singapore 1.122
HK - Hong Kong 918
CN - Cina 917
IE - Irlanda 509
VN - Vietnam 387
SE - Svezia 386
UA - Ucraina 376
BR - Brasile 373
KR - Corea 328
PL - Polonia 302
DE - Germania 253
CH - Svizzera 202
FR - Francia 180
FI - Finlandia 147
GB - Regno Unito 145
IN - India 133
AU - Australia 92
CA - Canada 73
TR - Turchia 54
BD - Bangladesh 52
JO - Giordania 45
AR - Argentina 42
NL - Olanda 35
JP - Giappone 34
AT - Austria 33
ES - Italia 30
ID - Indonesia 24
CI - Costa d'Avorio 22
MX - Messico 21
ZA - Sudafrica 20
BE - Belgio 18
MA - Marocco 17
SC - Seychelles 17
CO - Colombia 16
IQ - Iraq 16
PK - Pakistan 15
SA - Arabia Saudita 15
CL - Cile 13
EC - Ecuador 13
PE - Perù 11
DZ - Algeria 9
EG - Egitto 8
IL - Israele 8
NP - Nepal 8
UZ - Uzbekistan 8
JM - Giamaica 7
KE - Kenya 7
PH - Filippine 7
PY - Paraguay 7
RO - Romania 6
TH - Thailandia 6
TN - Tunisia 6
IR - Iran 5
KZ - Kazakistan 5
TW - Taiwan 5
MD - Moldavia 4
MY - Malesia 4
NG - Nigeria 4
VE - Venezuela 4
AZ - Azerbaigian 3
DK - Danimarca 3
EU - Europa 3
GR - Grecia 3
GT - Guatemala 3
PA - Panama 3
PR - Porto Rico 3
PT - Portogallo 3
BO - Bolivia 2
CG - Congo 2
CR - Costa Rica 2
CZ - Repubblica Ceca 2
GE - Georgia 2
HN - Honduras 2
HU - Ungheria 2
LB - Libano 2
LK - Sri Lanka 2
LT - Lituania 2
LV - Lettonia 2
SN - Senegal 2
TT - Trinidad e Tobago 2
UY - Uruguay 2
AE - Emirati Arabi Uniti 1
AL - Albania 1
AM - Armenia 1
AO - Angola 1
BG - Bulgaria 1
BH - Bahrain 1
BJ - Benin 1
BS - Bahamas 1
BW - Botswana 1
BY - Bielorussia 1
DO - Repubblica Dominicana 1
EE - Estonia 1
ET - Etiopia 1
GA - Gabon 1
HR - Croazia 1
KG - Kirghizistan 1
Totale 23.644
Città #
Santa Clara 3.281
Fairfield 1.142
Ashburn 1.036
Singapore 764
Hong Kong 585
Woodbridge 540
Jacksonville 527
Dublin 505
Chandler 500
Cambridge 490
Seattle 480
Houston 420
San Jose 398
Wilmington 361
Milan 327
Seoul 322
Florence 296
Warsaw 294
Hefei 221
Ann Arbor 187
Beijing 184
Bern 184
Rome 170
Council Bluffs 158
Princeton 155
Buffalo 151
Lauterbourg 126
Los Angeles 125
The Dalles 123
Ho Chi Minh City 117
Boston 115
Hanoi 97
Lawrence 90
Melbourne 89
Altamura 86
Mumbai 69
Boardman 65
Moscow 63
San Diego 61
Phoenix 59
Medford 58
Naples 49
Dallas 46
Turin 44
New York 41
Kent 34
Tokyo 33
Izmir 32
Norwalk 32
Vienna 32
Figino 31
Columbus 30
Shanghai 30
West Jordan 28
Chicago 23
Clifton 23
Palermo 23
São Paulo 23
Abidjan 22
Verona 21
Bologna 20
Hillsboro 20
Frankfurt Am Main 19
Guangzhou 19
Haiphong 19
Barcelona 18
Helsinki 18
Curitiba 17
Genoa 17
London 17
Toronto 17
Bari 16
Des Moines 16
Falls Church 15
Miano 14
Munich 14
Tianjin 14
Auburn Hills 13
Chennai 13
Da Nang 13
New Delhi 13
Saint Petersburg 13
Scandicci 13
Atlanta 12
Brussels 12
Rio de Janeiro 12
Arezzo 11
Frankfurt am Main 11
Philadelphia 11
San Francisco 11
Andover 10
Belo Horizonte 10
Brescia 10
Dearborn 10
Johannesburg 10
Paris 10
Redondo Beach 10
Zurich 10
Dhaka 9
Jakarta 9
Totale 16.164
Nome #
C : C++ = JAVAMM: JAVA 616
On two collateral effects of using algorithm visualizations 349
EUCALYPT: efficient tree reconciliation enumerator 331
MeDuSa: a multi-draft based scaffolder 301
An Environment for Self-Assessing Java Programming Skills in Undergraduate First Programming Courses 265
TOWARDS A TAXONOMY OF NETWORK PROTOCOL VISUALIZATION TOOLS 262
Greedily improving our own closeness centrality in a network 257
GOCCE DI JAVA 246
STRUTTURE DI DATI E ALGORITMI. PROGETTAZIONE, ANALISI E VISUALIZZAZIONE 244
An Eclipse IDE for Teaching Java-- 233
DEVELOPMENT OF AN ECB ON COMPUTER NETWORKS BASED ON WWW TECHNOLOGIES 224
Playful learning for kids with special educational needs 223
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs 219
Computing top-k Closeness Centrality Faster in Unweighted Graphs 219
ON WEIGHTED VS UNWEIGHTED VERSIONS OF COMBINATORIAL OPTIMIZATION PROBLEMS 212
A UNIFORM APPROACH TO DEFINE COMPLEXITY CLASSES 211
APPROXIMATE SOLUTION OF NP OPTIMIZATION PROBLEMS 209
Blind image clustering based on the Normalized Cuts criterion for camera identification 209
A NOTE ON OPTIMAL AREA ALGORITHMS FOR UPWARD DRAWINGS OF BINARY TREES 207
A TOOL TO DEVELOP ELECTRONIC COURSE BOOKS BASED ON WWW TECHNOLOGIES, RESOURCES AND USABILITY CRITERIA 205
A SHORT GUIDE TO APPROXIMATION PRESERVING REDUCTIONS 203
An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs 202
A Phygital Approach to Playful Experience in Learning Process for Kids with Special Educational Needs 201
ON COMPUTING AD-HOC SELECTIVE FAMILIES 201
Cophylogeny reconstruction via an approximate bayesian computation 199
A NOTE ON THE APPROXIMATION OF THE MAX CLIQUE PROBLEM 198
PARSIMONIOUS FLOODING IN DYNAMIC GRAPHS 196
Approximating the Temporal Neighbourhood Function of Large Temporal Graphs 194
Smooth movement and Manhattan path based random waypoint mobility 193
NETPRIDE: AN INTEGRATED ENVIRONMENT FOR DEVELOPING AND VISUALIZING COMPUTER NETWORK PROTOCOLS 190
TEXT SPARSIFICATION VIA LOCAL MAXIMA 189
THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH DEGREE SUBGRAPH PROBLEM 189
ON COMPUTING THE DIAMETER OF REAL-WORLD DIRECTED (WEIGHTED) GRAPHS 188
Computing top-k closeness centrality faster in unweighted graphs 188
An ant-colony based approach for real-time implicit collaborative information seeking 186
OPTIMAL COVERING DESIGNS: COMPLEXITY RESULTS AND NEW BOUNDS 185
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs. With an application to the six degrees of separation games 185
On computing the diameter of real-world undirected graphs 182
On computing the hyperbolicity of real-world graphs 181
SPERNER'S LEMMA AND ROBUST MACHINES 181
SEARCH DATA STRUCTURES FOR SKEWED STRINGS 180
ON APPROXIMATION SCHEME PRESERVING REDUCIBILITY AND ITS APPLICATIONS 179
APPROXIMATION ON THE WEB: A COMPENDIUM OF NP OPTIMIZATION PROBLEMS 178
Java--Meets Eclipse - An IDE for Teaching Java Following the Object-later Approach 178
ON APPROXIMATION SCHEME PRESERVING REDUCIBILITY AND ITS APPLICATIONS 177
COMPLEXITY AND APPROXIMATION. COMBINATORIAL OPTIMIZATION PROBLEMS AND THEIR APPROXIMABILITY PROPERTIES 176
ON THE COMPLEXITY OF COMPUTING MINIMUM ENERGY CONSUMPTION BROADCAST SUBGRAPHS 176
A NOTE ON THE DESCRIPTIVE COMPLEXITY OF MAXIMIZATION PROBLEMS 176
AVERAGE MEASURE, DESCRIPTIVE COMPLEXITY AND APPROXIMATION OF MAXIMIZATION PROBLEMS 175
THE MINIMUM LIKELY COLUMN COVER PROBLEM 175
On the complexity of the shortest-path broadcast problem 175
RELATIVE COMPLEXITY OF EVALUATING THE OPTIMUM COST AND CONSTRUCTING THE OPTIMUM FOR MAXIMIZATION PROBLEMS 174
ON THE HAMMING DISTANCE OF CONSTRAINT SATISFACTION PROBLEMS 173
Performance Evaluation of a Chord-Based JXTA Implementation 173
TEXT SPARSIFICATION VIA LOCAL MAXIMA 172
Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound 172
LINEAR AREA UPWARD DRAWINGS OF AVL TREES 171
IP ADDRESS LOOKUP MADE FAST AND SIMPLE 171
FULLY INTEGRATING ALGORITHM VISUALIZATION INTO A CS2 COURSE 171
AN INTRODUCTION TO THE THEORY OF COMPUTATIONAL COMPLEXITY 171
ON-LINE LOAD BALANCING MADE SIMPLE: GREEDY STRIKES BACK 170
Degrees of Separation and Diameter in Large Graphs 170
STRUCTURE IN APPROXIMATION CLASSES 168
ADAPTING MOODLE TO BETTER SUPPORT CS EDUCATION 168
Assessing CS1 Java Skills: A Three-Year Experience 167
ON THE CONNECTIVITY OF BLUETOOTH-BASED AD HOC NETWORKS 166
COMPLETENESS IN APPROXIMATION CLASSES 164
MINIMUM-DELAY SCHEDULES IN LAYERED NETWORKS 163
ON-LINE LOAD BALANCING MADE SIMPLE: GREEDY STRIKES BACK 163
Rumor spreading in random evolving graphs 161
THE PARALLEL COMPLEXITY OF APPROXIMATING THE HIGH DEGREE SUBGRAPH PROBLEM 161
ON-LINE ALGORITHMS FOR THE CHANNEL ASSIGNMENT PROBLEM IN CELLULAR NETWORKS 159
STRICTLY-UPWARD DRAWINGS OF ORDERED SEARCH TREES 158
Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications. 158
ON THE COMPLEXITY OF PROTEIN FOLDING 158
OPTIMAL-AREA UPWARD DRAWINGS OF AVL TREES 157
MINIMUM-AREA H-V DRAWINGS OF COMPLETE BINARY TREES 157
ON THE CONNECTIVITY OF BLUETOOTH-BASED AD HOC NETWORKS 157
ADDING TEST GENERATION TO THE TEACHING MACHINE 157
PARSIMONIOUS FLOODING IN DYNAMIC GRAPHS 155
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets 155
REVERSIBLE EXECUTION AND VISUALIZATION OF PROGRAMS WITH LEONARDO 155
Requirements and design strategies for open source interactive computer science ebooks 155
PARALLEL APPROXIMATION OF OPTIMIZATION PROBLEMS 154
MINIMUM VERTEX COVER, DISTRIBUTED DECISION-MAKING, AND COMMUNICATION COMPLEXITY 154
Greedily improving our own centrality in a network 154
EQUILIBRIA FOR BROADCAST RANGE ASSIGNMENT GAMES IN AD-HOC NETWORKS 153
AN EXPERIMENTAL EVALUATION OF COVER DESIGN ALGORITHMS 153
PLATFORM INDEPENDENT VIRTUAL LABORATORY SYSTEM: SIMULATION OF GRADIENT ELUTION HPLC 153
ON THE COMPLEXITY OF PROTEIN FOLDING 152
DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING 150
INTRODUCTION TO THE THEORY OF COMPLEXITY 150
ON-LINE ALGORITHMS FOR THE CHANNEL ASSIGNMENT PROBLEM IN CELLULAR NETWORKS 150
MAKING ROLE ASSIGNMENT FEASIBLE: A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING ECOLOGICAL COLORINGS 150
Synchronous context-free grammars and optimal linear parsing strategies 149
Analyzing and comparing on-line news sources via (Two-Layer) incremental clustering 149
COMPLEXITY CLASSES AND SPARSE ORACLES 147
A NOTE ON THE SPATIALITY DEGREE OF GRAPHS 145
USING AVS TO EXPLAIN NP-COMPLETENESS 145
Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs 145
Totale 18.821
Categoria #
all - tutte 62.989
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 62.989


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022861 0 0 53 45 62 52 31 47 80 60 186 245
2022/20232.551 254 238 88 125 221 415 288 383 217 17 93 212
2023/2024790 37 119 182 61 50 81 35 96 14 53 42 20
2024/20256.458 187 547 268 676 2.234 1.422 71 430 259 84 148 132
2025/20266.198 524 901 539 303 596 265 676 368 482 378 178 988
2026/2027610 163 210 237 0 0 0 0 0 0 0 0 0
Totale 23.790