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


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2021/2022953 33 59 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/20277 7 0 0 0 0 0 0 0 0 0 0 0
Totale 23.187